Maximum percolation time in two-dimensional bootstrap percolation
A simple formula gives the maximum time for an n x n grid to become entirely infected having undergone a bootstrap percolation process.
F. Benevides, M. Przykucki
We consider a classic model known as bootstrap percolation on the n × n square grid. To each vertex of the grid we assign an initial state, infected or healthy, and then in consecutive rounds we infect every healthy vertex that has at least 2 already infected neighbours. We say that percolation occurs if the whole grid is eventually infected. In this paper, contributing to a recent series of extremal results in this field, we prove that the maximum time a bootstrap percolation process can take to eventually infect the entire vertex set of the grid is 13n^2/18 +O(n).
More in Bootstrap percolation
Percolation theory shows that the formation of giant clusters of neurons relies on a few parameters that could be measured experimentally.
A subset of bootstrap percolation models, which stabilise systems of cells on infinite lattices, exhibit non-trivial phase transitions.
The critical probability for bootstrap percolation, a process which mimics the spread of an infection in a graph, is bounded for Galton-Watson trees.