Maximal Percolation Time in Hypercubes Under 2-Bootstrap Percolation
Maximal Percolation Time in Hypercubes Under 2-Bootstrap Percolation
Bootstrap percolation is one of the simplest cellular automata. In $r$-bootstrap percolation on a graph $G$, an infection spreads according to the following deterministic rule: infected vertices of $G$ remain infected forever and in consecutive rounds healthy vertices with at least $r$ already infected neighbours become infected. Percolation occurs if …