Pith. sign in

REVIEW 1 cited by

The contact process on finite homogeneous trees revisited

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1403.5927 v1 pith:F5RERLXB submitted 2014-03-24 math.PR

classification math.PR
keywords mathbblambdaprocesstreecontactconvergesconstantdistribution
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We consider the contact process with infection rate $\lambda$ on $\mathbb{T}_n^d$, the $d$-ary tree of height $n$. We study the extinction time $\tau_{\mathbb{T}_n^d}$, that is, the random time it takes for the infection to disappear when the process is started from full occupancy. We prove two conjectures of Stacey regarding $\tau_{\mathbb{T}_n^d}$. Let $\lambda_2$ denote the upper critical value for the contact process on the infinite $d$-ary tree. First, if $\lambda < \lambda_2$, then $\tau_{\mathbb{T}_n^d}$ divided by the height of the tree converges in probability, as $n \to \infty$, to a positive constant. Second, if $\lambda > \lambda_2$, then $\log \mathbb{E}[\tau_{\mathbb{T}_n^d}]$ divided by the volume of the tree converges in probability to a positive constant, and $\tau_{\mathbb{T}_n^d}/\mathbb{E}[\tau_{\mathbb{T}_n^d}]$ converges in distribution to the exponential distribution of mean 1.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The contact process on Scale-Free Percolation

    math.PR 2025-05 conditional novelty 7.0 of 10

    For scale-free percolation in the finite-variance regime γ>2, the contact process extinction time on an n-vertex box is at least exp(c n (log n)^{-A}) with high probability.

Pith tools