Probabilistic Cellular Automata

Abstract

Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involved to some degree in the transition rule, we speak of probabilistic automata, otherwise they are called deterministic. With either type of cellular automaton we are dealing with, the main theoretical challenge stays the same: starting from an arbitrary initial configuration, predict (with highest accuracy) the end configuration. If the automaton is deterministic, the outcome simplifies to one of two configurations, all zeros or all ones. If the automaton is probabilistic, the whole process is modeled by a finite homogeneous Markov chain, and the outcome is the corresponding stationary distribution. Based on our previous results for the asynchronous case-connecting the probability of a configuration in the stationary distribution to its number of zero-one borders-the article offers both numerical and theoretical insight into the long-term behavior of synchronous cellular automata.

A Probabilistic Game of Life on a Quantum Annealer

“…In this paper, we are concerned with a probabilistic extension that performs state changes only up to a certain probability (instead of sticking to deterministic certainty). Aguilera-Venegas et al (2019); Billings and Yang (2003); Mairesse and Marcovici (2014); Agapie et al (2014), e.g., study the properties Figure 2: Analysis of the weight w between two qubits q 0 , q 1 . The plot shows the probability of q 1 = 1 after annealing when q 0 = 1. of such rulesets.…”

Persistent homology and the shape of evolutionary games

“…The process can be modeled more generally as a finite homogeneous Markov chain (Agapie et al, 2014), where the chance for a strategy A at one lattice to change into strategy B is given by the probability transition:…”

Source of Knowledge Dynamics—Transition from High School to University

“…Yet, finding an intrinsic relationship among states leading to a close-form stationary distribution is always a tricky, highly unlikely mathematical event, as witnessed by the Markov chain analysis of how opinion changes within a community. The Markov chain was built by considering a lattice-like spatial representation of the population; the opinion of each person is affected (probabilistically) only by a small group of peers in her/his neighborhood [ 15 , 16 , 17 , 18 , 19 ].…”