Cyclic Cellular Automata and Greenberg-Hastings Models on Regular Trees

Jason Bello, David Sivakoff

We study the cyclic cellular automaton (CCA) and the Greenberg-Hastings model (GHM) with $\kappa \ge 3$ colors and contact threshold $\theta \ge 2$ on the infinite $(d+1)$-regular tree, $T_d$.…