Google matrix, dynamical attractors and Ulam networks
arXiv:0905.4162 · doi:10.1103/PhysRevE.81.036213
Abstract
We study the properties of the Google matrix generated by a coarse-grained Perron-Frobenius operator of the Chirikov typical map with dissipation. The finite size matrix approximant of this operator is constructed by the Ulam method. This method applied to the simple dynamical model creates the directed Ulam networks with approximate scale-free scaling and characteristics being rather similar to those of the World Wide Web. The simple dynamical attractors play here the role of popular web sites with a strong concentration of PageRank. A variation of the Google parameter or other parameters of the dynamical map can drive the PageRank of the Google matrix to a delocalized phase with a strange attractor where the Google search becomes inefficient.
9 pages, 11 figs; discussion, refs and fig added, data, title modified, research at http://www.quantware.ups-tlse.fr
References in corpus (4)
Cited by in corpus (18)
- Complex network approaches to nonlinear time series analysis
- Google matrix analysis of directed networks
- Spectral properties of the Google matrix of the World Wide Web and other directed networks
- Ulam method and fractal Weyl law for Perron--Frobenius operators
- Ulam method for the Chirikov standard map
- Towards two-dimensional search engines
- Google matrix and Ulam networks of intermittency maps
- Google matrix of Twitter
- Towards Google matrix of brain
- Poincaré recurrences and Ulam method for the Chirikov standard map
- Fractal Weyl law for Linux Kernel Architecture
- Small world of Ulam networks for chaotic Hamiltonian dynamics
- Google matrix of the citation network of Physical Review
- Google matrix analysis of DNA sequences
- PageRank model of opinion formation on Ulam networks
- Google matrix of business process management
- Anderson transition for Google matrix eigenstates
- Symbolic walk in regular networks