Critical value asymptotics for the contact process on random graphs
Abstract
Recent progress in the study of the contact process [2] has verified that the extinction-survival threshold λ1 on a Galton-Watson tree is strictly positive if and only if the offspring distribution has an exponential tail. In this paper, we derive the first-order asymptotics of λ1 for the contact process on Galton-Watson trees and its corresponding analog for random graphs. In particular, if is appropriately concentrated around its mean, we demonstrate that λ1() 1/E as E→ ∞, which matches with the known asymptotics on the d-regular trees. The same result for the short-long survival threshold on the Erdos-R\'enyi and other random graphs are shown as well.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.