Stochastic cellular automaton

<p>Stochastic cellular automata or probabilistic cellular automata (PCA) or random cellular automata or locally interacting <a href="/facts/Markov_chain/5oP5hntk">Markov chains</a> are an important extension of <a href="/facts/Cellular_automaton/6gfkjKAW">cellular automaton</a>. Cellular automata are a discrete-time <a href="/facts/Dynamical_system/782gREl5">dynamical system</a> of interacting entities, whose state is discrete.
</p><p>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 <a href="/facts/Stochastic/uMbgL94r">stochastic</a> one, which means the new entities' states are chosen according to some probability distributions. It is a discrete-time <a href="/facts/Random_dynamical_system/n38I5djp">random dynamical system</a>. From the spatial interaction between the entities, despite the simplicity of the updating rules, <a href="/facts/Complex_system/eGG3B1nn">complex behaviour</a> may <a href="/facts/Emergence/zlFRW0oj">emerge</a> like <a href="/facts/Self-organization/NSGBKxUa">self-organization</a>. As mathematical object, it may be considered in the framework of <a href="/facts/Stochastic_processes/Ng1n1dnB">stochastic processes</a> as an <a href="/facts/Interacting_particle_system/AK2rhyTE">interacting particle system</a> in discrete-time.
See 
for a more detailed introduction.
</p>

Stochastic cellular automaton open-in-new

Stochastic cellular automaton