Critical value asymptotics for the contact process on random graphs
Probability
2019-10-31 v1
Abstract
Recent progress in the study of the contact process [2] has verified that the extinction-survival threshold on a Galton-Watson tree is strictly positive if and only if the offspring distribution has an exponential tail. In this paper, we derive the first-order asymptotics of for the contact process on Galton-Watson trees and its corresponding analog for random graphs. In particular, if is appropriately concentrated around its mean, we demonstrate that as , which matches with the known asymptotics on the -regular trees. The same result for the short-long survival threshold on the Erd\H{o}s-R\'enyi and other random graphs are shown as well.
Keywords
Cite
@article{arxiv.1910.13958,
title = {Critical value asymptotics for the contact process on random graphs},
author = {Danny Nam and Oanh Nguyen and Allan Sly},
journal= {arXiv preprint arXiv:1910.13958},
year = {2019}
}
Comments
57 pages, 5 figures