CoChat

Inside PageRank

Bianchini, Monica, Gori, Marco, Scarselli, Franco · 2005 · ACM Transactions on Internet Technology

The DOI matches its Crossref record; 28 of the 29 references it cites were found in a registry or an index.

Abstract

Although the interest of a Web page is strictly related to its content and to the subjective readers' cultural background, a measure of the page authority can be provided that only depends on the topological structure of the Web. PageRank is a noticeable way to attach a score to Web pages on the basis of the Web connectivity. In this article, we look inside PageRank to disclose its fundamental properties concerning stability, complexity of computational scheme, and critical role of parameters involved in the computation. Moreover, we introduce a circuit analysis that allows us to understand the distribution of the page score, the way different Web communities interact each other, the role of dangling pages (pages with no outlinks), and the secrets for promotion of Web pages.

Overview

Integrity signals

Registry

Crossref · 10.1145/1052934.1052938

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 28 references

Research works printed but not linked: 2

  1. Golub , G. H. and Van Loan , C. F. 1993. Matrix computation . The Johns Hopkins University Press . Golub, G. H. and Van Loan, C. F. 1993. Matrix computation. The Johns Hopkins University Press.
  2. Richardson M. and Domingos P. 2002. The intellingent surfer: probabilistic combination of link and content information in pagerank. In Advances in Neural Information Processing Systems 14. MIT Press Cambridge Mass. Richardson M. and Domingos P. 2002. The intellingent surfer: probabilistic combination of link and content information in pagerank. In Advances in Neural Information Processing Systems 14. MIT Press Cambridge Mass.

Cited by

See all 539

Metadata

Authors
Bianchini, M., Gori, M., & Scarselli, F.
Affiliations
University of Siena (IT)
Venue
ACM Transactions on Internet Technology
Published
2005-02
Volume
5
Issue
1
Pages
92-128
ISSN
  • 1533-5399 (ISSN-L)
  • 1557-6051
OpenAlex
W2293888960
Cited by
539
References
29
Citations by year
2026: 15 · 2025: 25 · 2024: 30 · 2023: 23 · 2022: 20 · 2021: 17 · 2020: 21 · 2019: 16 · 2018: 18 · 2017: 24 · 2016: 25 · 2015: 20 · 2014: 21 · 2013: 26 · 2012: 30
FWCI
98.85
Type
journal article
Language
en
Open access
closed
Locations
  • ACM Transactions on Internet Technology (publishedVersion)
  • Use Siena air (University of Siena) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Computer Science › Information Systems › Web visibility and informetrics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
Keywords
PageRank, web connectivity, computational complexity, damping parameter, online communities, circuit analysis

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: Inside PageRank. https://app.cochat.ai/papers/10.1145/1052934.1052938
The paper
Bianchini, M., Gori, M., & Scarselli, F. (2005). Inside PageRank. ACM Transactions on Internet Technology. https://doi.org/10.1145/1052934.1052938

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.