CoChat

RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK

Open access
FORTUNATO, SANTO, FLAMMINI, ALESSANDRO · 2007 · International Journal of Bifurcation and Chaos
Cited by 46

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1142/s0218127407018439

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 46

Metadata

Authors
FORTUNATO, S., & FLAMMINI, A.
Venue
International Journal of Bifurcation and Chaos
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.