Probabilistic cellular automata with general alphabets possessing a Markov chain as an invariant distribution

DOI10.1017/APR.2016.5zbMATH Open1366.37024arXiv1410.3159OpenAlexW2417442186MaRDI QIDQ5740693FDOQ5740693

Jérôme Casse

Publication date: 27 July 2016

Published in: Advances in Applied Probability (Search for Journal in Brave)

Abstract: This paper is devoted to probabilistic cellular automata (PCA) on $mathbbN$, $mathbbZ$ or $mathbbZ/nmathbbZ$, depending of two neighbors, with a general alphabet $E$ (finite or infinite, discrete or not). We study the following question: under which conditions does a PCA possess a Markov chain as invariant distribution? Previous results in the literature give some conditions on the transition matrix (for positive rate PCA) when the alphabet $E$ is finite. Here we obtain conditions on the transition kernel of PCA with a general alphabet $E$. In particular, we show that the existence of an invariant Markov chain is equivalent to the existence of a solution to a cubic integral equation. One of the difficulties to pass from a finite alphabet to a general alphabet comes from some problems of measurability, and a large part of this work is devoted to clarify these issues.

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

Recommendations

• Markovianity of the invariant distribution of probabilistic cellular automata on the line
• Probabilistic cellular automata, invariant measures, and perfect sampling
• Probabilistic cellular automata and random fields with i.i.d. directions
• Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
• A non-ergodic probabilistic cellular automaton with a unique invariant measure

zbMATH Keywords

Markov chaininvariant measureprobabilistic cellular automata

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Stationary stochastic processes (60G10) Discrete-time Markov processes on general state spaces (60J05) Dynamical aspects of cellular automata (37B15)

Cited In (3)

• Overview: PCA Models and Issues
• Probabilistic cellular automata with memory two: invariant laws and multidirectional reversibility
• Ergodicity of some probabilistic cellular automata with binary alphabet via random walks

This page was built for publication: Probabilistic cellular automata with general alphabets possessing a Markov chain as an invariant distribution

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