Anderson transition for Google matrix eigenstates
arXiv:1502.00584 · doi:10.1002/andp.201500110
Abstract
We introduce a number of random matrix models describing the Google matrix G of directed networks. The properties of their spectra and eigenstates are analyzed by numerical matrix diagonalization. We show that for certain models it is possible to have an algebraic decay of PageRank vector with the exponent similar to real directed networks. At the same time the spectrum has no spectral gap and a broad distribution of eigenvalues in the complex plain. The eigenstates of G are characterized by the Anderson transition from localized to delocalized states and a mobility edge curve in the complex plane of eigenvalues.
arXiv comment9 pages, 12 figs, revtex
References in corpus (13)
- Anderson Transitions
- Absence of Anderson localization of light in a random ensemble of point scatterers
- Random unistochastic matrices
- Quantum computing of delocalization in small-world networks
- Ulam method and fractal Weyl law for Perron--Frobenius operators
- Ulam method for the Chirikov standard map
- Delocalization transition for the Google matrix
- Google matrix, dynamical attractors and Ulam networks
- Spectral properties of Google matrix of Wikipedia and other networks
- Sinai model in presence of dilute absorbers
- Universal Emergence of PageRank
- Google matrix of the citation network of Physical Review
- PageRank of integers