Bootstrap percolation on the high-dimensional Hamming graph

Mihyun Kang, Michael Missethan, Dominik Schmid

In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently wit…