On certain morphisms of sequential dynamical systems
The author studies a class of discrete dynamical systems that consist of the following data: 1) a finite (labeled) graph \(Y\) with vertex set \(\{1,2,\dots, N\}\), where each vertex has a binary state, 2) a vertex labeled multi-set of functions \((F_{i,Y}: F^N_2\to F^N_2)_i\) and 3) a permutaiton \(\pi\in S_N\). The function \(F_{i,Y}\) updates the binary state of vertex \(i\) as a function of the vertex \(i\) and its \(Y\)-neighbors and leaves the states of all other vertices fixed. The permutation \(\pi\) represents a \(Y\)-vertex ordering according to which the functions \(F_{i,Y}\) are applied. By composing the functions \(F_{i,Y}\) in the order given by \(\pi\) the author obtains the sequential dynamical system (SDS). The main result of the paper states that locally bijective graph-morphisms (coverings) between dependency graphs of SDSs naturally induce SDS-morphisms.
- Decomposition and simulation of sequential dynamical systems
- Combinatorics of sequential dynamical systems
- scientific article; zbMATH DE number 1811720 (Why is no real title available?)
- scientific article; zbMATH DE number 3860001 (Why is no real title available?)
- ON A NEW CLASS OF LOAD BALANCING NETWORK PROTOCOLS
- scientific article; zbMATH DE number 7356842 (Why is no real title available?)
- Agent-based modeling, mathematical formalism for
This page was built for publication: On certain morphisms of sequential dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487987)