Damage spreading and Lyapunov exponents in cellular automata
F. Bagnoli, R. Rechtman, S. Ruffo
Abstract
Using the concept of the Boolean derivative we study damage spreading for one dimensional elementary cellular automata and define their maximal Lyapunov exponent. A random matrix approximation describes quite well the behavior of ``chaotic'' rules and predicts a directed percolation-type phase transition. After the introduction of a small noise elementary cellular automata reveal the same type of transition.
Create a lesson
Related papers
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat
IceCube data for astrophysical neutrinos exhibit q-statistical behavior
Constantino Tsallis, Ugur Tirnakli
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov
Replica Transition at Measurement-Altered Ising Criticality
Kabir Khanna, Sara Murciano, Romain Vasseur
Scalene Yang-Baxter triples realize all nearest-neighbour Hamiltonians with global additive symmetries
Pramod Padmanabhan, Somnath Maity, Akash Sinha et al.
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Julian Voits