# Stochastic cellular automaton

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

**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.

## Contents

## PCA as Markov stochastic processes

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 ^{[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

- ↑
**Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).** - ↑ R. L. Dobrushin, V. I. Kri︠u︡kov, A. L. Toom (1978).
*Stochastic Cellular Systems: Ergodicity, Memory, Morphogenesis*. ISBN 9780719022067. <templatestyles src="Module:Citation/CS1/styles.css"></templatestyles> - ↑ P.-Y. Louis PhD
- ↑
**Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).**.

## Additional reading

- Almeida, R. M.; Macau, E. E. N. (2010), "Stochastic cellular automata model for wildland fire spread dynamics",
*9th Brazilian Conference on Dynamics, Control and their Applications, June 7–11, 2010*<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>. **Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).**.- Mahajan, Meena Bhaskar (1992),
*Studies in language classes defined by different types of time-varying cellular automata*, Ph.D. dissertion, Indian Institute of Technology Madras<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>.

- CS1 maint: Multiple names: authors list
- Wikipedia articles that are too technical from June 2013
- All articles that are too technical
- Articles needing expert attention from June 2013
- Articles with unsourced statements from March 2016
- Cellular automata
- Stochastic processes
- Lattice models
- Markov processes
- Self-organization
- Complex systems theory
- Spatial processes
- Stochastic models
- Markov models