Extinction time for the contact process on general graphs

DOI10.1007/S00440-016-0742-0MaRDI QIDQ1682493zbMATH OpenOpenAlexWikidataFDO

Authors Bruno Schapira, Daniel Valesin

Publication date 30 November 2017

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.04133, https://research.rug.nl/en/publications/extinction-time-of-the-contact-process-on-general-graphs(e1ca124d-0161-435d-a109-0226315fb63d).html

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 consider the contact process on finite and connected graphs and study the behavior of the extinction time, that is, the amount of time that it takes for the infection to disappear in the process started from full occupancy. We prove, without any restriction on the graph $G$, that if the infection rate $lambda$ is larger than the critical rate of the one-dimensional process, then the extinction time grows faster than $exp|G|/(log|G|{)}^{k}appa$ for any constant $kappa>1$, where $|G|$ denotes the number of vertices of $G$. Also for general graphs, we show that the extinction time divided by its expectation converges in distribution, as the number of vertices tends to infinity, to the exponential distribution with parameter 1. These results complement earlier work of Mountford, Mourrat, Valesin and Yao, in which only graphs of bounded degrees were considered, and the extinction time was shown to grow exponentially in $n$; here we also provide a simpler proof of this fact.

Recommendations

• Exponential rate for the contact process extinction time
• Exponential extinction time of the contact process on finite graphs
• The contact process on a finite set. II
• Phase transition of the contact process on random regular graphs
• Super-exponential extinction time of the contact process on random geometric graphs

Cites work

• scientific article; zbMATH DE number 1350307 (Why is no real title available?)
• scientific article; zbMATH DE number 613272 (Why is no real title available?)
• A Metastable Result for the Finite Multidimensional Contact Process
• Contact processes on random graphs with power law degree distributions have critical value 0
• Contact processes on random regular graphs
• Existence of a constant for finite system extinction
• Exponential extinction time of the contact process on finite graphs
• Interacting particle systems at Saint-Flour
• Large deviations for the contact process and two dimensional percolation
• Metastability for the contact process
• Metastability for the contact process on the configuration model with infinite mean degree
• Metastability for the contact process on the preferential attachment graph
• 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
• Random graph dynamics
• The central limit theorem for the right edge of supercritical oriented percolation
• The contact process on a finite set
• The contact process on a finite set. II
• The contact process on finite homogeneous trees
• The contact process on finite homogeneous trees revisited

Cited in

(18)

• The contact process seen from a typical infected site
• Contact processes with random recovery rates and edge weights on complete graphs
• Super-exponential extinction time of the contact process on random geometric graphs
• Results on the contact process with dynamic edges or under renewals
• Metastability for systems of interacting neurons
• Exponential extinction time of the contact process on finite graphs
• Phase transition of the contact process on random regular graphs
• The contact process on random hyperbolic graphs: metastability and critical exponents
• Existence of a constant for finite system extinction
• From survival to extinction of the contact process by the removal of a single edge
• Survival and extinction of epidemics on random graphs with general degree
• Contact process under heavy-tailed renewals on finite graphs
• Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs
• A Model for the Multi-Virus Contact Process
• Exponential rate for the contact process extinction time
• Subcritical epidemics on random graphs
• Critical value asymptotics for the contact process on random graphs
• Exponential extinction time of the contact process on rank-one inhomogeneous random graphs

This page was built for publication: Extinction time for the contact process on general graphs

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