Probabilistic Cellular Automata

Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involved to some degree in the transition rule, we speak of probabilistic automata, otherwise they are called deterministic. With either type of cellular automaton we are dealing with, the main theoretical challenge stays the same: starting from an arbitrary initial configuration, predict (with highest accuracy) the end configuration. If the automaton is deterministic, the outcome simplifies to one of two configurations, all zeros or all ones. If the automaton is probabilistic, the whole process is modeled by a finite homogeneous Markov chain, and the outcome is the corresponding stationary distribution. Based on our previous results for the asynchronous case-connecting the probability of a configuration in the stationary distribution to its number of zero-one borders-the article offers both numerical and theoretical insight into the long-term behavior of synchronous cellular automata.

[1]  Pablo Pedregal,et al.  Relaxation of an optimal design problem for the heat equation , 2008 .

[2]  David O'Sullivan,et al.  A discrete space model for continuous space dispersal processes , 2009, Ecol. Informatics.

[3]  Y. Peres,et al.  Brownian motion.Vol. 30. , 2010 .

[4]  Alexandru Agapie,et al.  Simple form of the stationary distribution for 3D cellular automata in a special case , 2010 .

[5]  Heinz Mühlenbein,et al.  Markov Chain Analysis for One-Dimensional Asynchronous Cellular Automata , 2004 .

[6]  D. Levy,et al.  Stochastic Models for Phototaxis , 2008, Bulletin of mathematical biology.

[7]  P. Clifford,et al.  A model for spatial conflict , 1973 .

[8]  Owen J. Brison,et al.  Complete sets of initial vectors for pattern growth with elementary cellular automata , 2010, Comput. Phys. Commun..

[9]  Richard Durrett,et al.  Chemical evolutionary games. , 2014, Theoretical population biology.

[10]  Roy Mathias,et al.  A stochastic automata network descriptor for Markov chain models of instantaneously coupled intracellular Ca2+ channels , 2005, Bulletin of mathematical biology.

[11]  Angeliki Ermogenous.  Brownian Motion and Its Applications In The Stock Market , 2006 .

[12]  Günter Rudolph,et al.  Convergence of evolutionary algorithms on the n-dimensional continuous space , 2013, IEEE Transactions on Cybernetics.

[13]  Andrey L. Piatnitski,et al.  Homogenization of a singular random one-dimensional PDE , 2008, 0912.5277.

[14]  D. Sumpter,et al.  Coupled map lattice approximations for spatially explicit individual-based models of ecology , 2005, Bulletin of mathematical biology.

[15]  Robin Höns,et al.  Limit behavior of the exponential voter model , 2010, Math. Soc. Sci..

[16]  Alexandru Agapie,et al.  Stationary Distribution for a Majority Voter Model , 2008 .