# Bootstrap Percolation, Probabilistic Cellular Automata and Sharpness

@article{Hartarsky2022BootstrapPP, title={Bootstrap Percolation, Probabilistic Cellular Automata and Sharpness}, author={Ivailo Hartarsky}, journal={Journal of Statistical Physics}, year={2022} }

We establish new connections between percolation, bootstrap percolation, probabilistic cellular automata and deterministic ones. Sur-prisingly, by juggling with these in various directions, we eﬀortlessly obtain a number of new results in these ﬁelds. 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…

## 2 Citations

### Subcritical bootstrap percolation via Toom contours

- Mathematics
- 2022

In this note we provide an alternative proof of the fact that subcritical bootstrap percolation models have a positive critical probability in any dimension. The proof relies on a recent extension…

### On a class of probabilistic cellular automata with size-$3$ neighbourhood and their applications in percolation games

- Mathematics
- 2022

A BSTRACT . Different versions of percolation games on Z 2 , with parameters p and q that indicate, respectively, the probability with which a site in Z 2 is labeled a trap and the probability with…

## References

SHOWING 1-10 OF 38 REFERENCES

### Bootstrap Percolation and Cellular Automata

- MathematicsArXiv
- 2021

The extent to which monotonicity constrains the possible asymptotic dynamics is explored, and the monotone automata that almost surely fill the space starting from any nontrivial Bernoulli measure are characterized.

### U-bootstrap percolation: Critical probability, exponential decay and applications

- MathematicsAnnales de l'Institut Henri Poincaré, Probabilités et Statistiques
- 2021

Bootstrap percolation is a wide class of monotone cellular automata with random initial state. In this work we develop tools for studying in full generality one of the three `universality' classes of…

### Ergodicity of some classes of cellular automata subject to noise

- Computer ScienceElectronic Journal of Probability
- 2019

This work considers various families of CA and proves that they are highly unstable against noise, meaning that they forget their initial conditions under slightest positive noise, manifested as the ergodicity of the resulting probabilistic CA.

### Statistical mechanics of probabilistic cellular automata

- Computer Science
- 1990

The behavior of discrete-time probabilistic cellular automata (PCA), which are Markov processes on spin configurations on ad-dimensional lattice, is investigated from a rigorous statistical mechanics point of view and uniqueness of the invariant state and exponential decay of correlations in a high-noise regime is demonstrated.

### Subcritical bootstrap percolation via Toom contours

- Mathematics
- 2022

In this note we provide an alternative proof of the fact that subcritical bootstrap percolation models have a positive critical probability in any dimension. The proof relies on a recent extension…

### On the Behavior of Some Cellular Automata Related to Bootstrap Percolation

- Mathematics
- 1992

convergence to total occupancy, and irc, the threshold for this convergence to occur exponentially fast. We locate these critical points for all the bootstrap percolation models, showing that they…

### Subcritical -bootstrap percolation models have non-trivial phase transitions

- Mathematics
- 2016

. We prove that there exist natural generalizations of the classical bootstrap percolation model on Z 2 that have non-trivial critical probabilities, and moreover we characterize all homogeneous,…

### Subcritical monotone cellular automata

- Mathematics
- 2022

. We study monotone cellular automata (also known as U -bootstrap percolation) in Z d with random initial conﬁgurations. Conﬁrming a conjecture of Balister, Bollob´as, Przykucki and Smith, who proved…

### Essential enhancements revisited

- Mathematics
- 2014

In 1991 Aizenman and Grimmett claimed that any `essential enhancement' of site or bond percolation on a lattice lowers the critical probability, an important result with many implications, such as…

### A new proof of the sharpness of the phase transition for Bernoulli percolation on Z d

- Mathematics
- 2015

We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation on Z. More precisely, we show that • for p < pc, the probability that the origin is…