A cellular automaton consists of a sequence of cells, each with a state, and a globally symmetric transition rule based on the neighbors of a cell. They can be interpreted as graphs where each cell is a node, and each node has an edge to a neighbor.

Is there any field studying that system, but generalized to arbitrary graphs - i.e., allowing cells to have, for example, 3 or more neighbors?

  • $\begingroup$ 2D Celular automatons? Or, more generally, n-dimensional k-color r-distance celular automata are pretty common among the literature. $\endgroup$ – Jsevillamol Jan 1 '17 at 10:47
  • $\begingroup$ @Jsevillamol I mean general graphs not n-dimensional matrices... $\endgroup$ – MaiaVictor Jan 1 '17 at 12:44

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.