Local negative circuits and fixed points in Boolean networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2011

Local negative circuits and fixed points in Boolean networks

Résumé

To each Boolean function $F$ from ${0,1}^n$ to itself and each point x in ${0,1}^n$, we associate the signed directed graph $G_F(x)$ of order $n$ that contains a positive (resp. negative) arc from $j$ to $i$ if the partial derivative of $f_i$ with respect of $x_j$ is positive (resp. negative) at point $x$. We then focus on the following open problem: Is the absence of a negative circuit in $G_F(x)$ for all $x$ in ${0,1}^n$ a sufficient condition for $F$ to have at least one fixed point? As main result, we settle this problem under the additional condition that, for all x in ${0,1}^n$, the out-degree of each vertex of $G_F(x)$ is at most one.
Fichier principal
Vignette du fichier
0910.0750.pdf (130.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01298851 , version 1 (06-04-2016)

Identifiants

Citer

Adrien Richard. Local negative circuits and fixed points in Boolean networks. Discrete Applied Mathematics, 2011, 159 (11), pp.1085-1093. ⟨hal-01298851⟩
58 Consultations
26 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More