Periodic solutions of one-dimensional cellular automata with random rules

Abstract

We study cellular automata with randomly selected rules. Our setting are two-neighbor rules with a large number n of states. The main quantity we analyze is the asymptotic probability, as n ∞, that the random rule has a periodic solution with given spatial and temporal periods. We prove that this limiting probability is non-trivial when the spatial and temporal periods are confined to a finite range. The main tool we use is the Chen-Stein method for Poisson approximation. The limiting probability distribution of the smallest temporal period for a given spatial period is deduced as a corollary and relevant empirical simulations are presented.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…