Abstract
The eigenvalues of the normalized Laplacian matrix of a network provide information on its structural properties and some relevant dynamical aspects, in particular for weight-dependent walk. In order to get the eigentime identity for weight-dependent walk, we need to obtain the eigenvalues and their multiplicities of the Laplacian matrix. Firstly, the model of the weighted scale-free triangulation networks is constructed. Then, the eigenvalues and their multiplicities of transition weight matrix are presented, after the recursive relationship of those eigenvalues at two successive generations are given. Consequently, the Laplacian spectrum is obtained. Finally, the analytical expression of the eigentime identity, indicating that the eigentime identity grows sublinearly with the network order, is deduced.
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.
