Exponential extinction time of the contact process on rank-one inhomogeneous random graphs
Abstract
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R\'enyi 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.
0
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.