Exploring Graph Cellular Automata

How we can find local rules that produce specific global behavior

1) Cellular Automaton Basics

The best way to introduce cellular automata is by example. Figure 1 shows a canonical example of a simple cellular automaton. It is called Rule 110 because its set of rules can be specified by the binary sequence 01101110 (1’s for any black updated cell). Rule 110 begins with the first row of cells, which contains a single black cell. Each subsequent row is a …

cellular data science graph graph neural networks graph-theory mathematics thoughts-and-theory