Abstract
Different versions of percolation games on , with parameters and that indicate, respectively, the probability with which a site in is labeled a trap and the probability with which it is labeled a target, are shown to have probability of culminating in draws when . We show that, for fixed and , the probability of draw in each of these games is if and only if a certain -dimensional probabilistic cellular automaton (PCA) with a size- neighbourhood is ergodic. This allows us to conclude that is ergodic whenever , thereby rigorously establishing ergodicity for a considerable class of PCAs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.