Circuits, Attractors and Reachability in Mixed-K Kauffman Networks

The growth in number and nature of dynamical attractors in Kauffman NK network models are still not well understood properties of these important random boolean networks. Structural circuits in the underpinning graph give insights into the number and length distribution of attractors in the NK model. We use a fast direct circuit enumeration algorithm to study the NK model and determine the growth behaviour of structural circuits. This leads to an explanation and lower bound on the growth properties and the number of attractor loops and a possible K-relationship for circuit number growth with network size N . We also introduce a mixed-K model that allows us to explore N h Ki between pairs of integer K values in Kauffmanlike systems. We find that the circuits’ behaviour is a useful metric in identifying phase transitional behaviour around the critical connectivity in that model too. We identify an intermediate phase transition in circuit growth behaviour at K = KS ≈ 1.5, that is distinct from both the percolation transition at KP ≡ 1 and the Kauffman transition at KC ≡ 2. We relate this transition to mutual node reachability within the giant component of nodes.

[1]  James C. Tiernan,et al.  An efficient search algorithm to find the elementary circuits of a graph , 1970, CACM.

[2]  James F. Lynch.  DYNAMICS OF RANDOM BOOLEAN NETWORKS , 2007 .

[3]  S. Kauffman.  Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[4]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[5]  S. Bilke,et al.  Stability of the Kauffman model. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  P. Cluzel,et al.  A natural class of robust networks , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[7]  C. F. Baillie,et al.  Quenching 2D quantum gravity , 1994 .

[8]  Florian Greil,et al.  Kauffman networks with threshold functions , 2007 .

[9]  J. J. Fox,et al.  From topology to dynamics in biochemical networks. , 2001, Chaos.

[10]  B. Samuelsson,et al.  Superpolynomial growth in the number of attractors in Kauffman networks. , 2003, Physical review letters.

[11]  C. Baillie.  Quenching 2 D Quantum Gravity , 2008 .

[12]  Frank Harary,et al.  Graphical enumeration , 1973 .

[13]  G. Parisi,et al.  The modular structure of Kauffman networks , 1997, cond-mat/9708214.

[14]  B. Derrida,et al.  Random networks of automata: a simple annealed approximation , 1986 .

[15]  L Correale,et al.  Core percolation and onset of complexity in boolean networks. , 2004, Physical review letters.

[16]  Barbara Drossel.  Number of attractors in random Boolean networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Leo P. Kadanoff,et al.  Numerical and Theoretical Studies of Noise Effects in the Kauffman Model , 2002 .

[18]  Carlos Gershenson,et al.  Introduction to Random Boolean Networks , 2004, ArXiv.

[19]  B. Derrida,et al.  Phase Transitions in Two-Dimensional Kauffman Cellular Automata , 1986 .

[20]  I. Jerman,et al.  Boolean networks with variable number of inputs (K). , 2004, Chaos.

[21]  Henrik Flyvbjerg,et al.  Exact solution of Kauffman's model with connectivity one , 1988 .

[22]  Kenneth A. Hawick,et al.  Structural Circuits and Attractors in Kauffman Networks , 2007, ACAL.

[23]  Robert E. Tarjan,et al.  Enumeration of the Elementary Circuits of a Directed Graph , 1972, SIAM J. Comput..

[24]  Christof Teuscher,et al.  Critical Values in Asynchronous Random Boolean Networks , 2003, ECAL.

[25]  C. F. Baillie,et al.  Damaging 2D quantum gravity , 1994 .

[26]  Stuart A. Kauffman,et al.  ORIGINS OF ORDER , 2019, Origins of Order.

[27]  B. Drossel,et al.  Number and length of attractors in a critical Kauffman model with connectivity one. , 2004, Physical review letters.

[28]  L. Kadanoff,et al.  Boolean Dynamics with Random Couplings , 2002, nlin/0204062.

[29]  Ken A. Hawick,et al.  Simulating Large Random Boolean Networks , 2007 .

[30]  G. Parisi,et al.  Relevant elements, magnetization and dynamical properties in Kauffman networks: a numerical study , 1998 .

[31]  S A Kauffman,et al.  Scaling in ordered and critical random boolean networks. , 2002, Physical review letters.

[32]  Andrew Wuensche,et al.  Discrete Dynamical Networks and Their Attractor Basins , 1998 .

[33]  Carsten Peterson,et al.  Random Boolean network models and the yeast transcriptional network , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[34]  B. Drossel,et al.  Evolution of canalizing Boolean networks , 2007, q-bio/0701025.

[35]  Stephen Wolfram,et al.  Theory and Applications of Cellular Automata , 1986 .

[36]  S. Kauffman.  Homeostasis and Differentiation in Random Genetic Control Networks , 1969, Nature.