Coupling from the past for exponentially ergodic one-dimensional probabilistic cellular automata
From MaRDI portal
Publication:6136791
DOI10.1214/23-ejp1013arXiv2106.07219OpenAlexW3168122970MaRDI QIDQ6136791
Publication date: 17 January 2024
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.07219
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
- The contact process on a finite set. III: The critical case
- Finitary codings for spatial mixing Markov random fields
- For 2-D lattice spin systems weak mixing implies strong mixing
- On the existence and nonexistence of finitary codings for a class of random fields
- The box-crossing property for critical two-dimensional oriented percolation
- Finitary coding for the sub-critical Ising model with finite expected coding volume
- Ergodicity of some classes of cellular automata subject to noise
- Ergodicity of probabilistic cellular automata: A constructive criterion
- Approximation algorithms for classification problems with pairwise relationships
- Overview: PCA Models and Issues
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing
- Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
This page was built for publication: Coupling from the past for exponentially ergodic one-dimensional probabilistic cellular automata