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 -neighbor rules with a large number of states. Our main focus is the asymptotic behavior, as , of the longest temporal period of a periodic solution with a given spatial period . We prove, when , that this random variable is of order , in that converges to a nontrivial distribution. For the case , we present empirical evidence in support of the conjecture that the same result holds.
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}
}