# The one-dimensional cyclic cellular automaton: A system with deterministic dynamics that emulates an interacting particle system with stochastic dynamics

- Received:
- Revised:

DOI: 10.1007/BF01045164

- Cite this article as:
- Fisch, R. J Theor Probab (1990) 3: 311. doi:10.1007/BF01045164

- 7 Citations
- 52 Downloads

## Abstract

Consider a cellular automaton defined on ℤ where each lattice site may take on one of*N* values, referred to as colors. The*N* colors are arranged in a cyclic hierarchy, meaning that color*k* follows color*k*−1 mod*N* (*k*=0,...,*N*−1). Any two colors that are not adjacent in this hierarchy form an inert pair. In this scheme, there is symmetry in the*N* colors. Initialized the cellular automaton with product measure, and let time pass in discrete units. To get the configuration at time*t*+1 from the one at time*t*, each lattice site looks at the colors of its two nearest neighbors, and if it sees the color that follows its own color, then that site changes color to the color that follows; otherwise, that site does not change color. All such updates occur synchronously at time*t*+1. For each value of*N*≥2, the fundamental question is whether each site in the cellular automaton changes color infinitely often (fluctuation) or only finitely often (fixation). We prove here that if*N*≤4, then fluctuation occurs, and if*N*≥5, then fixation occurs.