On a class of probabilistic cellular automata with size-33 neighbourhood and their applications in percolation games

preprint2022arXivOpen access

Abstract

Different versions of percolation games on Z2\mathbb{Z}^{2}, with parameters pp and qq that indicate, respectively, the probability with which a site in Z2\mathbb{Z}^{2} is labeled a trap and the probability with which it is labeled a target, are shown to have probability 00 of culminating in draws when p+q>0p+q > 0. We show that, for fixed pp and qq, the probability of draw in each of these games is 00 if and only if a certain 11-dimensional probabilistic cellular automaton (PCA) Fp,qF_{p,q} with a size-33 neighbourhood is ergodic. This allows us to conclude that Fp,qF_{p,q} is ergodic whenever p+q>0p+q > 0, thereby rigorously establishing ergodicity for a considerable class of PCAs.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.