Bootstrap percolation, probabilistic cellular automata and sharpness
arXiv:2112.01778 · doi:10.1007/s10955-022-02922-6
Abstract
We establish new connections between percolation, bootstrap percolation, probabilistic cellular automata and deterministic ones. Surprisingly, by juggling with these in various directions, we effortlessly obtain a number of new results in these fields. In particular, we prove the sharpness of the phase transition of attractive absorbing probabilistic cellular automata, a class of bootstrap percolation models and kinetically constrained models. We further show how to recover a classical result of Toom on the stability of cellular automata w.r.t. noise and, inversely, how to deduce new results in bootstrap percolation universality from his work.
22 pages, improved presentation