Network Analysis of the State Space of Discrete Dynamical Systems
arXiv:cond-mat/0610447 · doi:10.1103/PhysRevLett.98.198701
Abstract
We study networks representing the dynamics of elementary 1-d cellular automata (CA) on finite lattices. We analyze scaling behaviors of both local and global network properties as a function of system size. The scaling of the largest node in-degree is obtained analytically for a variety of CA including rules 22, 54 and 110. We further define the \emph{path diversity} as a global network measure. The co-appearance of non-trivial scaling in both hub size and path diversity separates simple dynamics from the more complex behaviors typically found in Wolfram's Class IV and some Class III CA.
major revision; includes also improved numerics
References in corpus (1)
Cited by in corpus (4)
- Chaotic Gene Regulatory Networks Can Be Robust Against Mutations and Noise
- Complex Network Analysis of State Spaces for Random Boolean Networks
- Random sampling vs. exact enumeration of attractors in random Boolean networks
- Avalanches, branching ratios, and clustering of attractors in Random Boolean Networks and in the segment polarity network of \emph{Drosophila}