Spectral properties of the Google matrix of the World Wide Web and other directed networks
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
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 α 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 characterization of its stability.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051
Google's PageRank and Beyond: The Science of Search Engine Rankings
Langville, A. N., & Meyer, C. D. (2006) · doi:10.1515/9781400830329 · Cited by 814
Dynamics of Loschmidt echoes and fidelity decay
Gorin, T., Prosen, T., Seligman, T. H., & Žnidarič, M. (2006) · Physics Reports · doi:10.1016/j.physrep.2006.09.003 · Cited by 623
PageRank of Scale-Free Growing Networks
Avrachenkov, K., & Lebedev, D. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129120 · Cited by 44
Cited by
Paparo, G. D., & Martin-Delgado, M. A. (2012) · Scientific Reports · doi:10.1038/srep00444 · Cited by 136
Adiabatic Quantum Algorithm for Search Engine Ranking
Garnerone, S., Zanardi, P., & Lidar, D. A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.230506 · Cited by 102
Quantum Google algorithm: Construction and application to complex networks
Paparo, G. D., Müller, M., Comellas, F., & Martin-Delgado, M. A. (2014) · The European Physical Journal Plus · doi:10.1140/epjp/i2014-14150-y · Cited by 17
“In the classical PageRank case it was found that the effect of this parameter on ranking is large and that two rankings obtained using different values of this parameter can be very different [6].”
BackgroundMethodInfluential
Metadata
- Authors
- Georgeot, B., Giraud, O., & Shepelyansky, D. L.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2010-05-25
- Volume
- 81
- Issue
- 5
- Pages
- 056109-056109
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1991653062
- Cited by
- 41
- References
- 4
- FWCI
- 3.00
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Spectral properties of the Google matrix of the World Wide Web and other directed networks. https://app.cochat.ai/papers/10.1103/physreve.81.056109
- The paper
- Georgeot, B., Giraud, O., & Shepelyansky, D. L. (2010). Spectral properties of the Google matrix of the World Wide Web and other directed networks. Physical Review E. https://doi.org/10.1103/physreve.81.056109
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.