Answers are grounded in this paper and cite their sources.
We consider the contact process with infection rate λ on a random $(d+1)$-regular graph with n vertices, Gₙ. We study the extinction time τ Gₙ (that is, the random amount of time until the infection disappears) as n is taken to infinity. We establish a phase transition depending on whether λ is smaller or larger than λ ₁(T ᵈ), the lower critical value for the contact process on the infinite, $(d+1)$-regular tree: if λ < λ ₁(T ᵈ), τ Gₙ grows logarithmically with n, while if λ > λ ₁(T ᵈ), it grows exponentially with n. This result differs from the situation where, instead of Gₙ, the contact process is considered on the d-ary tree of finite height, since in this case, the transition is known to happen instead at the upper critical value for the contact process on T ᵈ.
No takes yet. Share an insight, caveat, or question.
Mourrat et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: