# Stochastic cellular automaton

Cellular automaton with probabilistic rules From Wikipedia, the free encyclopedia

Cellular automaton with probabilistic rules From Wikipedia, the free encyclopedia

**Stochastic cellular automata** or **probabilistic cellular automata** (**PCA**) or **random cellular automata** or **locally interacting Markov chains**^{[1]}^{[2]} are an important extension of cellular automaton. Cellular automata are a discrete-time dynamical system of interacting entities, whose state is discrete.

This article may be too technical for most readers to understand. (June 2013) |

The state of the collection of entities is updated at each discrete time according to some simple homogeneous rule. All entities' states are updated in parallel or synchronously. Stochastic cellular automata are CA whose updating rule is a stochastic one, which means the new entities' states are chosen according to some probability distributions. It is a discrete-time random dynamical system. From the spatial interaction between the entities, despite the simplicity of the updating rules, complex behaviour may emerge like self-organization. As mathematical object, it may be considered in the framework of stochastic processes as an interacting particle system in discrete-time.
See ^{[3]}
for a more detailed introduction.

As discrete-time Markov process, PCA are defined on a product space (cartesian product) where
is a finite or infinite graph, like and where is a finite space, like for instance
or . The transition probability has a product form
where
and is a probability distribution on .
In general some locality is required where
with a finite neighbourhood of k. See ^{[4]} for a more detailed introduction following the probability theory's point of view.

There is a version of the majority cellular automaton with probabilistic updating rules. See the Toom's rule.

PCA may be used to simulate the Ising model of ferromagnetism in statistical mechanics.^{[5]}
Some categories of models were studied from a statistical mechanics point of view.

There is a strong connection^{[6]}
between probabilistic cellular automata and the cellular Potts model in particular when it is implemented in parallel.

The Galves–Löcherbach model is an example of a generalized PCA with a non Markovian aspect.

Seamless Wikipedia browsing. On steroids.

Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.

Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.