Competing bootstrap processes on the random graph $G(n,p)$

Michele Garetto, Emilio Leonardi, Giovanni Luca Torrisi

We extend classical bootstrap percolation by introducing two concurrent, competing processes on an Erdős--Rényi random graph $G(n,p_n)$. Each node can assume one of three states:…