Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure

Qian Zhang, Yumei Xue, Daohua Wang and Min Niu

Chaos, Solitons & Fractals, 2019, vol. 122, issue C, 196-201

Abstract: In this paper, we study a hierarchical scale-free network with special fractal structure. We study the average path length and associate the average path length with the symbol length. Then using a recursive method, we obtain the asymptotic formula for average path length of our networks.

Keywords: Fractal; Hierarchical; Network; Average path; Asymptotic formula (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077918305435
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:122:y:2019:i:c:p:196-201

DOI: 10.1016/j.chaos.2019.03.021

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().