Subcritical U-Bootstrap percolation models have non-trivial phase transitions
A subset of bootstrap percolation models, which stabilise systems of cells on infinite lattices, exhibit non-trivial phase transitions.
We prove that there exist natural generalizations of the classical bootstrap percolation model on ℤ2 that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this property. Van Enter (in the case d=r=2) and Schonmann (for all d≥r≥2) proved that r-neighbour bootstrap percolation models have trivial critical probabilities on ℤd for every choice of the parameters d≥r≥2: that is, an initial set of density p almost surely percolates ℤd for every p>0. These results effectively ended the study of bootstrap percolation on infinite lattices. Recently Bollobas, Smith and Uzzell introduced a broad class of percolation models called U-bootstrap percolation, which includes r-neighbour bootstrap percolation as a special case. They divided two-dimensional U-bootstrap percolation models into three classes -- subcritical, critical and supercritical -- and they proved that, like classical 2-neighbour bootstrap percolation, critical and supercritical U-bootstrap percolation models have trivial critical probabilities on ℤ2. They left open the question as to what happens in the case of subcritical families. In this paper we answer that question: we show that every subcritical U-bootstrap percolation model has a non-trivial critical probability on ℤ2. This is new except for a certain `degenerate' subclass of symmetric models that can be coupled from below with oriented site percolation. Our results re-open the study of critical probabilities in bootstrap percolation on infinite lattices, and they allow one to ask many questions of subcritical bootstrap percolation models that are typically asked of site or bond percolation.
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 simple formula gives the maximum time for an n x n grid to become entirely infected having undergone a bootstrap percolation process.
The critical probability for bootstrap percolation, a process which mimics the spread of an infection in a graph, is bounded for Galton-Watson trees.