Exponential extinction time of the contact process on finite graphs

DOI10.1016/J.SPA.2016.01.001MaRDI QIDQ271872zbMATH OpenOpenAlexWikidataFDO

Authors J-C. Mourrat, Daniel Valesin, Qiang Yao, Thomas Mountford

Publication date 20 April 2016

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.2972

zbMATH Keywords

contact processinteracting particle systemsmetastability

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Interacting particle systems in time-dependent statistical mechanics (82C22)

Abstract: We study the extinction time $uptau$ 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 $uptau$ grows exponentially with the number of vertices. Additionally, for any sequence of growing trees of bounded degree, $uptau$ 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 cite{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.

Review text

The contact process on a graph is a Markov process on the graph with parameter \(\lambda\) modelling the spread of infection with an absorbing state (i.e., no infection). One of the main questions for contact processes on finite graphs is the extinction time \(\tau\), the random time at which there is no infection. It is known that for some families of graphs, such as finite hypercubes, \(\tau\) is (roughly) exponential in the number of vertices for \(\lambda\) above some critical value \(\lambda_c\). This is the phenomenon of metastability.NEWLINENEWLINEThe present paper shows that for trees with bounded degree and \(\lambda\) greater than the critical value for \(\mathbb{Z}\), metastability holds as the size of the trees gets large. A result similar in spirit is shown for graphs which contain a spanning tree with bounded degree. The latter result is applied to large random graphs whose vertex-degrees are power-law distributed and metastability is shown for any \(\lambda > 0\).

Recommendations

• Extinction time for the contact process on general graphs
• Exponential rate for the contact process extinction time
• Super-exponential extinction time of the contact process on random geometric graphs
• Exponential extinction time of the contact process on rank-one inhomogeneous random graphs
• Phase transition of the contact process on random regular graphs

Cites work

• A general model of web graphs
• A Metastable Result for the Finite Multidimensional Contact Process
• Asymptotic behavior and distributional limits of preferential attachment graphs
• Contact processes on random graphs with power law degree distributions have critical value 0
• Domination by product measures
• Emergence of Scaling in Random Networks
• Existence of a constant for finite system extinction
• scientific article; zbMATH DE number 1350307 (Why is no real title available?)
• scientific article; zbMATH DE number 613272 (Why is no real title available?)
• scientific article; zbMATH DE number 1867213 (Why is no real title available?)
• scientific article; zbMATH DE number 3892344 (Why is no real title available?)
• Metastability for the contact process
• Metastable behavior of stochastic dynamics: A pathwise approach
• Metastable densities for the contact process on power law random graphs
• On the spread of viruses on the Internet
• Phase transition of the contact process on random regular graphs
• The contact process on a finite set
• The contact process on a finite set. II
• The contact process on a finite set. III: The critical case
• The contact process on finite homogeneous trees
• The contact process on finite homogeneous trees revisited
• The contact process on trees
• The diameter of a scale-free random graph
• Two phase transitions for the contact process on small worlds

Cited in

(26)

• Extinction time for the contact process on general graphs
• Exponential extinction time of the contact process on rank-one inhomogeneous random graphs
• Latent voter model on locally tree-like random graphs
• The contact process on random hyperbolic graphs: metastability and critical exponents
• Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs
• Exponential rate for the contact process extinction time
• The effect of avoiding known infected neighbors on the persistence of a recurring infection process
• Graph constructions for the contact process with a prescribed critical rate
• Phase transitions for chase-escape models on Poisson-Gilbert graphs
• Survival and extinction of epidemics on random graphs with general degree
• Evolutionary games on the torus with weak selection
• Contact process on a graph with communities
• Metastability: a brief introduction through three examples
• Metastability for the contact process on the preferential attachment graph
• Interacting particle systems as stochastic social dynamics
• Super-exponential extinction time of the contact process on random geometric graphs
• Pricing of cyber insurance contracts in a network model
• A stochastic model of active cyber defense dynamics
• The contact process on random graphs and Galton Watson trees
• Infection spread in random geometric graphs
• Subcritical epidemics on random graphs
• A simple proof of exponential decay of subcritical contact processes
• Degree-penalized contact processes
• The Eyring-Kramers law for the extinction time of the contact process on stars
• The contact process on dynamic regular graphs: subcritical phase and monotonicity
• The extinction of the contact process in a one-dimensional random environment with long-range interactions

This page was built for publication: Exponential extinction time of the contact process on finite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q271872)