English

One-dimensional cellular automata with random rules: longest temporal period of a periodic solution

Probability 2019-09-17 v1 Dynamical Systems

Abstract

We study one-dimensional cellular automata whose rules are chosen at random from among rr-neighbor rules with a large number nn of states. Our main focus is the asymptotic behavior, as nn \to \infty, of the longest temporal period Xσ,nX_{\sigma,n} of a periodic solution with a given spatial period σ\sigma. We prove, when σr\sigma \le r, that this random variable is of order nσ/2n^{\sigma/2}, in that Xσ,n/nσ/2X_{\sigma,n}/n^{\sigma/2} converges to a nontrivial distribution. For the case σ>r\sigma > r, we present empirical evidence in support of the conjecture that the same result holds.

Keywords

Cite

@article{arxiv.1909.06914,
  title  = {One-dimensional cellular automata with random rules: longest temporal period of a periodic solution},
  author = {Janko Gravner and Xiaochen Liu},
  journal= {arXiv preprint arXiv:1909.06914},
  year   = {2019}
}