Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Discrete Mathematics Année : 2015

Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory

Résumé

In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the number of fixed points that only depends on $D$. We then discover relationships between the number of fixed points of $f$ and problems in coding theory, especially the design of codes for the asymmetric channel. Using these relationships, we derive upper and lower bounds on the number of fixed points, which significantly improve those given in the literature. We also unveil some interesting behaviour of the number of fixed points of functions with a given signed digraph when the alphabet varies. We finally prove that signed digraphs with more (disjoint) positive cycles actually do not necessarily have functions with more fixed points.
Fichier principal
Vignette du fichier
1409.6144v1.pdf (494.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01298045 , version 1 (05-04-2016)

Identifiants

Citer

Maximilien Gadouleau, Adrien Richard, Søren Riis. Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory. SIAM Journal on Discrete Mathematics, 2015, ⟨10.1137/140988358⟩. ⟨hal-01298045⟩
133 Consultations
135 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More