Cellular automata over generalized Cayley graphs

  title={Cellular automata over generalized Cayley graphs},
  author={Pablo Arrighi and Simon Martiel and Vincent Nesme},
  journal={Mathematical Structures in Computer Science},
  pages={340 - 383}
It is well-known that cellular automata can be characterized as the set of translation-invariant continuous functions over a compact metric space; this point of view makes it easy to extend their definition from grids to Cayley graphs. Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to an origin; and the fact that they have a well-defined notion of translation. We propose a… 
Causal dynamics of discrete manifolds
This work formalizes, and proves theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does not propagate information too fast; and it acts everywhere the same.
Reversible causal graph dynamics: invertibility, block representation, vertex-preservation
Causal Graph Dynamics extends Cellular Automata to arbitrary time-varying graphs of bounded degree by proving that the inverse of a causal graph dynamics is a causalGraph dynamics, and that these reversible graph dynamics can be represented as finite-depth circuits of local reversible gates.
Dynamical Triangulation Induced by Quantum Walk
Numerical simulations show that the number of triangles and the local curvature grow as $\alpha$ and $\beta$ parametrize the way geometry changes upon the local density of the walker, and that, in the long run, flatness emerges.
Reversibility vs local creation/destruction
This paper obtains reversible local node creation/destruction—in three relaxed settings, whose equivalence the authors prove for robustness, both by theoretical computer science considerations and theoretical physics concerns.
Accretive Computation of Global Transformations of Graphs
An algorithm is presented which computes online the global transformation of a finite graph in an accretive manner and a local criterion is given for a rule system to extend to a graph global transformation.
D C ] 1 7 M ar 2 02 1 Accretive Computation of Global Transformations of Graphs
An algorithm is presented which computes online the global transformation of a finite graph in an accretive manner and a local criterion is given for a rule system to extend to a graph global transformation.
Accretive Computation of Global Transformations
This work focuses on data structures that can be captured as presheaves and study the computational aspects of fully synchronous rule systems on a given data structure to obtain an online algorithm.
A Category Theoretic Interpretation of Gandy's Principles for Mechanisms
This work gives category-theoretic axioms describing locally deterministic updates to finite objects describing what properties such a category should have and shows that every updating functor satisfying the authors' conditions is computable.
Lindenmayer Systems and Global Transformations
Global transformations, a category-based formalism for capturing computing models which are simultaneously local, synchronous and deterministic, are introduced through the perspective of


Simulations between Cellular Automata on Cayley Graphs
Causal graph dynamics
The theory of cellular automata is extended to arbitrary, time-varying graphs and the intuitive idea of a labelled graph which evolves in time is formalised - 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.
Hyperbolic Recognition by Graph Automata
Graph automata were first introduced by P. Rosenstiehl under the name of intelligent graphs, surely because a network of finite automata is able to know some properties about its own structure, and this hypothesis seems to be absolutely essential for the modelisation of the physical reality.
Graph-Rewriting Automata as a Natural Extension of Cellular Automata
This work considers three different constructions of rule sets to show that various network evolution is possible: hand- coding, evolutionary generation, and exhaustive search.
Reversible quantum cellular automata
The main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme.
Graph automata: natural expression of self-reproduction
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
It is shown that QCA always admit a two-layered block representation, and hence the inverse QCA is again a QCA, a striking result since the property does not hold for classical one-dimensional cellular automata as defined over such finite configurations.
An Intrinsically Universal Family of Causal Graph Dynamics
This work presents an intrinsically universal family of Causal Graph Dynamics, and gives insight on why it seems impossible to improve this result to the existence of a unique intrinsically universal instance.
Cellular Automata and Groups
Theorem: Finitely Generated Amenable Groups + Local Embeddability and Sofic Groups + Uniform Structures + Complements of Functional Analysis + Ultrafilters = 6.
Relational Growth Grammars - A Graph Rewriting Approach to Dynamical Systems with a Dynamical Structure
Relational growth grammars (RGG) are a graph rewriting formalism which extends the notations and semantics of Lindenmayer systems and which allows the specification of dynamical processes on