Ergodicity of probabilistic cellular automata: A constructive criterion

DOI10.1007/BF02098042zbMath0717.68073OpenAlexW1965092415MaRDI QIDQ2638803

Senya B. Shlosman, Christian Maes

Publication date: 1991

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02098042

zbMATH Keywords

probabilistic cellular automata

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Formal languages and automata (68Q45)

Related Items

Ergodicity of some classes of cellular automata subject to noise ⋮ Overview: PCA Models and Issues ⋮ Kalikow-type decomposition for multicolor infinite range particle systems ⋮ Macrodynamics: Large-scale structures in turbulent media ⋮ Partially ordered models ⋮ Coupling from the past for exponentially ergodic one-dimensional probabilistic cellular automata ⋮ The logarithmic Sobolev inequality for discrete spin systems on a lattice ⋮ The Gacs-Kurdyumov-Levin automaton revisited ⋮ When is an interacting particle system ergodic? ⋮ Invariant measures and decay of correlations for a class of ergodic probabilistic cellular automata ⋮ Finite-volume fractional-moment criteria for Anderson localization ⋮ Robustness of Markov processes on large networks ⋮ Phase transitions in random mixtures of elementary cellular automata ⋮ Ergodicity of quantum cellular automata. ⋮ Phase diagrams of majority voter probabilistic cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniform and \(L^ 2\) convergence in one dimensional stochastic Ising models
• Gibbs measures and phase transitions
• Stochastic processes. A survey of the mathematical theory
• Completely analytical interactions: Constructive description
• From PCA's to equilibrium systems and back
• Statistical mechanics of probabilistic cellular automata.