Using PageRank to Characterize Web Structure
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on "local" properties of the web graph, we study the distribution of PageRank values on the web. Our measurements suggest that PageRank values on the web follow a power law. We then develop generative models for the web graph that explain this observation and moreover remain faithful to previously studied degree distributions. We analyze these models and compare the analysis to both snapshots from the web and to graphs generated by simulations on the new models. To our knowledge this represents the first modeling of the web that goes beyond fitting degree distributions on the web.
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
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 12×
“…is the key property that most web models try to capture [Adamic and Huberman 00, Barabási and Albert 99, Barabási et al. 00, Barabási et al. 99, Broder et al. 00, Kleinberg et al. 99, Kumar et al. 00, Kumar et al. 99, Aiello et al. 02, Drinea et al. 01, Cooper and Frieze 02, Levene et al.…”
BackgroundMethodResultInfluentialSelf-citationAlgorithmic Challenges in Web Search Engines
Henzinger, M. R. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129079 · Cited by 81 · cited 2×
“In a recent paper, Henzinger [Henzinger 03] lists modeling the web graph as one of the six important algorithmic problems that arise in web search engines.”
Background
Cited by
Efficient PageRank approximation via graph aggregation
Broder, A. Z., Lempel, R., Maghoul, F., & Pedersen, J. (2006) · Information Retrieval · doi:10.1007/s10791-006-7146-1 · Cited by 72
Asymptotic analysis for personalized Web search
Volkovich, Y., & Litvak, N. (2010) · Advances in Applied Probability · doi:10.1239/aap/1275055243 · Cited by 69
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
Litvak, N., Scheinhardt, W. R. W., & Volkovich, Y. (2007) · Internet Mathematics · doi:10.1080/15427951.2007.10129293 · Cited by 62
PageRank of Scale-Free Growing Networks
Avrachenkov, K., & Lebedev, D. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129120 · Cited by 44
Metadata
- Authors
- Pandurangan, G., Raghavan, P., & Upfal, E.
- Venue
- Internet Mathematics
- Publisher
- Internet Mathematics
- Published
- 2006-01
- Volume
- 3
- Issue
- 1
- Pages
- 1-20
- ISSN
- 1542-7951 (ISSN-L)
- 1944-9488
- OpenAlex
- W2158630329
- Cited by
- 86
- References
- 2
- FWCI
- 4.23
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Using PageRank to Characterize Web Structure. https://app.cochat.ai/papers/10.1080/15427951.2006.10129114
- The paper
- Pandurangan, G., Raghavan, P., & Upfal, E. (2006). Using PageRank to Characterize Web Structure. Internet Mathematics. https://doi.org/10.1080/15427951.2006.10129114
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.