Computer Science – Discrete Mathematics
Scientific paper
2012-02-06
Computer Science
Discrete Mathematics
23 pages, 8 figures, LaTeX, v2: Minor presentation improvements
Scientific paper
We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time --- but under the natural constraint that information can only ever be transmitted at a bounded speed, with respect to the distance given by the graph. The notion of translation-invariance is also generalized. The definition we provide for these `causal graph dynamics' is simple and axiomatic. The theorems we provide also show that it is robust. For instance, causal graph dynamics are stable under composition and under restriction to radius one. In the finite case some fundamental facts of Cellular Automata theory carry through: causal graph dynamics admit a characterization as continuous functions, and they are stable under inversion. The provided examples suggest a wide range of applications of this mathematical object, from complex systems science to theoretical physics. Keywords: Dynamical networks, Boolean networks, Generative networks automata, Cayley cellular automata, Graph Automata, Graph rewriting automata, Parallel graph transformations, Amalgamated graph transformations, Hedlund, Regge calculus, Local, No-signalling.
Arrighi Pablo
Dowek Gilles
No associations
LandOfFree
Causal graph dynamics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Causal graph dynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Causal graph dynamics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-119276