Ergodicity of some probabilistic cellular automata with binary alphabet via random walks
From MaRDI portal
Publication:6165986
DOI10.1214/23-ejp971arXiv2212.02176MaRDI QIDQ6165986
Publication date: 2 August 2023
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.02176
Discrete-time Markov processes on general state spaces (60J05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Dynamical aspects of cellular automata (37B15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Around probabilistic cellular automata
- Markovianity of the invariant distribution of probabilistic cellular automata on the line
- Directed animals and gas models revisited
- New enumerative results on two-dimensional directed animals
- Application of entropy analysis to discrete-time interacting particle systems on the one-dimensional lattice
- Edge correlation function of the 8-vertex model when \(a + c = b + d\)
- Theory of cellular automata: a survey
- Probabilistic cellular automata with memory two: invariant laws and multidirectional reversibility
- Percolation games, probabilistic cellular automata, and the hard-core model
- Probabilistic cellular automata and random fields with i.i.d. directions
- Ergodicity of some classes of cellular automata subject to noise
- Stationary measures and phase transition for a class of Probabilistic Cellular Automata
- Cellular Automata and Groups
- Cellular Automata Modeling of Physical Systems
- Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
- Probabilistic cellular automata with general alphabets possessing a Markov chain as an invariant distribution
- Reliable cellular automata with self-organization
This page was built for publication: Ergodicity of some probabilistic cellular automata with binary alphabet via random walks
