Eigentime identities of flower networks with multiple branches

Lifeng Xi, Qianqian Ye, Jialing Yao and Bingbin Sun

Physica A: Statistical Mechanics and its Applications, 2019, vol. 526, issue C

Abstract: For the fractal networks, the eigentime identity is the expected time for a walker going from one node to another. In this paper, we study a family of flower networks that have k parallel paths with lengths m1,m2,…,mk. Let Ct be the eigentime identity of the flower networks in generation t, then the obtained result shows that the eigentime identity is Ct≈(∑i=1kmi)∕(∑i=1kmi−1)t.

Keywords: Fractal networks; Flower networks; Laplacian spectrum; Eigentime identity (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437119304595
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

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:phsmap:v:526:y:2019:i:c:s0378437119304595

DOI: 10.1016/j.physa.2019.04.093

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().