Incollection,

Graph-Rewriting Automata as a Natural Extension of Cellular Automata

, , and .
Adaptive Networks: Theory, Models and Applications, chapter 14, Springer, Berlin/Heidelberg, (2009)
DOI: 10.1007/978-3-642-01284-6_14

Abstract

We introduce a framework called graph-rewriting automata to model evolution processes of networks. It is a natural extension of cellular automata in the sense that a fixed lattice space of cellular automata is extended to a dynamic graph structure by introducing local graph-rewriting rules. We consider three different constructions of rule sets to show that various network evolution is possible: hand-coding, evolutionary generation, and exhaustive search. Graph-rewriting automata provide a new tool to describe various complex systems and to approach many scientific problems.

Tags

Users

  • @rincedd
  • @huazai

Comments and Reviews