Ergodicity of some classes of cellular automata subject to noise

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...

Full description

Saved in:
Bibliographic Details
Published inElectronic journal of probability Vol. 24; no. none
Main Authors Marcovici, Irène, Sablik, Mathieu, Taati, Siamak
Format Journal Article
LanguageEnglish
Published Institute of Mathematical Statistics (IMS) 01.01.2019
Subjects
Combinatorics
Computer Science
Dynamical Systems
Mathematics
Multiagent Systems
Probability
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1083-6489
1083-6489
DOI:10.1214/19-EJP297