Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 184

The DOI matches its Crossref record.

Contact processes on random graphs with power law degree distributions have critical value 0

Open access
Chatterjee, Shirshendu, Durrett, Rick · 2009 · The Annals of Probability

Abstract

If we consider the contact process with infection rate λ on a random graph on n vertices with power law degree distributions, mean field calculations suggest that the critical value λc of the infection rate is positive if the power α>3. Physicists seem to regard this as an established fact, since the result has recently been generalized to bipartite graphs by Gómez-Gardeñes et al. [Proc. Natl. Acad. Sci. USA 105 (2008) 1399–1404]. Here, we show that the critical value λc is zero for any value of α>3, and the contact process starting from all vertices infected, with a probability tending to 1 as n→∞, maintains a positive density of infected sites for time at least exp(n1−δ) for any δ>0. Using the last result, together with the contact process duality, we can establish the existence of a quasi-stationary distribution in which a randomly chosen vertex is occupied with probability ρ(λ). It is expected that ρ(λ)∼Cλβ as λ→0. Here we show that α−1≤β≤2α−3, and so β>2 for α>3. Thus even though the graph is locally tree-like, β does not take the mean field critical value β=1.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1214/09-aop471

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Cited by

See all 184

Metadata

Authors
Chatterjee, S., & Durrett, R.
Venue
The Annals of Probability
Published
2009-11-01
Volume
37
Issue
6
Pages
2332-2356
ISSN
0091-1798 (ISSN-L)
OpenAlex
W2032914791
Cited by
184
References
0
FWCI
5.29
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: Contact processes on random graphs with power law degree distributions have critical value 0. https://app.cochat.ai/papers/10.1214/09-aop471
The paper
Chatterjee, S., & Durrett, R. (2009). Contact processes on random graphs with power law degree distributions have critical value 0. The Annals of Probability. https://doi.org/10.1214/09-aop471

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.