Skip to main content
SpringerLink
Log in

Self-organisation in Cellular Automata with Coalescent Particles: Qualitative and Quantitative Approaches

  • Published:
Journal of Statistical Physics Aims and scope Submit manuscript

Abstract

This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial configuration at random according to some initial shift-ergodic measure, and use the limit measure to describe the asymptotic behaviour of the automata. We first take a qualitative approach, i.e. we obtain information on the limit measure(s). We prove that only particles moving in one particular direction can persist asymptotically. This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata [introduced by Fisch (J Theor Probab 3(2):311–338, 1990; Phys D 45(1–3):19–25, 1990)], one-sided captive cellular automata [introduced by Theyssier (Captive Cellular Automata, 2004)], the majority-traffic cellular automaton, a self stabilisation process towards a discrete line [introduced by Regnault and Rémila (in: Mathematical Foundations of Computer Science 2015—40th International Symposium, MFCS 2015, Milan, Italy, Proceedings, Part I, 2015)]. In a second time we restrict our study to a subclass, the gliders cellular automata. For this class we show quantitative results, consisting in the asymptotic law of some parameters: the entry times [generalising K ůrka et al. (in: Proceedings of AUTOMATA, 2011)], the density of particles and the rate of convergence to the limit measure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Belitsky, V., Ferrari, P.A.: Ballistic annihilation and deterministic surface growth. J. Stat. Phys. 80, 517–543 (1995)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  2. Belitsky, V., Ferrari, P.A.: Invariant measures and convergence properties for cellular automaton 184 and related processes. J. Stat. Phys. 118(3–4), 589–623 (2005)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  3. Boccara, N., Nasser, J., Roger, M.: Particle-like structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rules. Phys. Rev. A 44(2), 866–875 (1991)

    Article  ADS  Google Scholar 

  4. Bušić, A., Fatès, N., Mairesse, J., Marcovici, I.: Density classification on infinite lattices and trees. Electron. J. Probab. 18, 22 (2013)

    MathSciNet  MATH  Google Scholar 

  5. de Menibus, B.H.: Asymptotic behaviour of cellular automata: computation and randomness. Thèse présentée pour obtenir le grade universitaire de docteur (2014)

  6. de Menibus, B.H., Sablik, M.: Developments in Language Theory. Self-organization in cellular automata: a particle-based approach, pp. 251–263. University of Milano-Bicocca, Milan (2011)

    Book  MATH  Google Scholar 

  7. de Menibus, B.H., Sablik, M.: Entry times in automata with simple defect dynamics. In: Formenti E. (ed.) Proceedings 18th International Workshop on Cellular Automata and Discrete Complex Systems and 3rd International Symposium Journées Automates Cellulaires. Electronic Proceedings in Theoretical Computer Science, vol. 90, pp. 97–109. Open Publishing Association (2012)

  8. de Menibus, B.H., Sablik, M.: Characterisation of sets of limit measures after iteration of a cellular automaton on an initial measure. arXiv:1301.1998, accepted to Ergodic Theory and Dynamical Systems (2013)

  9. Delacourt, M.: Rice’s theorem for \(\mu \)-limit sets of cellular automata. In: Aceto L., Henzinger M., Sgall J. (eds.) Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, Proceedings, Part II, pp. 89–100. Springer, Berlin, 4–8 July 2011

  10. Eloranta, K.: The dynamics of defect ensembles in one-dimensional cellular automata. J. Stat. Phys. 76, 1377–1398 (1994). doi:10.1007/BF02187067

    Article  ADS  MathSciNet  MATH  Google Scholar 

  11. Eloranta, K., Nummelin, E.: The kink of cellular automaton rule 18 performs a random walk. J. Stat. Phys. 69(5–6), 1131–1136 (1992)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  12. Fatès, N.: Stochastic cellular automata solutions to the density classification problem. Theory Comput. Syst. 53(2), 223–242 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fisch, R.: The one-dimensional cyclic cellular automaton: a system with deterministic dynamics that emulates an interacting particle system with stochastic dynamics. J. Theor. Probab. 3(2), 311–338 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  14. Fisch, R.: Cyclic cellular automata and related processes. Phys. D 45(1–3), 19–25 (1990)

    Article  MATH  Google Scholar 

  15. Grassberger, P.: New mechanism for deterministic diffusion. Phys. Rev. A 28, 3666–3667 (1983)

    Article  ADS  Google Scholar 

  16. Grassberger, P.: Chaos and diffusion in deterministic cellular automata. Phys. D 10(1–2), 52–58 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gray, L., Griffeath, D.: The ergodic theory of traffic jams. J. Stat. Phys. 105(3–4), 413–452 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kůrka, P.: Cellular automata with vanishing particles. Fundam. Inf. 58(2003), 203–221 (2003)

    MathSciNet  Google Scholar 

  19. Kůrka, P., Maass, A.: Limit sets of cellular automata associated to probability measures. J. Stat. Phys. 100(5–6), 1031–1047 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  20. Kůrka, P., Formenti, E., Dennunzio, A.: Asymptotic distribution of entry times in a cellular automaton with annihilating particles. In: Proceedings of AUTOMATA, pp. 89–100 (2011)

  21. Lind, D.A.: Applications of ergodic theory and sofic systems to cellular automata. Phys. D 10(1–2), 36–44 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  22. Merlévède, F., Rio, E.: Strong approximations of partial sums under dependence conditions with applications to dynamical systems. Stoch. Process. Appl. 122, 386–417 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  23. Mörters, P., Peres, Y.: Brownian Motion. Cambridge series in statistical and probabilistic mathematics. Cambridge University Press, Cambridge (2010)

    Book  MATH  Google Scholar 

  24. Pivato, M.: Algebraic invariants for crystallographic defects in cellular automata. Ergodic Theory Dyn. Syst. 27(01), 199–240 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  25. Pivato, M.: Defect particle kinematics in one-dimensional cellular automata. Theor. Comput. Sci. 377(1–3), 205–228 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  26. Pivato, M.: Spectral domain boundaries in cellular automata. Fundam. Inf. 78(3), 417–447 (2007)

    MathSciNet  MATH  Google Scholar 

  27. Redner, S.: A Guide to First-Passage Processes. Cambridge University Press, New York (2001)

    Book  MATH  Google Scholar 

  28. Regnault, D., Rémila, E.: Lost in self-stabilization. In: Mathematical Foundations of Computer Science 2015—40th International Symposium, MFCS 2015, Milan, Italy, Proceedings, Part I, pp. 432–443, 24–28 August 2015

  29. Stein W.A., et al.: Sage Mathematics Software (Version 4.2.1). The Sage Development Team (2012) http://www.sagemath.org

  30. Theyssier, G.: Captive Cellular Automata. MFCS 2004, LNCS, vol. 3153, pp. 427–438 (2004)

  31. von Neumann, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. Autom. Stud. 34, 43–98 (1956)

    MathSciNet  Google Scholar 

  32. Walters, P.: Graduate Texts in Mathematics. An introduction to ergodic theory, vol. 79. Springer, New York (1982)

    Google Scholar 

  33. Wolfram, S.: Universality and complexity in cellular automata. Phys. D 10(1), 1–35 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  34. Zhengyan, L., Chuanrong, L.: Limit Theory for Mixing Dependent Random Variables, vol. 378. Springer, Berlin (1996)

    MATH  Google Scholar 

Download references

Acknowledgements

This work was partially supported by the ANR Project QuasiCool (ANR-12-JS02-011-01). B. H. de Menibus acknowledges the financial support of Basal Project No. PFB-03 CMM, Universidad de Chile. We also thank two anonymous referees for their careful reading and many remarks.

Author information

Authors and Affiliations

  1. Departamento de Matematicas, Universidad Andrés Bello and Centro de Modelamiento Matematico, Universidad de Chile, Santiago, Chile

    Benjamin Hellouin de Menibus

  2. Institut de Mathématiques de Toulouse, UMR5219, Université de Toulouse, CNRS UPS IMT, 31062, Toulouse Cedex 9, France

    Mathieu Sablik

Authors
  1. Benjamin Hellouin de Menibus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mathieu Sablik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mathieu Sablik.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hellouin de Menibus, B., Sablik, M. Self-organisation in Cellular Automata with Coalescent Particles: Qualitative and Quantitative Approaches. J Stat Phys 167, 1180–1220 (2017). https://doi.org/10.1007/s10955-017-1760-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10955-017-1760-8

Keywords

Search

Navigation