The critical activation density in graph bootstrap percolation

Brett Kolesnik, Tamás Makai, Rajko Nenadov +3

In graph bootstrap percolation, edges of an Erdős-Rényi random graph ${\mathcal{G}}_{n,p}$ are initially active, and activation spreads to other edges of $K_n$ via the combinatorics…