Spectral properties of the Google matrix of the World Wide Web and other directed networks

Abstract

We study numerically the spectrum and eigenstate properties of the Google matrix of various examples of directed networks such as vocabulary networks of dictionaries and university World Wide Web networks. The spectra have gapless structure in the vicinity of the maximal eigenvalue for Google damping parameter $\alpha$ equal to unity. The vocabulary networks have relatively homogeneous spectral density, while university networks have pronounced spectral structures which change from one university to another, reflecting specific properties of the networks. We also determine specific properties of eigenstates of the Google matrix, including the PageRank. The fidelity of the PageRank is proposed as a new characterization of its stability.

8 pages, 12 figures, research done at http://www.quantware.ups-tlse.fr

References in corpus (4)

• Anderson Transitions
• Dynamics of Loschmidt echoes and fidelity decay
• Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
• Delocalization transition for the Google matrix

Cited by in corpus (9)

• Spectra of random graphs with arbitrary expected degrees
• Universality in the spectral and eigenfunction properties of random networks
• Normal mode analysis of spectra of random networks
• Fractal Weyl law for Linux Kernel Architecture
• Multifractality in random networks with power-law decaying bond strengths
• Move ordering and communities in complex networks describing the game of go
• Universal spectral correlations in ensembles of random normal matrices
• Two-Hop Walks Indicate PageRank Order
• Quantum Google Algorithm: Construction and Application to Complex Networks