Asymptotic formula on APL of fractal evolving networks generated by Durer Pentagon

Liang Huang and Yu Zheng

Chaos, Solitons & Fractals, 2023, vol. 167, issue C

Abstract: Complex networks constructed by fractals have many applications in many fields, such as the data center networks and fractal antennas. In this paper, we consider a kind of evolving networks modeled on the classical fractal, Durer Pentagon, whose nodes are all the solid pentagons in the construction of Durer Pentagon up to stage t. In this network, two nodes are neighbors if and only if the intersection of their corresponding pentagons is a line segment. Using self-similarity and renewal theorem, we obtain the asymptotic formula on average path length (APL) of our evolving network.

Keywords: Complex network; Durer Pentagon; Self-similarity; Average path length; Renewal theorem (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077922012218
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:167:y:2023:i:c:s0960077922012218

DOI: 10.1016/j.chaos.2022.113042

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. ().