The phase diagram of random Boolean networks with nested canalizing functions

Abstract We obtain the phase diagram of random Boolean networks with nested canalizing functions. Using the annealed approximation, we obtain the evolution of the number bt of nodes with value one, and the network sensitivity λ, and compare with numerical simulations of quenched networks. We find that, contrary to what was reported by Kauffman et al. [Proc. Natl. Acad. Sci. 101, 17102 (2004)], these networks have a rich phase diagram, were both the “chaotic" and frozen phases are present, as well as an oscillatory regime of the value of bt. We argue that the presence of only the frozen phase in the work of Kauffman et al. was due simply to the specific parametrization used, and is not an inherent feature of this class of functions. However, these networks are significantly more stable than the variant where all possible Boolean functions are allowed.

[1]  Andrew Wuensche,et al.  A model of transcriptional regulatory networks based on biases in the observed regulation rules , 2002, Complex..

[2]  L. Amaral,et al.  Canalizing Kauffman networks: nonergodicity and its effect on their critical behavior. , 2005, Physical review letters.

[3]  Abdul Salam Jarrah,et al.  Nested Canalyzing, Unate Cascade, and Polynomial Functions. , 2006, Physica D. Nonlinear phenomena.

[4]  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.

[5]  J. Mendes,et al.  Scale-free network with Boolean dynamics as a function of connectivity. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Frank Berkshire,et al.  Reviews of Nonlinear Dynamics and Complexity , 2012 .

[7]  Barbara Drossel,et al.  The phase diagram of random threshold networks , 2008, 0807.0429.

[8]  S. Bornholdt,et al.  Criticality in random threshold networks: annealed approximation and beyond , 2002, cond-mat/0201079.

[9]  Tsutomu Sasao,et al.  Average path length of binary decision diagrams , 2005, IEEE Transactions on Computers.

[10]  S. Kauffman,et al.  Genetic networks with canalyzing Boolean rules are always stable. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

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

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

[13]  Jon T. Butler,et al.  Asymptotic Approximations for the Number of Fanout-Free Functions , 1978, IEEE Transactions on Computers.

[14]  R. Solé,et al.  Lyapunov exponents in random Boolean networks , 1999, adap-org/9907001.

[15]  K. Iguchi,et al.  Robustness of Attractor States in Complex Networks , 2008 .

[16]  Florian Greil,et al.  Critical Boolean networks with scale-free in-degree distribution. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[19]  Roberto Serra,et al.  On the dynamics of random Boolean networks with scale-free outgoing connections , 2004 .

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

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

[22]  S. Kauffman,et al.  Activities and sensitivities in boolean network models. , 2004, Physical review letters.

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

[24]  C. Waddington.  Canalization of Development and the Inheritance of Acquired Characters , 1942, Nature.

[25]  Stefan Bornholdt,et al.  Less Is More in Modeling Large Genetic Networks , 2005, Science.

[26]  W. Just,et al.  The number and probability of canalizing functions , 2003, math-ph/0312033.