Ergodicity of some probabilistic cellular automata with binary alphabet via random walks

DOI10.1214/23-EJP971arXiv2212.02176MaRDI QIDQ6165986FDOQ6165986

Authors: Jérôme Casse 

Publication date: 2 August 2023

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: Ergodicity of probabilistic cellular automata is a very important issue in the PCA theory. In particular, the question about the ergodicity of all PCA with two-size neighbourhood, two letters alphabet and positive rates is still open. In this article, we do not try to improve this issue, but we show a new kind of proof (to the best knowledge of the author) about the ergodicity of some of those PCA, including also some CA with errors. The proof is based on the study of the boundaries of islands where the PCA is totally decorrelated from its initial condition. The behaviours of these boundaries are the ones of random walks.

Full work available at URL: https://arxiv.org/abs/2212.02176

zbMATH Keywords

ergodicitycellular automatarandom walksenvelope PCA

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Discrete-time Markov processes on general state spaces (60J05) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Dynamical aspects of cellular automata (37B15)

Cites Work

• Theory of cellular automata: a survey
• Title not available (Why is that?)
• Cellular Automata Modeling of Physical Systems
• Cellular automata and groups
• Stationary measures and phase transition for a class of Probabilistic Cellular Automata
• Title not available (Why is that?)
• Reliable cellular automata with self-organization
• New enumerative results on two-dimensional directed animals
• Directed animals and gas models revisited
• Probabilistic cellular automata and random fields with i.i.d. directions
• Title not available (Why is that?)
• Around probabilistic cellular automata
• Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
• Markovianity of the invariant distribution of probabilistic cellular automata on the line
• Ergodicity of some classes of cellular automata subject to noise
• 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\)
• Percolation games, probabilistic cellular automata, and the hard-core model
• Probabilistic cellular automata with memory two: invariant laws and multidirectional reversibility
• Probabilistic cellular automata with general alphabets possessing a Markov chain as an invariant distribution

Cited In (1)

• Ergodicity of some classes of cellular automata subject to noise

This page was built for publication: Ergodicity of some probabilistic cellular automata with binary alphabet via random walks

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