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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
