A first order phase transition in the threshold 2 contact process on random r-regular graphs and r-trees

From MaRDI portal
Publication:1933600

DOI10.1016/J.SPA.2012.10.001zbMATH Open1261.60090arXiv1011.1567OpenAlexW2963251686MaRDI QIDQ1933600FDOQ1933600


Authors: Shirshendu Chatterjee, Rick Durrett Edit this on Wikidata


Publication date: 24 January 2013

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Abstract: We consider the discrete-time threshold-hetage2 contact process on a random r-regular graph on n vertices. In this process, a vertex with at least heta occupied neighbors at time t will be occupied at time t+1 with probability p, and vacant otherwise. We show that if hetage2 and rgeheta+2, epsilon1 is small and p is at least p1(epsilon1), then starting from all vertices occupied the fraction of occupied vertices stays above 12epsilon1 up to time exp(gamma1(r)n) with probability at least 1exp(gamma1(r)n). In the other direction, we show that for p2<1 there is an epsilon2(p2)>0 so that if plep2 and the number of occupied vertices in the initial configuration is at most epsilon2(p2)n, then with high probability all vertices are vacant at time C2(p2)log(n). These two conclusions imply that on the random r-regular graph there cannot be a quasi-stationary distribution with density of occupied vertices between 0 and epsilon2(p1), and allow us to conclude that the process on the r-tree has a first order phase transition.


Full work available at URL: https://arxiv.org/abs/1011.1567




Recommendations





Cited In (5)





This page was built for publication: A first order phase transition in the threshold \(\theta \geq 2\) contact process on random \(r\)-regular graphs and \(r\)-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1933600)