Exponential extinction time of the contact process on finite graphs
Abstract
We study the extinction time of the contact process on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on , then, uniformly over all trees of degree bounded by a given number, the expectation of grows exponentially with the number of vertices. Additionally, for any sequence of growing trees of bounded degree, divided by its expectation converges in distribution to the unitary exponential distribution. These also hold if one considers a sequence of graphs having spanning trees with uniformly bounded degree. Using these results, we consider the contact process on a random graph with vertex degrees following a power law. Improving a result of Chatterjee and Durrett CD, we show that, for any infection rate, the extinction time for the contact process on this graph grows exponentially with the number of vertices.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.