no. 13 · Wednesday 11 November 2026
3-Neighbor bootstrap percolation on two-dimensional grids
Abstract
In the $3$-neighbor bootstrap percolation process, a vertex becomes (and remains) infected if at least three of its neighbors are infected. We say that an initial configuration of infected vertices percolates if eventually all vertices are infected. We exactly determine the size of the minimum percolating set for the $3$-neighbor bootstrap percolation process on all remaining open cases for rectangular grid graphs $P_m\square P_n$. This extends earlier work of Dukes, Noel, and Romer.
- comments
- 25 pages, 14 figures
- fields
- Combinatorics, Probability