# Stochastic cellular automaton

## Cellular automaton with probabilistic rules / From Wikipedia, the free encyclopedia

#### Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about Stochastic cellular automaton?

Summarize this article for a 10 year old

**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. See [3] for a more detailed introduction.

Oops something went wrong: