Abstract
In this paper we prove lower and upper bounds for the extinction time of the contact process on random geometric graphs with connection 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference23 articles.
1. Contact processes on random graphs with power law degree distributions have critical value 0
2. Berger N. , Borgs C. , Chayes J. T. and Saberi A. (2005) On the spread of viruses on the internet. In SODA '05: Proc. 16th Annual ACM–SIAM Symposium on Discrete Algorithms, SIAM, pp. 301–310.
3. Domination by product measure;Liggett;Ann. Probab.,1997
4. Can V. H. (2016) Processus de contact sur des graphes aléatoires. PhD thesis, University of Aix–Marseille.
5. Metastability for the contact process on the configuration model with infinite mean degree
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献