Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Article Dans Une Revue Advances in Applied Mathematics Année : 2008

Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework

Résumé

To each Boolean function f : {0, 1}^n → {0, 1}^n and each x ∈ {0, 1}^n, we associate a signed directed graph G(x), and we show that the existence of a positive circuit in G(x) for some x is a necessary condition for the existence of several fixed points in the dynamics (the sign of a circuit being defined as the product of the signs of its edges), and that the existence of a negative circuit is a necessary condition for the existence of an attractive cycle. These two results are inspired by rules for discrete models of genetic regulatory networks proposed by the biologist R. Thomas. The proof of the first result is modelled after a recent proof of the discrete Jacobian conjecture.
Fichier principal
Vignette du fichier
aam07c.pdf (212.48 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00692086 , version 1 (28-04-2012)

Identifiants

Citer

Elisabeth Remy, Paul Ruet, Denis Thieffry. Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework. Advances in Applied Mathematics, 2008, 41 (3), pp.335-350. ⟨10.1016/j.aam.2007.11.003⟩. ⟨hal-00692086⟩
308 Consultations
183 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More