Exponential extinction time of the contact process on rank-one inhomogeneous random graphs
classification
🧮 math.PR
math.CO
keywords
graphstimecontactexponentialextinctioninhomogeneousprocessrandom
read the original abstract
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{\'e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a metastable result for the extinction time is also proved.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.