Exponential extinction time of the contact process on rank-one inhomogeneous random graphs

2016/02/05 by Van Hao Can, Can, Van Hao
Mathematics · Physics and Astronomy · #Combinatorics (math.CO) #Complex Network Analysis Techniques #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR) #Stochastic processes and statistical mechanics #Theoretical and Computational Physics

paper · pdf · doi:10.48550/arxiv.1602.02059

openalex publication_date 2016/02/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-Ré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.

Citations

• Contact Processes on Random Regular Graphs
• Super-exponential extinction time of the contact process on random geometric graphs

Related

• Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs
• Super-exponential extinction time of the contact process on random geometric graphs
• Extinction time for the contact process on general graphs
• Exponential rate for the contact process extinction time
• A Metastability Result for the Contact Process on a Random Regular Graph