Ergodicity of some classes of cellular automata subject to noise

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Discrete-time Markov processes on general state spaces (60J05) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Dynamical aspects of cellular automata (37B15)

Abstract: Cellular automata (CA) are dynamical systems on symbolic configurations on the lattice. They are also used as models of massively parallel computers. As dynamical systems, one would like to understand the effect of small random perturbations on the dynamics of CA. As models of computation, they can be used to study the reliability of computation against noise. We consider various families of CA (nilpotent, permutive, gliders, CA with a spreading symbol, surjective, algebraic) and prove that they are highly unstable against noise, meaning that they forget their initial conditions under slightest positive noise. This is manifested as the ergodicity of the resulting probabilistic CA. The proofs involve a collection of different techniques (couplings, entropy, Fourier analysis), depending on the dynamical properties of the underlying deterministic CA and the type of noise.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Ergodicity of some classes of cellular automata subject to noise

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631867)