Article

System Reduction: An Approach Based on Probabilistic Cellular Automata

Authors:

Cellular Automata: 15th International Conference on Cellular Automata for Research and Industry, ACRI 2022, Geneva, Switzerland, September 12–15, 2022, Proceedings

Pages 94 - 105

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

Published: 12 September 2022 Publication History

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.

References

[1]

Wolfram S Statistical mechanics of cellular automata Rev. Mod. Phys. 1983 55 3 601

Crossref

Google Scholar

[2]

Antoulas AC Approximation of Large-Scale Dynamical Systems 2005 Philadelphia SIAM

Crossref

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 and Goldenfeld N Coarse-graining of cellular automata, emergence, and the predictability of complex systems Phys. Rev. E 2006 73 2 026203

Crossref

Google Scholar

[5]

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

Google Scholar

[6]

Toupance PA, Lefèvre L, and Chopard B Influence measurement in a complex dynamical model: an information theoretic approach J. Comput. Sci. 2020 44 101115

Crossref

Google Scholar

Index Terms

System Reduction: An Approach Based on Probabilistic Cellular Automata

Index terms have been assigned to the content through auto-classification.

Recommendations

System reduction: an approach based on probabilistic cellular automata
Abstract
The goal of this paper it to explore the possibility to simplify a stochastic complex dynamical system by reducing the number of its degrees of freedom, through a coarse graining procedure. Our objective is to create reduced systems which requires ...
Sand automata as cellular automata

In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata are ...
Descriptional complexity of cellular automata and decidability questions
Third international workshop on descriptional complexity of automata, grammars and related structures

We study the descriptional complexity of cellular automata (CA) which are a parallel model of computation. We show that between one of the simplest cellular models, the realtime one-way CA (realtime-OCA), and "classical" models like deterministic finite ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Cellular Automata: 15th International Conference on Cellular Automata for Research and Industry, ACRI 2022, Geneva, Switzerland, September 12–15, 2022, Proceedings

Sep 2022

372 pages

ISBN:978-3-031-14925-2

DOI:10.1007/978-3-031-14926-9

Editors:
Bastien Chopard
University of Geneva, Geneva, Switzerland
,
Stefania Bandini
University of Milano-Bicocca, Milan, Italy
,
Alberto Dennunzio
University of Milano-Bicocca, Milan, Italy
,
Mira Arabi Haddad
University of Geneva, Geneva, Switzerland

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 12 September 2022

Author Tags

Qualifiers

Article

Index Terms

Recommendations