On a class of PCA with size-3 neighborhood and their applications in percolation games
DOI10.1214/23-ejp1046MaRDI QIDQ6177573
Moumanti Podder, Sayar Karmakar, Dhruv Bhasin, Souvik Roy
Publication date: 17 January 2024
Published in: Electronic Journal of Probability (Search for Journal in Brave)
weight functionergodicitypotential functionprobabilistic cellular automatatwo-player combinatorial gamespercolation games on latticesprobability of draw
2-person games (91A05) Games involving graphs (91A43) Ergodicity, mixing, rates of mixing (37A25) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Probing robustness of cellular automata through variations of asynchronous updating
- Fault tolerance in cellular automata at low fault rates
- Around probabilistic cellular automata
- Trapping games on random boards
- Fault tolerance in cellular automata at high fault rates
- A note on the enumeration of directed animals via gas considerations
- Directed animals and gas models revisited
- Computation and construction universality of reversible cellular automata
- From equilibrium spin models to probabilistic cellular automata
- New enumerative results on two-dimensional directed animals
- Theory of cellular automata: a survey
- Cellular automata and statistical mechanical models
- Statistical mechanics of probabilistic cellular automata.
- Bootstrap percolation, probabilistic cellular automata and sharpness
- Probabilistic cellular automata with memory two: invariant laws and multidirectional reversibility
- Percolation games, probabilistic cellular automata, and the hard-core model
- Probabilistic cellular automata. Theory, applications and future perspectives
- Ergodicity of some classes of cellular automata subject to noise
- Large deviations for mean field models of probabilistic cellular automata
- Directed Percolation Arising in Stochastic Cellular Automata Analysis
- HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA
- Pure Nash Equilibria and Best-Response Dynamics in Random Games
- Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
- Endomorphisms and automorphisms of the shift dynamical system
- Reliable cellular automata with self-organization
This page was built for publication: On a class of PCA with size-3 neighborhood and their applications in percolation games