From kernels in directed graphs to fixed points and negative cycles in Boolean networks
| Autor: | Adrien Richard, Paul Ruet |
|---|---|
| Přispěvatelé: | Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe BIOINFO, Modèles Discrets pour les Systèmes Complexes (Laboratoire I3S - MDSC), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Preuves, Programmes et Systèmes (PPS), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS) |
| Rok vydání: | 2013 |
| Předmět: |
Class (set theory)
Discrete dynamical system 0102 computer and information sciences [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] Fixed point 01 natural sciences Combinatorics Odd cycle Negative cycle Chordal graph [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] Discrete Mathematics and Combinatorics 0101 mathematics Mathematics Discrete mathematics Directed graph Applied Mathematics Kernel theory 010101 applied mathematics Kernel 010201 computation theory & mathematics [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM] Kernel (category theory) |
| Zdroj: | Discrete Applied Mathematics Discrete Applied Mathematics, Elsevier, 2013, 161 (7-8), pp.1106-1117. ⟨10.1016/j.dam.2012.10.022⟩ |
| ISSN: | 0166-218X |
| Popis: | International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect