English

A discontinuous phase transition in the threshold-$\theta \geq 2$ contact process on random graphs

Probability 2019-07-12 v1

Abstract

We study the discrete-time threshold-θ2\theta \geq 2 contact process on random graphs of general degrees. For random graphs with a given degree distribution μ\mu, we show that if μ\mu is lower bounded by θ+2\theta+2 and has finite kkth moments for all k>0k>0, then the discrete-time threshold-θ\theta contact process on the random graph exhibits a discontinuous phase transition in the emergence of metastability, thus answering a question of Chatterjee and Durrett \cite{cd13}. To be specific, we establish that (i) for any large enough infection probability p>p1p>p_1, the process started from the all-infected state w.h.p. survives for eΘ(n)e^{\Theta(n)}-time, maintaining a large density of infection; (ii) for any p<1p<1, if the initial density is smaller than ε(p)>0\varepsilon(p)>0, then it dies out in O(logn)O(\log n)-time w.h.p.. We also explain some extensions to more general random graphs, including the Erd\H{o}s-R\'enyi graphs. Moreover, we prove that the threshold-θ\theta contact process on a random (θ+1)(\theta+1)-regular graph dies out in time nO(1)n^{O(1)} w.h.p..

Keywords

Cite

@article{arxiv.1907.05005,
  title  = {A discontinuous phase transition in the threshold-$\theta \geq 2$ contact process on random graphs},
  author = {Danny Nam},
  journal= {arXiv preprint arXiv:1907.05005},
  year   = {2019}
}

Comments

21 pages

R2 v1 2026-06-23T10:18:05.403Z