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

Michele Garetto, Emilio Leonardi, Giovanni Luca Torrisi

We introduce and analyze a competitive extension of classical bootstrap percolation on the Erdős--Rényi random graph $G(n,p_n)$. Nodes can be red, black, or white, with red and bla…