Skip to main content

Bootstrap Percolation, Probabilistic Cellular Automata and Sharpness

Journal of Statistical Physics volume 187, Article number: 21 (2022) Cite this article

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.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Data Availability

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

Notes

  1. More generally, PCA are defined identically by a rates measure supported not only on \(\mathscr {U} \), but on the entire power set of \({\text{\O}mega }_R\). However, attractiveness is essential for everything we will say, so we restrict directly to the relevant setting. See e.g. [27] for problems arising immediately without this assumption.

  2. This property is sometimes called freezing to distinguish from attractiveness, which is also a type of monotonicity.

  3. There may be issues defining this if \(\chi \) has infinite support. We will only consider finitely supported \(\chi \) measures in this work.

  4. We refer the reader to [20] for a related correspondence between PCA and equilibrium statistical mechanics models.

References

  1. Aizenman, M., Barsky, D.J.: Sharpness of the phase transition in percolation models. Commun. Math. Phys. 108(3), 489–526 (1987)

    ADS  MathSciNet  Article  Google Scholar 

  2. Aizenman, M., Grimmett, G.: Strict monotonicity for critical points in percolation and ferromagnetic models. J. Stat. Phys. 63(5–6), 817–835 (1991)

    ADS  MathSciNet  Article  Google Scholar 

  3. Balister, P., Bollobás, B., Morris, R., Smith, P.: Subcritical monotone cellular automata, arXiv e-prints (2022), available at arXiv:2203.01917

  4. Balister, P., Bollobás, B., Przykucki, M., Smith, P.: Subcritical U-bootstrap percolation models have non-trivial phase transitions. Trans. Am. Math. Soc. 368(10), 7385–7411 (2016)

    MathSciNet  Article  Google Scholar 

  5. Balister, P., Bollobás, B., Riordan, O.: Essential enhancements revisited, arXiv e-prints (2014), available at arXiv:1402.0834

  6. Berman, P., Simon, J.: Investigations of fault-tolerant networks of computers. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 66–77 (1988)

  7. Bezuidenhout, C., Gray, L.: Critical attractive spin systems. Ann. Probab. 22(3), 1160–1194 (1994)

    MathSciNet  Article  Google Scholar 

  8. Bezuidenhout, C., Grimmett, G.: Exponential decay for subcritical contact and percolation processes. Ann. Probab. 19(3), 984–1009 (1991)

    MathSciNet  Article  Google Scholar 

  9. Bollobás, B., Smith, P., Uzzell, A.: Monotone cellular automata in a random environment. Comb. Probab. Comput. 24(4), 687–722 (2015)

    MathSciNet  Article  Google Scholar 

  10. Bramson, M., Gray, L.: A useful renormalization argument, In: Random Walks, Brownian Motion, and Interacting Particle Systems, pp. 113–152 (1991)

  11. Cancrini, N., Martinelli, F., Roberto, C., Toninelli, C.: Kinetically constrained spin models. Probab. Theory Relat. Fields 140(3–4), 459–504 (2008)

    MathSciNet  MATH  Google Scholar 

  12. Duminil-Copin, H., Raoufi, A., Tassion, V.: Sharp phase transition for the random cluster and Potts models via decision trees. Ann. Math. 189(1), 75–99 (2019)

    MathSciNet  Article  Google Scholar 

  13. Duminil-Copin, H., Tassion, V.: A new proof of the sharpness of the phase transition for Bernoulli percolation on \(Z^d\). Enseign. Math. 62(1), 199–206 (2016)

    MathSciNet  Article  Google Scholar 

  14. Gács, P.: A new version of Toom’s proof, arXiv e-prints (2021), available at arXiv:2105.05968

  15. Gray, L.F.: Toom’s stability theorem in continuous time. In: Perplexing Problems in Probability, pp. 331–353 (1999)

  16. Grimmett, G.: Percolation, 2nd edn, Grundlehren der mathematischen Wissenschaften, Springer, Berlin (1999). Originally published by Springer, New York (1989)

  17. Hartarsky, I.: U-bootstrap percolation: critical probability, exponential decay and applications. Ann. Inst. Henri Poincaré Probab. Stat. 57(3), 1255–1280 (2021)

    MathSciNet  Article  Google Scholar 

  18. Hartarsky, I., Szabó, R.: Subcritical bootstrap percolation via Toom contours arXiv e-prints (2022), available at arxiv:2203.16366

  19. Hartarsky, I., Szabó, R.: Generalised oriented site percolation. Markov Process. Relat. Fields (To appear)

  20. Lebowitz, J.L., Maes, C., Speer, E.R.: Statistical mechanics of probabilistic cellular automata. J. Stat. Phys. 59(1–2), 117–170 (1990)

    ADS  MathSciNet  Article  Google Scholar 

  21. Liggett, T.M., Schonmann, R.H., Stacey, A.M.: Domination by product measures. Ann. Probab. 25(1), 71–95 (1997)

    MathSciNet  MATH  Google Scholar 

  22. Louis, P.-Y.: Ergodicity of PCA: equivalence between spatial and temporal mixing conditions. Electron. Commun. Probab. 9, 119–131 (2004)

    MathSciNet  Article  Google Scholar 

  23. Louis, P.-Y., Nardi, F.R. (eds.): Probabilistic Cellular Automata, Emergence, Complexity, Computation, vol. 27. Springer, Cham (2018)

    Google Scholar 

  24. Marcovici, I., Sablik, M., Taati, S.: Ergodicity of some classes of cellular automata subject to noise. Electron. J. Probab. 24, 1–44 (2019)

    MathSciNet  Article  Google Scholar 

  25. Menshikov, M.V.: Coincidence of critical points in percolation problems. Dokl. Akad. Nauk SSSR 288(6), 1308–1311 (1986)

    MathSciNet  Google Scholar 

  26. O’Donnell, R., Saks, M., Schramm, O., Servedio, R.A.: Every decision tree has an influential variable. In: 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 31–39 (2005)

  27. Salo, V., Theyssier, G., Törmä, I.: Bootstrap Percolation and cellular automata, arXiv e-prints (2021), available at arXiv:2110.00656

  28. Schonmann, R.H.: On the behavior of some cellular automata related to bootstrap percolation. Ann. Probab. 20(1), 174–193 (1992)

    MathSciNet  Article  Google Scholar 

  29. Swart, J.M.: A simple proof of exponential decay of subcritical contact processes. Probab. Theory Relat. Fields 170(1–2), 1–9 (2018)

    MathSciNet  Article  Google Scholar 

  30. Swart, J.M., Szabó, R., Toninelli, C.: Peierls bounds from Toom contours, arXiv e-prints (2022), available at arXiv:2202.10999

  31. Taati, S.: Reversible cellular automata in presence of noise rapidly forget everything. In: 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2021), vol. 3, pp. 1–3 (2021)

  32. Toom, A.: Cellular automata with errors: problems for students of probability. In: Topics in Contemporary Probability and its Applications, pp. 117–157 (1995)

  33. Toom, A.L.: Stable and attractive trajectories in multicomponent systems. Multicomponent Random Syst. 6, 549–575 (1980)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We thank Irène Marcovici, Jan Swart, Réka Szabó, Siamak Taati and Cristina Toninelli for enlightening discussions. We also thank Réka for bringing important references to our attention. We thank the annonymous referees for helpful remarks on the presentation.

Funding

This work is supported by European Research Council Starting Grant 680275 “MALIG.”

Author information

Authors and Affiliations

  1. CEREMADE, CNRS, Université Paris-Dauphine, PSL University, 75016, Paris, France

    Ivailo Hartarsky

Authors
  1. Ivailo Hartarsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivailo Hartarsky.

Ethics declarations

Conflict of interest

The author declares that he has no conflict of interest.

Additional information

Communicated by Giulio Biroli.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Hartarsky, I. Bootstrap Percolation, Probabilistic Cellular Automata and Sharpness. J Stat Phys 187, 21 (2022). https://doi.org/10.1007/s10955-022-02922-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10955-022-02922-6

Keywords

  • Probabilistic cellular automata
  • Bootstrap percolation
  • Kinetically constrained models
  • Sharp phase transition
  • Stability

Mathematics Subject Classification

  • Primary 60K35
  • Secondary 37B15
  • 60C05
  • 82B43
  • 82C20