Abstract
The eigentime identity of complex network is the expected time for a walker going from a node to another node. In this paper, we investigate a class of self-similar networks named sailboat networks. Using characteristic polynomials of normalized Laplacian and recurrent structure of Markov spectrum, we calculate eigentime identities of sailboat networks.
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.
