PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 8, 2026Advances in Applied Probability0 citationsOpen Access

Generalized percolation games on the two-dimensional square lattice and ergodicity of associated probabilistic cellular automata

DBDhruv BhasinSKSayar KarmakarMPMoumanti Podder

Key Points

  • The study aims to determine conditions under which a percolation game results in a draw-free outcome, focusing on vertex and edge labeling probabilities.
  • Analyzed a percolation game played on an infinite two-dimensional square lattice graph.
  • Assigned independent labels (trap, target, open) to vertices and edges based on probabilities p, q, and r.
  • Investigated the relationship between draw outcomes and the ergodicity of a probabilistic cellular automaton (PCA).
  • Explored special cases with different probability distributions for edge labels while keeping vertices unlabeled.
  • Identified specific regimes of parameters p, q, and r where the probability of a draw equals 0.
  • Established that the probability of a draw equals 0 if and only if the PCA is ergodic.
  • Showed that the conditions for ergodicity correspond to a phase transition at the origin of parameter space.

Abstract

Abstract We consider a highly generalized set-up in which each vertex of the infinite two-dimensional square lattice graph (whose set of vertices is Z^2, with each vertex (x, y) adjacent to each of (x+1, y) and (x, y+1) ) is assigned, independent of all else, a label that reads trap with probability p, target with probability q, and open with the remaining probability (1-p-q), and, in addition, each edge is assigned, independent of all else, a label that reads trap with probability r and open with probability (1-r). This model encompasses the seemingly more general model where, in addition to all the vertex-labels and edge-labels described above, an edge can also be labeled as a target, since assigning the label of target to an edge going from (x, y) to either (x+1, y) or (x, y+1) is equivalent to marking the vertex (x, y) as a trap. A percolation game is played on this random board, involving two players and a token. The players take turns to make moves, where a move involves relocating the token from where it is currently located, say some vertex (x, y) Z^2, to any one of (x+1, y) and (x, y+1). A player wins if she is able to move the token to a vertex labeled as a target, or force her opponent to either move the token to a vertex labeled as a trap or along an edge labeled as a trap. We seek to find a regime, in terms of values of the parameters p, q, and r, in which the probability of this game resulting in a draw equals 0. We further consider special cases of this game, such as when each edge is assigned, independently, a label that reads trap with probability r, target with probability s, and open with probability (1-r-s), but the vertices are left unlabeled, and various regimes of values of r and s are explored in which the probability of draw is guaranteed to be 0. We show that the probability of draw in each such game equals 0 if and only if a suitably defined probabilistic cellular automaton (PCA) is ergodic, following which we implement the technique of weight functions or potential functions to investigate the regimes in which said PCA is ergodic. We mention here that one of the main results of Holroyd et al. (2019 Probab. Theory Related Fields 174, 1187–1217) follows as a special case of our main result. Moreover, our result shows that a phase transition happens at the origin (i. e. at (p, q, r) = (0, 0, 0) in the case of

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Bhasin et al. (2026) studied this question.

synapsesocial.com/papers/698828210fc35cd7a8847507https://doi.org/10.1017/apr.2025.10052
Ask AI
Helpful
Bookmark
Share
View Full Paper