From kernels in directed graphs to fixed points and negative cycles in Boolean networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2013

From kernels in directed graphs to fixed points and negative cycles in Boolean networks

Résumé

We consider a class of Boolean networks called and-nets, and we address the question of whether the absence of negative cycle in local interaction graphs implies the existence of a fixed point. By defining correspondences with the notion of kernel in directed graphs, we prove a particular case of this question, and at the same time, we prove new theorems in kernel theory, on the existence and unicity of kernels.
Fichier principal
Vignette du fichier
2013_Kernel_DAM.pdf (208.38 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

Adrien Richard, Paul Ruet. From kernels in directed graphs to fixed points and negative cycles in Boolean networks. Discrete Applied Mathematics, 2013, 161 (7-8), pp.1106-1117. ⟨10.1016/j.dam.2012.10.022⟩. ⟨hal-01298841⟩
219 Consultations
115 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More