2000 character limit reached
Exponential extinction time of the contact process on rank-one inhomogeneous random graphs
Published 5 Feb 2016 in math.PR and math.CO | (1602.02059v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.