Random Boolean Networks and Attractors of their Intersecting Circuits

The multi-scale strategy in studying biological regulatory networks analysis is based on two level of analysis. The first level is structural and consists in examining the architecture of the interaction graph underlying the network and the second level is functional and analyse the regulatory properties of the network. We apply this dual approach to the "immunetworks" involved in the control of the immune system. As a result, we show that the small number of attractors of these networks is due to the presence of intersecting circuits in their interaction graphs. We obtain an upper bound of the number of attractors of the whole network by multiplying the number of attractors of each of its strongly connected components. We detect first the strongly connected components in the architecture of the interaction digraph of the network. Secondly, we study the dynamical function of the attractors by looking further inside these components, notably when they form circuits (intersecting or not).

[1]  W. Marsden.  I and J , 2012 .

[2]  Jacques Demongeot,et al.  Interaction Motifs in Regulatory Networks and Structural Robustness , 2008, 2008 International Conference on Complex, Intelligent and Software Intensive Systems.

[3]  Jacques Demongeot,et al.  "Immunetworks", intersecting circuits and dynamics. , 2011, Journal of theoretical biology.

[4]  Adrien Elena,et al.  Robustesse des réseaux d'automates booléens à seuil aux modes d'itération. Application à la modélisation des réseaux de régulation génétique. (Robustness of threshold boolean automata networks to iteration modes. Application to genetic regulation network modelling) , 2009 .

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

[6]  Jacques Demongeot,et al.  Structural Sensitivity of Neural and Genetic Networks , 2008, MICAI.

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

[8]  J. Demongeot,et al.  On the number of attractors of Boolean automata circuits , 2009 .

[9]  J. Demongeot,et al.  Robustness in Regulatory Networks: A Multi-Disciplinary Approach , 2008, Acta biotheoretica.

[10]  Brendan D. McKay,et al.  Short Cycles in Random Regular Graphs , 2004, Electron. J. Comb..

[11]  Nicholas C. Wormald,et al.  The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.

[12]  René Thomas.  On the Relation Between the Logical Structure of Systems and Their Ability to Generate Multiple Steady States or Sustained Oscillations , 1981 .

[13]  Marie-Paule Lefranc,et al.  IMGT/GeneInfo: enhancing V(D)J recombination database accessibility , 2004, Nucleic Acids Res..

[14]  Béla Bollobás,et al.  Random Graphs , 1985 .

[15]  Mathilde Noual,et al.  General Iteration graphs and Boolean automata circuits , 2011, ArXiv.

[16]  Jacques Demongeot,et al.  Determination, Optimization and Taxonomy of Regulatory Networks: The Example of Arabidopsis thaliana Flower Morphogenesis , 2011, 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications.

[17]  Jacques Demongeot,et al.  Robustness in Regulatory Interaction Networks. A Generic Approach with Applications at Different Levels: Physiologic, Metabolic and Genetic , 2009, International journal of molecular sciences.

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

[19]  Jacques Demongeot,et al.  Quantitative and Qualitative Changes in V-J α Rearrangements During Mouse Thymocytes Differentiation , 2002, The Journal of Experimental Medicine.

[20]  J. Booker,et al.  Discussion-•-— »-— — — — — , 1998 .

[21]  Elizabeth-sharon Fung,et al.  A gene regulatory network armature for T-lymphocyte specification , 2008 .

[22]  Jacques Demongeot,et al.  Motifs in regulatory networks and their structural robustness , 2008, 2008 8th IEEE International Conference on BioInformatics and BioEngineering.