We study networks representing the dynamics of elementary 1D 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 path diversity as a global network measure. The coappearance of nontrivial scaling in both the hub size and the path diversity separates simple dynamics from the more complex behaviors typically found in Wolfram's class IV and some class III CA.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1103/PhysRevLett.98.198701 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!