The DOI matches its Crossref record; 22 of the 23 references it cites were found in a registry or an index.
Using PageRank to Characterize Web Structure
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“In the Web, the power law exponents can deviate depending on a data set and an estimator, but are believed to satisfy α = 1 . 1 for the in-degree and PageRank, and α ≈ 2 for the out-degree [9], [32], [38].”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [32]
In the citing paper
“Most experimental studies of the Web agree that the in-degree, the out-degree, and the PageRank of the Web follow power laws.”
From Asymptotic analysis for personalized Web search (2010) · cites this paper as [32]
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
(1999) · Cited by 12,854
Bollobás, B. (1985) · Cited by 6,196
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,098
Self-citationBroder, 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
Self-citationMean-field theory for scale-free random networks
Barabási, A.-Ĺ., Albert, R., & Jeong, H. (1999) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,261
Scale-free characteristics of random networks: the topology of the world-wide web
Barabási, A.-Ĺ., Albert, R., & Jeong, H. (2000) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00018-2 · Cited by 1,424
The Web as a Graph: Measurements, Models, and Methods
Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48686-0_1 · Cited by 1,027
Self-citationPower-Law Distribution of the World Wide Web
Adamic, L. A., & Huberman, B. A. (2000) · Science · doi:10.1126/science.287.5461.2115a · Cited by 1,022
Research works printed but not linked: 1
- B. Bollobas and O. Riordan. The diameter of a scale-free random graph. preprint, 2001. · DOI
Cited by
Sorted by citations
Langville, A. N., & Meyer, C. D. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 885
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · Proceedings · doi:10.1109/icdm.2009.14 · Cited by 618
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 606
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 470
A Survey of Eigenvector Methods for Web Information Retrieval
Langville, A. N., & Meyer, C. D. (2005) · SIAM Review · doi:10.1137/s0036144503424786 · Cited by 422
Metadata
- Authors
- Pandurangan, G., Raghavan, P., & Upfal, E.
- Affiliations
- Brown University (US)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 330-339
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2170582301
- Cited by
- 164
- References
- 23
- Citations by year
- 2025: 2 · 2024: 2 · 2023: 3 · 2022: 3 · 2021: 1 · 2020: 2 · 2019: 4 · 2018: 1 · 2017: 3 · 2016: 3 · 2015: 4 · 2014: 8 · 2013: 6 · 2012: 6
- FWCI
- 33.20
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Computer Science › Information Systems › Web visibility and informetrics
- Keywords
- PageRank, web graph, power-law distribution, degree distribution, search engine indexing, graph model, heavy-tailed distributions
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
