Majority Bootstrap Percolation on the Hypercube
Majority Bootstrap Percolation on the Hypercube
In majority bootstrap percolation on a graph G , an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain infected forever. We say that percolation occurs if eventually …