Exact eigenvalue spectrum of a class of fractal scale-free networks

Abstract

The eigenvalue spectrum of the transition matrix of a network encodes important information about its structural and dynamical properties. We study the transition matrix of a family of fractal scale-free networks and analytically determine all the eigenvalues and their degeneracies. We then use these eigenvalues to evaluate the closed-form solution to the eigentime for random walks on the networks under consideration. Through the connection between the spectrum of transition matrix and the number of spanning trees, we corroborate the obtained eigenvalues and their multiplicities.

Definitive version accepted for publication in EPL (Europhysics Letters)

References in corpus (8)

• Critical phenomena in complex networks
• Network Physiology reveals relations between network topology and physiological function
• First-passage times in complex scale-invariant media
• Scaling theory of transport in complex networks
• Fractal and Transfractal Recursive Scale-Free Nets
• Percolation in Hierarchical Scale-Free Nets
• Trapping in complex networks
• Transition from fractal to non-fractal scalings in growing scale-free networks

Cited by in corpus (2)

• Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
• On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival