Limiting behavior of 3-color excitable media on arbitrary graphs
Limiting behavior of 3-color excitable media on arbitrary graphs
Fix a simple graph $G=(V,E)$ and choose a random initial 3-coloring of vertices drawn from a uniform product measure. The 3-color cycle cellular automaton is a process in which at each discrete time step in parallel, every vertex with color $i$ advances to the successor color $(i+1)\bmod 3$ if in …