Probabilistic cellular automata with memory two: invariant laws and multidirectional reversibility
From MaRDI portal
Publication:2202467
DOI10.5802/ahl.39zbMath1464.37020arXiv1710.05490OpenAlexW3041394884MaRDI QIDQ2202467
Publication date: 18 September 2020
Published in: Annales Henri Lebesgue (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.05490
Random fields (60G60) Stationary stochastic processes (60G10) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Dynamical aspects of cellular automata (37B15) Dynamical aspects of statistical mechanics (37A60)
Related Items (2)
Ergodicity of some probabilistic cellular automata with binary alphabet via random walks ⋮ On a class of PCA with size-3 neighborhood and their applications in percolation games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic six-vertex model
- Around probabilistic cellular automata
- Markovianity of the invariant distribution of probabilistic cellular automata on the line
- The free-fermionic \(C_2^{(1)}\) loop model, double dimers and Kashaev's recurrence
- On the number of nilpotent matrices with coefficients in a finite field
- Directed animals and gas models revisited
- New enumerative results on two-dimensional directed animals
- Edge correlation function of the 8-vertex model when \(a + c = b + d\)
- The Bethe ansatz for the six-vertex and XXZ models: an exposition
- Invariant measures and convergence properties for cellular automaton 184 and related processes
- From PCA's to equilibrium systems and back
- Statistical mechanics of probabilistic cellular automata.
- Percolation games, probabilistic cellular automata, and the hard-core model
- Probabilistic cellular automata and random fields with i.i.d. directions
- Ergodicity of Noisy Cellular Automata: The Coupling Method and Beyond
- Pairs of Matrices With Property L. II
- A note on commuting pairs of matrices
- Discrete Time q-TASEPs
- Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
- Probabilistic cellular automata with general alphabets possessing a Markov chain as an invariant distribution
- Probability
- The ergodic theory of traffic jams.
This page was built for publication: Probabilistic cellular automata with memory two: invariant laws and multidirectional reversibility