Skip to main content

System Reduction: An Approach Based on Probabilistic Cellular Automata

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2022)

Abstract

The problem of cellular automata coarse-graining is considered. The case of 1D boolean cellular automata (CA) is investigated. Probabilistic rules for 1D CA are parameterized. Then the coarse-graining procedure and the reduced probabilistic CA are defined in the general case. The reduction procedure is illustrated on the example of the Wolfram CA deterministic rule 30. It is then analyzed on the example of a 1D ring probabilistic voter model. The coarse-grained transition rule is improved by making use of the network adjacency matrix. Results obtained for the original and the coarse-grained models are compared, both in the uncontrolled and controlled cases.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601 (1983)

    Article  MathSciNet  Google Scholar 

  2. Antoulas, A.C.: Approximation of Large-Scale Dynamical Systems. SIAM, Philadelphia (2005)

    Book  Google Scholar 

  3. Drasdo, D.: Coarse graining in simulated cell populations. Adv. Complex Syst. 8(02–03), 319–363 (2005)

    Google Scholar 

  4. Israeli, N., Goldenfeld, N.: Coarse-graining of cellular automata, emergence, and the predictability of complex systems. Phys. Rev. E 73(2), 026203 (2006)

    Article  MathSciNet  Google Scholar 

  5. Costa, P., De Melo, F.: Coarse graining of partitioned cellular automata. arXiv preprint arXiv:1905.10391 (2019)

  6. Toupance, P.A., Lefèvre, L., Chopard, B.: Influence measurement in a complex dynamical model: an information theoretic approach. J. Comput. Sci. 44, 101115 (2020)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pierre-Alain Toupance .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Toupance, PA., Chopard, B., Lefèvre, L. (2022). System Reduction: An Approach Based on Probabilistic Cellular Automata. In: Chopard, B., Bandini, S., Dennunzio, A., Arabi Haddad, M. (eds) Cellular Automata. ACRI 2022. Lecture Notes in Computer Science, vol 13402. Springer, Cham. https://doi.org/10.1007/978-3-031-14926-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-14926-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-14925-2

  • Online ISBN: 978-3-031-14926-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics