Contact Processes on Random Regular Graphs

26 Feb 2015  ·  Lalley Steven, Su Wei ·

We show that the contact process on a random $d$-regular graph initiated by a single infected vertex obeys the "cutoff phenomenon" in its supercritical phase. In particular, we prove that when the infection rate is larger than the critical value of the contact process on the infinite $d$-regular tree there are positive constants $C, p$ depending on the infection rate such that for sufficiently small $\epsilon> 0$, when the number $n$ of vertices is large then (a) at times $t< (C - \epsilon) \log n$ the fraction of infected vertices is vanishingly small, but (b) at time $(C + \epsilon) \log n$ the fraction of infected vertices is within $\epsilon$ of $p$, with probability $p$...

PDF Abstract
No code implementations yet. Submit your code now

Categories


Probability