logo

Coupled Dynamic Systems 📂Dynamics

Coupled Dynamic Systems

Definition 1

  1. Let us have a state space XX. When the adjacency matrix of a network Γ\Gamma with NN nodes is denoted by AA, and the state of node iV(Γ)i \in V \left( \Gamma \right) is represented as xiXx_{i} \in X, then the following differential equation-based dynamical system is called a Coupled Dynamical System. xi˙=fi(xi)+i=1NAjicji(xj,xi)i=1,,N \dot{x_{i}} = f_{i} \left( x_{i} \right) + \sum_{i=1}^{N} A_{ji} c_{ji} \left( x_{j} , x_{i} \right) \qquad i = 1, \cdots, N
  2. The fif_{i} for each node ii is called its Evolution.
  3. The cjic_{ji} from node jj to node ii is called the Coupling.

Explanation

Consider the commonly used Euclidean space X=RpX = \mathbb{R}^{p}, where the state xix_{i} of a node represents a vector such as the position of a particle. These vectors follow a vector field created by their respective fif_{i}, but they can interact with other nodes through the Coupling Term i=1NAjicji(xj,xi)\displaystyle \sum_{i=1}^{N} A_{ji} c_{ji} \left( x_{j} , x_{i} \right).

Two nodes ii and jj interact with each other through coupling cjic_{ji} if Aji=1A_{ji} = 1, and they do not interact if Aji=0A_{ji} = 0. Calling these concepts Network Dynamics is justified from this perspective. Especially, if Γ=KN\Gamma = K_{N}, meaning if the network is a complete graph, it can be referred to as a Particle Swarm in itself.


  1. Linder. (2021). NetworkDynamics.jl—Composing and simulating complex networks in Julia. https://doi.org/10.1063/5.0051387 ↩︎