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

@article{Georgeot2010SpectralPO,
  title={Spectral properties of the Google matrix of the World Wide Web and other directed networks},
  author={Bertrand Georgeot and Olivier Giraud and Dima L. Shepelyansky},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2010},
  volume={81 5 Pt 2},
  pages={
          056109
        }
}
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 α equal to unity. The vocabulary networks have relatively homogeneous spectral density, while university networks have pronounced spectral structures which change from one university to… 
View on PubMed
arxiv.org
33 Citations
Highly Influential Citations
4
Background Citations
8
Methods Citations
4

33 Citations

Citation Type

Citation Type

Spectral properties of Google matrix of Wikipedia and other networks
TLDR
It is shown that the correlator between PageRank and CheiRank vectors distinguishes different organizations of information flow on BBC and Le Monde web sites.
Google matrix analysis of directed networks
TLDR
This review describes the Google matrix analysis of directed complex networks demonstrating its efficiency on various examples including World Wide Web, Wikipedia, software architecture, world trade, social and citation networks, brain neural networks, DNA sequences and Ulam networks.
Spectral statistics in directed complex networks and universality of the Ginibre ensemble
Application of the Google matrix methods for characterization of directed networks
TLDR
These applications show how the information brought by the PageRank can be useful in various situations to gain some interesting or original insight about the studied system and how it is helping to understand the organization of the underlying directed network.
Construction and Application to Complex Networks
TLDR
The quantum algorithm has been shown to display an increased stability with respect to a variation of the damping parameter, and a more clearly pronounced power-law behaviour in the distribution of importance among the nodes, as compared to the classical algorithm.
Application of Random Matrix Theory to Complex Networks
TLDR
Spectral rigidity of spectra provides measure of randomness in underlying networks and potential of RMT framework is provided and obtained to understand and predict behavior of complex systems with underlying network structure.
Spectra of random graphs with arbitrary expected degrees
TLDR
The effect on the spectra of hubs in the network, vertices of unusually high degree, are studied, and it is shown that these produce isolated eigenvalues outside the main spectral band, akin to impurity states in condensed matter systems.
Google matrix of the world trade network
TLDR
The study establishes the existence of two solid state like domains of rich and poor countries which remain stable in time, while the majority of countries are shown to be in a gas like phase with strong rank fluctuations.
Towards two-dimensional search engines
TLDR
The statistical properties of information flow on PageRank-CheiRank plane are analyzed for networks of British, French and Italian Universities, Wikipedia, Linux Kernel, gene regulation and other networks and methods of spam links control are analyzed.
Quantum Google in a Complex Network
TLDR
The quantum algorithm displays an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance, as compared to the classical algorithm.
...
1
2
3
4
...

References

SHOWING 1-10 OF 53 REFERENCES
Delocalization transition for the Google matrix
TLDR
It is argued that, for networks with delocalized PageRank, the efficiency of information retrieval by Google-type search is strongly affected since the PageRank values have no clear hierarchical structure in this case.
Google matrix, dynamical attractors, and Ulam networks.
TLDR
The properties of the Google matrix generated by a coarse-grained Perron-Frobenius operator of the Chirikov typical map with dissipation are studied, which shows a power-law decay in PageRank that mirrors the decay of PageRank on the world wide web and a sensitivity to the value alpha inPageRank.
Spectral scaling and good expansion properties in complex networks
The existence of a scaling between the principal eigenvector and the subgraph centrality of a complex network indicates that the network has "good expansion" (GE) properties. GE is the important but…
PageRank of Scale-Free Growing Networks
TLDR
An analytical expression is found for the expected PageRank value in a scale-free growing network model as a function of the age of the growing network and theAge of a particular node and it is shown that PageRank follows closely a power law in the middle range of its values.
Google matrix and Ulam networks of intermittency maps
  • L. Ermann, D. Shepelyansky
  • Mathematics, Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2010
TLDR
The PageRank of the system is characterized by a power law decay with the exponent beta dependent on map parameters and the Google damping factor alpha so that the Google search in such a situation becomes inefficient.
Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
We consider the web hyperlink matrix used by Google for computing the PageRank whose form is given by A(c)=[cP +(1-c)E]T, where P is a row stochastic matrix, E is a row stochastic rank one matrix,…
Using PageRank to Characterize Web Structure
TLDR
It is suggested that PageRank values on the web follow a power law, and generative models for the web graph are developed that explain this observation and moreover remain faithful to previously studied degree distributions.
Topological structural classes of complex networks.
  • Ernesto Estrada
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
TLDR
It is shown that neither of three network growth mechanisms--random with uniform distribution, preferential attachment, and random with the same degree sequence as real network--is able to reproduce the four structural classes of complex networks.
Evolution of networks
TLDR
The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.
The Second Eigenvalue of the Google Matrix
TLDR
Analysis of the modulus of the second eigenvalue for the web hyperlink matrix used by Google for computing PageRank has implications for the convergence rate of the standard PageRank algorithm as the web scales, for the stability of PageRank to perturbations to the link structure of the web, and for the design of algorithms to speed up PageRank.
...
1
2
3
4
5
...