Elements of a theory of computer simulation I: Sequential CA over random graphs

This paper is a first step in the development of mathematical foundations for a theory of simulation. We employ sequentially updated cellular automata (sCA) over arbitrary graphs as a paradigmatic framework. In the development of the theory, we focus on the properties of causal dependencies among local mappings in a simulation. Let Y be a graph in which (a) each vertex i has a state x"i0, 1 and (b) there exists a local map @?"i defined on the states of the Y-neighbors and x"i that returns the state of y"i0, 1. Suppose i"1, ..., i"n is a permutation of the Y-vertices, then the order of application of the local maps @?"i"k induces a sequential (or asynchronous) cellular automaton (sCA) over Y. In this paper we introduce a mapping between the base graph Y, over which the sCA is defined and which represents the mutual dependencies of the local maps, and the update graph U(Y), whose vertices are permutations of all Y-vertices. Two permutations @p"1, @p"2 are adjacent in U(Y) if they differ in exactly two consecutive coordinates, {i"k, i"k+1|, and {i"k, i"k"+"1@? eY. U(Y) represents a conceptual framework which allows to determine equivalence classes of sCA for a given graph X, independent of the family of local maps (@?"i) "1" "=<" "i" "=<" "n. We consider: (a) U as a random variable over G"n","p and analyze the induced random graph U(G"n","p), the update graph, and show (b) that U exhibits properties of a covariant functor.

[1]  G. Viennot.  Heaps of Pieces, I: Basic Definitions and Combinatorial Lemmas , 1989 .

[2]  B. Bollobás,et al.  An algorithm for finding hamilton paths and cycles in random graphs , 1987 .

[3]  Béla Bollobás,et al.  Almost all Regular Graphs are Hamiltonian , 1983, European journal of combinatorics (Print).

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

[5]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[6]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[7]  Volker Diekert,et al.  Combinatorics on Traces , 1990, Lecture Notes in Computer Science.

[8]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[9]  B. Bollobás.  The evolution of random graphs , 1984 .

[10]  Christopher G. Langton,et al.  Computation at the edge of chaos: Phase transitions and emergent computation , 1990 .

[11]  János Komlós,et al.  Limit distribution for the existence of hamiltonian cycles in a random graph , 1983, Discret. Math..

[12]  K. Mani Chandy,et al.  A unifying framework for distributed simulation , 1991, TOMC.

[13]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[14]  雪田 修一.  Cellular Automata on Cayley Graphs , 2000 .

[15]  Jian-yi Shi.  The Enumeration of Coxeter Elements , 1997 .

[16]  T. Czárán.  The global dynamics of cellular automata: by Andrew Wuensche and Mike Lesser, Addison-Wesley, 1992. £39.69 hbk (xvii + 250 pages) ISBN 0 201 55740 1 , 1993 .

[17]  Vijay K. Garg,et al.  Modeling and Control of Logical Discrete Event Systems , 1994 .

[18]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[19]  Andrew Wuensche,et al.  The global dynamics of cellular automata : an atlas of basin of attraction fields of one-dimensional cellular automata , 1992 .

[20]  S. Wolfram.  Computation theory of cellular automata , 1984 .

[21]  Phil Hontalas,et al.  Distributed Simulation and the Time Wrap Operating System. , 1987, SOSP 1987.

[22]  Richard P. Stanley.  Acyclic orientations of graphs , 1973, Discret. Math..

[23]  P. Schuster,et al.  Generic properties of combinatory maps: neutral networks of RNA secondary structures. , 1997, Bulletin of mathematical biology.