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

DOI10.1017/APR.2016.5zbMath1366.37024arXiv1410.3159OpenAlexW2417442186MaRDI QIDQ5740693

Jérôme Casse

Publication date: 27 July 2016

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

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

zbMATH Keywords

invariant measureMarkov chainprobabilistic cellular automata

Mathematics Subject Classification ID

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

Related Items (3)

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

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