# Stochastic cellular automaton

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.

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.

## PCA as Markov stochastic processes

As discrete-time Markov process, PCA are defined on a product space ${\displaystyle E=\prod _{k\in G}S_{k}}$ (cartesian product) where ${\displaystyle G}$ is a finite or infinite graph, like ${\displaystyle \mathbb {Z} }$ and where ${\displaystyle S_{k}}$ is a finite space, like for instance ${\displaystyle S_{k}=\{-1,+1\}}$ or ${\displaystyle S_{k}=\{0,1\}}$. The transition probability has a product form ${\displaystyle P(d\sigma |\eta )=\otimes _{k\in G}p_{k}(d\sigma _{k}|\eta )}$ where ${\displaystyle \eta \in E}$ and ${\displaystyle p_{k}(d\sigma _{k}|\eta )}$ is a probability distribution on ${\displaystyle S_{k}}$. In general some locality is required ${\displaystyle p_{k}(d\sigma _{k}|\eta )=p_{k}(d\sigma _{k}|\eta _{V_{k}})}$ where ${\displaystyle \eta _{V_{k}}=(\eta _{j})_{j\in V_{k}}}$ with ${\displaystyle {V_{k}}}$ a finite neighbourhood of k. See [3] for a more detailed introduction following the probability theory's point of view.

## Examples of stochastic cellular automaton

### Majority cellular automaton

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

### Relation to random fields

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

### Cellular Potts model

There is a strong connection[citation needed] between probabilistic cellular automata and the cellular Potts model in particular when it is implemented in parallel.

## References

1. ^ Toom, A. L. (1978), Locally Interacting Systems and their Application in Biology: Proceedings of the School-Seminar on Markov Interaction Processes in Biology, held in Pushchino, March 1976, Lecture Notes in Mathematics, 653, Springer-Verlag, Berlin-New York, ISBN 3-540-08450-9, MR 0479791
2. ^ R. L. Dobrushin; V. I. Kri︠u︡kov; A. L. Toom (1978). Stochastic Cellular Systems: Ergodicity, Memory, Morphogenesis. ISBN 9780719022067.
3. ^ P.-Y. Louis PhD
4. ^ Vichniac, G. (1984), "Simulating physics with cellular automata", Physica D, 10: 96–115, Bibcode:1984PhyD...10...96V, doi:10.1016/0167-2789(84)90253-7.