title: Probabilistic cellular automata.
abstract: 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.
authors.affiliation: 1 Department of Applied Mathematics, University of Economic Studies , Bucharest, Romania .
authors.forename: Alexandru
authors.initials: A
authors.lastname: Agapie
authors.forename: Anca
authors.initials: A
authors.lastname: Andreica
authors.forename: Marius
authors.initials: M
authors.lastname: Giuclea
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D008390:Markov Chains; D015233:Models, Statistical
keywords: binary lattice; cellular automata; detailed balance equation; finite homogeneous Markov chain; stationary distribution