Super-exponential extinction time of the contact process on random geometric graphs

2015/01/01 by Can, Van Hao, Hal Id Hal, Van Hao Can · 2 citations
Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #FOS: Mathematics #Graph theory and applications #Probability (math.PR) #Stochastic processes and statistical mechanics #Theoretical and Computational Physics

paper · pdf · doi:10.48550/arxiv.1506.02373

openalex publication_date 2015/06/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we prove lower and upper bounds for the extinction time of the contact process on random geometric graphs with connecting radius tending to infinity. We obtain that for any infection rate λ>0, the contact process on these graphs survives a time super-exponential in the number of vertices.

Cited by

• Exponential extinction time of the contact process on rank-one inhomogeneous random graphs
• Phase transitions for contact processes on sparse random graphs via metastability and local limits

Related

• Extinction time for the contact process on general graphs
• Exponential extinction time of the contact process on rank-one inhomogeneous random graphs
• Exponential rate for the contact process extinction time
• The contact process on scale-free geometric random graphs
• Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs