RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
PageRank, the prestige measure for Web pages used by Google, is the stationary probability of a peculiar random walk on directed graphs, which interpolates between a pure random walk and a process where all nodes have the same probability of being visited. We give some exact results on the distribution of PageRank in the cases in which the damping factor q approaches the two limit values 0 and 1. When q → 0 and for several classes of graphs the distribution is a power law with exponent 2, regardless of the in-degree distribution. When q → 1 it can always be derived from the in-degree distribution of the underlying graph, if the out-degree is the same for all nodes.
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
Finding scientific gems with Google’s PageRank algorithm
Chen, P., Xie, H., Maslov, S., & Redner, S. (2007) · Journal of Informetrics · doi:10.1016/j.joi.2006.06.001 · Cited by 483
Using PageRank to Characterize Web Structure
Pandurangan, G., Raghavan, P., & Upfal, E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45655-4_36 · Cited by 164
Cited by
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
Determining Factors Behind the PageRank Log-Log Plot
Volkovich, Y., Litvak, N., & Donato, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_9 · Cited by 31
“Mathematical justifications have been proposed in [6, 19] for the preferential attachment models [3], and in [24], where the relation between PageRank and in-degree is modeled through a stochastic equation.”
BackgroundDistribution of PageRank Mass Among Principle Components of the Web
Avrachenkov, K., Litvak, N., & Pham, K. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_2 · Cited by 29
Metadata
- Authors
- FORTUNATO, S., & FLAMMINI, A.
- Venue
- International Journal of Bifurcation and Chaos
- Publisher
- World Scientific Pub Co Pte Ltd
- Published
- 2007-07
- Volume
- 17
- Issue
- 07
- Pages
- 2343-2353
- ISSN
- 0218-1274 (ISSN-L)
- 1793-6551
- OpenAlex
- W2062680454
- Cited by
- 46
- References
- 2
- FWCI
- 2.96
- 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: RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK. https://app.cochat.ai/papers/10.1142/s0218127407018439
- The paper
- FORTUNATO, S., & FLAMMINI, A. (2007). RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK. International Journal of Bifurcation and Chaos. https://doi.org/10.1142/s0218127407018439
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.