Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
From MaRDI portal
Publication:3455244
DOI10.1137/140988358zbMath1354.37047arXiv1409.6144OpenAlexW143489896MaRDI QIDQ3455244
Adrien Richard, Maximilien Gadouleau, Søren Riis
Publication date: 4 December 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.6144
Combinatorics in computer science (68R05) Symbolic dynamics (37B10) Directed graphs (digraphs), tournaments (05C20) Dynamical systems involving maps of trees and graphs (37E25) Signed and weighted graphs (05C22)
Related Items (12)
Complexity of fixed point counting problems in Boolean networks ⋮ Simple dynamics on graphs ⋮ Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ The maximal coordination principle in regulatory Boolean networks ⋮ Positive and negative cycles in Boolean networks ⋮ On the flora of asynchronous locally non-monotonic Boolean automata networks ⋮ Fixed points and connections between positive and negative cycles in Boolean networks ⋮ On the rank and periodic rank of finite dynamical systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to sequential dynamical systems
- Maximum number of fixed points in regulatory Boolean networks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Positive circuits and maximal number of fixed points in discrete dynamical systems
- Iterative behaviour of generalized majority functions
- Dynamics of positive automata networks
- A combinatorial analogue of the Jacobian problem in automata networks
- Fixed points and maximal independent sets in AND-OR networks
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- On periodical behaviour in societies with symmetric influences
- Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
- Information flows, graphs and their guessing numbers
- Maximum number of fixed points in AND-OR-NOT networks
- Necessary conditions for multistationarity in discrete dynamical systems
- Upper bounds for constant-weight codes
- Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits
- An Equivalence Between Network Coding and Index Coding
- A new table of constant weight codes
- Lower bounds for constant weight codes
- The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
- Network information flow
- Modeling and Analysis of Gene Regulatory Networks
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Index Coding With Side Information
- On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
- Probability Inequalities for Sums of Bounded Random Variables
- Closure Solvability for Network Coding and Secret Sharing
- Neural networks and physical systems with emergent collective computational abilities.
- Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding”
- A logical calculus of the ideas immanent in nervous activity
This page was built for publication: Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
