Percolation games, probabilistic cellular automata, and the hard-core model
Alexander E. Holroyd, Ir\`ene Marcovici, James B. Martin

TL;DR
This paper proves ergodicity of certain probabilistic cellular automata related to a two-player lattice game, showing no draws occur in the 2D case, but draws can occur in higher dimensions under specific conditions.
Contribution
It establishes ergodicity of PCA linked to the game on 2^2, proving no draws, and demonstrates the existence of draws in higher dimensions via a reduction to the hard-core model.
Findings
PCA are ergodic on 2^2, implying no draws in 2D.
Draws occur in higher dimensions when the hard-core model has multiple Gibbs states.
Dimension reduction links game behavior to phase transitions in lattice gases.
Abstract
Let each site of the square lattice be independently assigned one of three states: a \textit{trap} with probability , a \textit{target} with probability , and \textit{open} with probability , where . Consider the following game: a token starts at the origin, and two players take turns to move, where a move consists of moving the token from its current site to either or . A player who moves the token to a trap loses the game immediately, while a player who moves the token to a target wins the game immediately. Is there positive probability that the game is \emph{drawn} with best play -- i.e.\ that neither player can force a win? This is equivalent to the question of ergodicity of a certain family of elementary one-dimensional probabilistic cellular automata (PCA). These automata have been studied in the contexts of enumeration…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
