Super-exponential extinction time of the contact process on random geometric graphs
Probability
2017-07-20 v3
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 , the contact process on these graphs survives a time super-exponential in the number of vertices.
Keywords
Cite
@article{arxiv.1506.02373,
title = {Super-exponential extinction time of the contact process on random geometric graphs},
author = {Van Hao Can},
journal= {arXiv preprint arXiv:1506.02373},
year = {2017}
}
Comments
Accepted for publication in Combinatorics, Probability and Computing