Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks

DOI10.1137/16M1060868zbMath1368.05136arXiv1602.03109OpenAlexW2962935276MaRDI QIDQ5348493

Adrien Richard, Julio Aracena, Lilian Salinas

Publication date: 18 August 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.03109

zbMATH Keywords

fixed pointsdiscrete dynamical systemspacking numberinteraction graphtransversal number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Transversal (matching) theory (05D15) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (16)

Complexity of fixed point counting problems in Boolean networks ⋮ Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Complexity of limit-cycle problems in Boolean networks ⋮ Boolean networks: beyond generalized asynchronicity ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Attractor separation and signed cycles in asynchronous Boolean networks ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ Concurrency in Boolean networks ⋮ The complexity of the asynchronous prediction of the majority automata ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Positive and negative cycles in Boolean networks ⋮ Optimising attractor computation in Boolean automata networks ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs ⋮ On the stability and instability of finite dynamical systems with prescribed interaction graphs ⋮ Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules ⋮ Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing directed circuits exactly
• Maximum number of fixed points in regulatory Boolean networks
• Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
• Signed graphs
• Packing directed circuits
• A mathematical bibliography of signed and gain graphs and allied areas
• Packing directed circuits fractionally
• Information flows, graphs and their guessing numbers
• Maximum number of fixed points in AND-OR-NOT networks
• Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits
• Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
• Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
• On the presence of disjoint subgraphs of a specified type
• Network information flow
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Neural networks and physical systems with emergent collective computational abilities.
• Two-Part and k-Sperner Families: New Proofs Using Permutations
• On a lemma of Littlewood and Offord
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks