Topology regulates pattern formation capacity of binary cellular automata on graphs

We study the effect of topology variation on the dynamic behavior of a system with local update rules. We implement one-dimensional binary cellular automata on graphs with various topologies by formulating two sets of degree-dependent rules, each containing a single parameter. We observe that changes in graph topology induce transitions between different dynamic domains (Wolfram classes) without a formal change in the update rule. Along with topological variations, we study the pattern formation capacities of regular, random, small-world and scale-free graphs. Pattern formation capacity is quantified in terms of two entropy measures, which for standard cellular automata allow a qualitative distinction between the four Wolfram classes. A mean-field model explains the dynamic behavior of random graphs. Implications for our understanding of information transport through complex, networkbased systems are discussed.

[1]  Andrzej Rucinski,et al.  Random graphs , 2006, SODA.

[2]  M. Aldana.  Boolean dynamics of networks with scale-free topology , 2003 .

[3]  Sergei Maslov,et al.  Hierarchy measures in complex networks. , 2003, Physical review letters.

[4]  S. Sakai,et al.  Quiescent string dominance parameter F and classification of one-dimensional cellular automata. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Sheng-You Huang,et al.  Network-induced nonequilibrium phase transition in the "game of Life". , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  M. Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[7]  A. Barabasi,et al.  The topology of the transcription regulatory network in the yeast , 2002, cond-mat/0205181.

[8]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[9]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[10]  D. Fell,et al.  The small world of metabolism , 2000, Nature Biotechnology.

[11]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[12]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[13]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[14]  M. Weigt,et al.  On the properties of small-world network models , 1999, cond-mat/9903411.

[15]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[16]  Christopher G. Langton,et al.  Computation at the edge of chaos: Phase transitions and emergent computation , 1990 .

[17]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[18]  A. Barabasi,et al.  Emergence of Scaling in Random Networks , 1999 .

[19]  Stephen Wolfram,et al.  Universality and complexity in cellular automata , 1983 .