Skip to main content
Log in

System reduction: an approach based on probabilistic cellular automata

  • Published:
Natural Computing Aims and scope Submit manuscript

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 less computational burden to control. In other words, the question is whether one can act on the simplified system to control its evolution towards a given target, so that the same strategy also applies to the full system. We analyze this problem in three stages. First we consider the general case of coarse-graining 1D cellular automata. We show that the procedure is expected to produce extra stochasticity in the system, while still retaining some characteristics of the original system. In a second step, we study a 1D voter model for which the coarse-graining procedure requires component weighting, with weights based on causal paths. Finally, in a third part, we consider the same voter model on a scale-free graph, and perform a reduction according to a partition of the graph in communities. The equivalence between the reduced and full systems, whether controlled or not, is investigated through a delayed mutual information analysis, a concept from information theory.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability

Source codes and numerical simulation results are available on request from the corresponding author

References

  • Antoulas A (2004) Approximation of large-scale dynamical systems: an overview. IFAC Proc 37(11):19–28

    Google Scholar 

  • Bollobás B, Riordan O (2004) The diameter of a scale-free random graph. Combinatorica 24(1):5–34

    Article  MathSciNet  Google Scholar 

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

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Kanawati R (2014) Seed-centric approaches for community detection in complex networks. In: International conference on social computing and social media, 197–208. Springer

  • Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582

    Article  Google Scholar 

  • Papadopoulos S, Kompatsiaris Y, Vakali A, Spyridonos P (2012) Community detection in social media. Data Min Knowl Discov 24(3):515–554

    Article  Google Scholar 

  • Schreiber T (2000) Measuring information transfer. Phys Rev Lett 85(2):461

    Article  Google Scholar 

  • Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27(3):379–423

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Toupance P-A, Chopard B, Lefèvre L (2020) Identification of complex network topologies through delayed mutual information. In: 21st IFAC World Congress, Accepted; arXiv:2003.08792 Berlin, Germany

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

    Article  MathSciNet  Google Scholar 

Download references

Funding

Not applicable

Author information

Authors and Affiliations

Authors

Contributions

All authors contributed equally to this work and reviewed the manuscript.

Corresponding author

Correspondence to Laurent Lefèvre.

Ethics declarations

Conflict of interest

There is no competing interests of any financial or personal nature

Ethics approval

Not applicable

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Toupance, PA., Chopard, B. & Lefèvre, L. System reduction: an approach based on probabilistic cellular automata. Nat Comput 23, 17–29 (2024). https://doi.org/10.1007/s11047-023-09959-w

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-023-09959-w

Keywords

Navigation