Exponential extinction time of the contact process on finite graphs

By Thomas Mountford, Jean-Christophe Mourrat, Daniel Valesin, Qiang Yao. 2012

65 citations recorded by the source corpus.

We study the extinction time τ of the contact process started with full occupancy on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on Z, 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 increasing sequence of trees of bounded degree, τ divided by its expectation converges in distribution to the unitary exponential distribution. These results also hold if one considers a sequence of graphs having spanning trees with uniformly bounded degree, and provide the basis for powerful coarse-graining arguments. To demonstrate this, we consider the contact process on a random graph with vertex degrees following a power law. Improving a result of Chatterjee and Durrett (2009), we show that, for any non-zero infection rate, the extinction time for the contact process on this graph grows exponentially with the number of vertices.

Subfields: Mathematical Physics, Statistical and Nonlinear Physics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/fdb37e3f24dcc86bef1775193558a1a561bf8f50

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Mathematical Physics

  1. George Pappas
  2. Victor M. Preciado
  3. Cameron Nowzari

In Statistical and Nonlinear Physics

  1. Daniel Valesin
  2. George Pappas
  3. Victor M. Preciado
  4. Cameron Nowzari
  5. Qiang Yao
  6. Thomas Mountford

In Statistics and Probability

  1. George Pappas
  2. Victor M. Preciado
  3. Cameron Nowzari

Citations in the corpus