Cellular automata on graphs: topological properties of ER graphs evolved towards low-entropy dynamics (Q406078): Difference between revisions

Summary: Cellular automata (CA) are a remarkably efficient tool for exploring general properties of complex systems and spatiotemporal patterns arising from local rules. Totalistic cellular automata, where the update~rules depend~only on the density of neighboring states, are at the same time a versatile tool for exploring~dynamical~processes on graphs. Here we briefly review our previous results on cellular automata on graphs, emphasizing some systematic relationships between network architecture and dynamics identified in this way. We then extend the investigation towards graphs obtained in a simulated-evolution procedure, starting from Erdős-Rényi (ER) graphs and selecting for low entropies of the CA dynamics. Our key result is a strong association of low Shannon entropies with a broadening of the graph's degree distribution.