Markov Chain Analysis for One-Dimensional Asynchronous Cellular Automata

We consider the finite homogeneous Markov chain induced by a class of one-dimensional asynchronous cellular automata-automata that are allowed to change only one cell per iteration. Furthermore, we confine to totalistic automata, where transitions depend only on the number of Is in the neighborhood of the current cell. We consider three different cases: (i) size of neighborhood equals length of the automaton; (ii) size of neighborhood two, length of automaton arbitrary; and (iii) size of neighborhood three, length of automaton arbitrary. For each case, the associated Markov chain proves to be ergodic. We derive simple-form stationary distributions, in case (i) by lumping states with respect to the number of Is in the automaton, and in cases (ii) and (iii) by considering the number of 0 1 borders within the automaton configuration. For the three-neighborhood automaton, we analyze also the Markov chain at the boundary of the parameter domain, and the symmetry of the entropy. Finally, we show that if the local transition rule is exponential, the stationary probability is the Boltzmann distribution of the Ising model.