The Robustness and Mutual Information Entropy of Random Modular Boolean Networks

Abstract:

Random Boolean networks have been proposed as a basic model of genetic regulatory networks for more than four decades. Attractors have been considered as the best way to represent the long-term behaviors of random Boolean networks. Most studies on attractors are made with random topologies. However, the real regulatory networks have been found to be modular or more complex topologies. In this work, we extend classical robustness and entropy analysis of random Boolean networks to random modular Boolean networks. We firstly focus on the robustness of the attractor to perturbations with different parameters. Then, we investigate and calculate how the amount of information propagated between the nodes when on an attractor, as quantified by the average pairwise mutual information. The results can be used to study the capability of genetic information propagation of different types of genetic regulatory networks.

• Periodical: Advanced Materials Research (Volumes 989-994)
• Pages: 4417-4420
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.989-994.4417
• Online since: July 2014
• Authors: Nan Zhao, Bing Hui Guo*, Fan Chao Meng
• Keywords: Boolean Network, Dynamical Analysis, Information Entropy

References

[1] Grefenstette J, Kim S, Kauffman S (2006) An analysis of the class of gene regulatory functions implied by a biochemical model. Bio Systems 84: 81–90.

DOI: 10.1016/j.biosystems.2005.09.009

[2] Kauffman SA (1969) Metabolic Stability and Epigenesis in Randomly Constructed Genetic Nets. J Theor Biol 22: 437–467.

DOI: 10.1016/0022-5193(69)90015-0

[3] Ribeiro AS, Kauffman SA, Lloyd-Price J, Socolar JES (2008) Mutual information in random Boolean models of regulatory networks. 77: 011901.

DOI: 10.1103/physreve.77.011901

[4] Shmulevich I, Kauffman SA (2004) Activities and Sensitivities in Boolean Network Models. Phys Rev Lett 93: 048701.

DOI: 10.1103/physrevlett.93.048701

[5] Bertschinger N, Natschlaäger T (2004) Real-time computation at the edge of chaos in recurrent neural networks. Neural computation 16: 1413–1436.

DOI: 10.1162/089976604323057443

[6] Krawitz P, Shmulevich I (2007) Basin Entropy in Boolean Network Ensembles. Phys Rev Lett 98: 1–4.

DOI: 10.1103/physrevlett.98.158701

[7] Nykter M, Price N, Larjo A, Aho T, Kauffman S, et al. (2008) Critical Networks Exhibit Maximal Information Diversity in Structure-Dynamics Relationships. Phys Rev Lett 100: 1–4.

DOI: 10.1103/physrevlett.100.058702

[8] Derrida B, Weisbuch G (1986) Evolution of overlaps between configurations in random Boolean networks. J Physique 47: 1297–1303.

DOI: 10.1051/jphys:019860047080129700

[9] Lloyd-Price J, Gupta A, & Ribeiro A S. (2012) Robustness and information propagation in attractors of Random Boolean Networks. PloS one, 7(7): e42018.

DOI: 10.1371/journal.pone.0042018

[10] Segal E, Shapira M, Regev A, Peer D, Botstein D, Koller D, & Friedman N. (2003) Module networks: Identifying regulatory modules and their condition-specific regulators from gene expression data. Nature Genetics, 34: 166–176.

DOI: 10.1038/ng1165