Combinatorics of Boolean automata circuits dynamics

Jacques Demongeot (1, 2) , Mathilde Noual (2, 3) , Sylvain Sené (2, 4)

1 AGIM - AGeing and IMagery
2 IXXI - Institut Rhône-Alpin des systèmes complexes
3 LIP - Laboratoire de l'Informatique du Parallélisme
4 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes

In line with fields of theoretical computer science and biology that study Boolean automata networks to model regulation networks, we present some results concerning the dynamics of networks whose underlying structures are oriented cycles, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain them. Our work focuses on the number of attractors of Boolean automata circuits whose elements are updated in parallel. In particular, we give the exact value of the total number of attractors of a circuit of arbitrary size n as well as, for every positive integer p, the number of its attractors of period p depending on whether the circuit has an even or an odd number of inhibitions. As a consequence, we obtain that both numbers depend only on the parity of the number of inhibitions and not on their distribution along the circuit. We also relate the counting of attractors of Boolean automata circuits to other known combinatorial problems and give intuition about how circuits interact by studying their dynamics when they intersect one another in one point.

Keywords: Discrete dynamical system; Boolean automata network; Positive and negative circuit; Asymptotic behaviour; Attractor

Domains: Bioinformatics [q-bio.QM]; Quantitative Methods [q-bio.QM]; Discrete Mathematics [cs.DM]

Jacques Demongeot, Mathilde Noual, Sylvain Sené. Combinatorics of Boolean automata circuits dynamics. Discrete Applied Mathematics, 2012, 160 (4-5), pp.398--415. ⟨10.1016/j.dam.2011.11.005⟩. ⟨hal-00666297⟩