Graph dynamical system

In mathematics, the concept of graph dynamical systems can be used to capture a wide range of processes taking place on graphs or networks. A major theme in the mathematical and computational analysis of GDSs is to relate their structural properties (e.g. the network connectivity) and the global dynamics that result.

The work on GDSs considers finite graphs and finite state spaces. As such, the research typically involves techniques from, e.g., graph theory, combinatorics, algebra, and dynamical systems rather than differential geometry. In principle, one could define and study GDSs over an infinite graph (e.g. cellular automata or probabilistic cellular automata over Z k {\displaystyle \mathbb {Z} ^{k}} or interacting particle systems when some randomness is included), as well as GDSs with infinite state space (e.g. R {\displaystyle \mathbb {R} } as in coupled map lattices); see, for example, Wu.^[1] In the following, everything is implicitly assumed to be finite unless stated otherwise.

A graph dynamical system is constructed from the following components:

• A finite graph Y with vertex set v[Y] = {1,2, ... , n}. Depending on the context the graph can be directed or undirected.
• A state x_v for each vertex v of Y taken from a finite set K. The system state is the n-tuple x = (x₁, x₂, ... , x_n), and x[v] is the tuple consisting of the states associated to the vertices in the 1-neighborhood of v in Y (in some fixed order).
• A vertex function f_v for each vertex v. The vertex function maps the state of vertex v at time t to the vertex state at time t + 1 based on the states associated to the 1-neighborhood of v in Y.
• An update scheme specifying the mechanism by which the mapping of individual vertex states is carried out so as to induce a discrete dynamical system with map F: Kⁿ → Kⁿ.

The phase space associated to a dynamical system with map F: Kⁿ → Kⁿ is the finite directed graph with vertex set Kⁿ and directed edges (x, F(x)). The structure of the phase space is governed by the properties of the graph Y, the vertex functions (f_i)_i, and the update scheme. The research in this area seeks to infer phase space properties based on the structure of the system constituents. The analysis has a local-to-global character.

If, for example, the update scheme consists of applying the vertex functions synchronously one obtains the class of generalized cellular automata (CA). In this case, the global map F: Kⁿ → Kⁿ is given by

F ( x ) v = f v ( x [ v ] ) . {\displaystyle F(x)_{v}=f_{v}(x[v])\;.}

This class is referred to as generalized cellular automata since the classical or standard cellular automata are typically defined and studied over regular graphs or grids, and the vertex functions are typically assumed to be identical.

Example: Let Y be the circle graph on vertices {1,2,3,4} with edges {1,2}, {2,3}, {3,4} and {1,4}, denoted Circ₄. Let K = {0,1} be the state space for each vertex and use the function nor₃ : K³ → K defined by nor₃(x,y,z) = (1 + x)(1 + y)(1 + z) with arithmetic modulo 2 for all vertex functions. Then for example the system state (0,1,0,0) is mapped to (0, 0, 0, 1) using a synchronous update. All the transitions are shown in the phase space below.

If the vertex functions are applied asynchronously in the sequence specified by a word w = (w₁, w₂, ... , w_m) or permutation π {\displaystyle \pi } = ( π 1 {\displaystyle \pi _{1}} , π 2 , … , π n {\displaystyle \pi _{2},\dots ,\pi _{n}} ) of v[Y] one obtains the class of Sequential dynamical systems (SDS).^[2] In this case it is convenient to introduce the Y-local maps F_i constructed from the vertex functions by

F i ( x ) = ( x 1 , x 2 , … , x i − 1 , f i ( x [ i ] ) , x i + 1 , … , x n ) . {\displaystyle F_{i}(x)=(x_{1},x_{2},\ldots ,x_{i-1},f_{i}(x[i]),x_{i+1},\ldots ,x_{n})\;.}

The SDS map F = [F_Y , w] : Kⁿ → Kⁿ is the function composition

[ F Y , w ] = F w ( m ) ∘ F w ( m − 1 ) ∘ ⋯ ∘ F w ( 2 ) ∘ F w ( 1 ) . {\displaystyle [F_{Y},w]=F_{w(m)}\circ F_{w(m-1)}\circ \cdots \circ F_{w(2)}\circ F_{w(1)}\;.}

If the update sequence is a permutation one frequently speaks of a permutation SDS to emphasize this point.

Example: Let Y be the circle graph on vertices {1,2,3,4} with edges {1,2}, {2,3}, {3,4} and {1,4}, denoted Circ₄. Let K={0,1} be the state space for each vertex and use the function nor₃ : K³ → K defined by nor₃(x, y, z) = (1 + x)(1 + y)(1 + z) with arithmetic modulo 2 for all vertex functions. Using the update sequence (1,2,3,4) then the system state (0, 1, 0, 0) is mapped to (0, 0, 1, 0). All the system state transitions for this sequential dynamical system are shown in the phase space below.

From, e.g., the point of view of applications it is interesting to consider the case where one or more of the components of a GDS contains stochastic elements. Motivating applications could include processes that are not fully understood (e.g. dynamics within a cell) and where certain aspects for all practical purposes seem to behave according to some probability distribution. There are also applications governed by deterministic principles whose description is so complex or unwieldy that it makes sense to consider probabilistic approximations.

Every element of a graph dynamical system can be made stochastic in several ways. For example, in a sequential dynamical system the update sequence can be made stochastic. At each iteration step one may choose the update sequence w at random from a given distribution of update sequences with corresponding probabilities. The matching probability space of update sequences induces a probability space of SDS maps. A natural object to study in this regard is the Markov chain on state space induced by this collection of SDS maps. This case is referred to as update sequence stochastic GDS and is motivated by, e.g., processes where "events" occur at random according to certain rates (e.g. chemical reactions), synchronization in parallel computation/discrete event simulations, and in computational paradigms described later.

This specific example with stochastic update sequence illustrates two general facts for such systems: when passing to a stochastic graph dynamical system one is generally led to (1) a study of Markov chains (with specific structure governed by the constituents of the GDS), and (2) the resulting Markov chains tend to be large having an exponential number of states. A central goal in the study of stochastic GDS is to be able to derive reduced models.

One may also consider the case where the vertex functions are stochastic, i.e., function stochastic GDS. For example, Random Boolean networks are examples of function stochastic GDS using a synchronous update scheme and where the state space is K = {0, 1}. Finite probabilistic cellular automata (PCA) is another example of function stochastic GDS. In principle the class of Interacting particle systems (IPS) covers finite and infinite PCA, but in practice the work on IPS is largely concerned with the infinite case since this allows one to introduce more interesting topologies on state space.

Graph dynamical systems constitute a natural framework for capturing distributed systems such as biological networks and epidemics over social networks, many of which are frequently referred to as complex systems.

• Chemical reaction network theory
• Dynamic network analysis (a social science topic)
• Finite-state machine
• Hopfield network
• Petri net

• Macauley, Matthew; Mortveit, Henning S. (2009). "Cycle equivalence of graph dynamical systems". Nonlinearity. 22 (2): 421–436. arXiv:0802.4412. Bibcode:2009Nonli..22..421M. doi:10.1088/0951-7715/22/2/010. S2CID 17978550.
• Golubitsky, Martin; Stewart, Ian (2003). The Symmetry Perspective. Basel: Birkhauser. ISBN 0-8176-2171-7.

• Graph Dynamical Systems – A Mathematical Framework for Interaction-Based Systems, Their Analysis and Simulations by Henning Mortveit