Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS

卷:434

Article

Gao, Fei¹  Le, Anbo²  Xi, Lifeng³  Yin, Shuhua² 

[1] Zhejiang Wanli Univ, Sch Comp Sci & Informat Technol, Ningbo 315100, Zhejiang, Peoples R China

[2] Zhejiang Wanli Univ, Inst Math, Ningbo 315100, Zhejiang, Peoples R China

[3] Ningbo Univ, Dept Math, Ningbo 315211, Zhejiang, Peoples R China

关键词: Fractal;    Sierpinski gasket;    Network;    Self-similarity;   

DOI  :  10.1016/j.jmaa.2015.10.001

来源: Elsevier

【 摘 要 】

In this paper, we introduce a new method to construct evolving networks based on the construction of the Sierpinski gasket. Using self-similarity and renewal theorem, we obtain the asymptotic formula for average path length of our evolving networks. (C) 2015 Elsevier Inc. All rights reserved.

【 授权许可】

Free