Limit cycles and update digraphs in Boolean networks
The paper begins by introducing Boolean networks iterated under a certain update schedule as well as some basic concepts, and then defines new problem concerning the sharing of limit cycles. It is shown that these and other problems are all NP-hard. In fact, the problem of sharing limit cycles cannot be answered by using only the information contained in the update digraphs. It also explores the possibility that two Boolean networks that differ only in the update schedule can share limit cycles. The paper also gives some sufficient conditions that allow the construction of non-equivalent update schedules which yield a given limit cycle, being strongly dependent on the existence of frozen nodes in the limit cycle.
- Stability structures of conjunctive Boolean networks
- On the number of different dynamics in Boolean networks with deterministic update schedules
- Sequentialization and procedural complexity in automata networks
- Existence and non existence of limit cycles in Boolean networks
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
- Cycles of periodically time-variant Boolean networks
- On the number of update digraphs and its relation with the feedback arc sets and tournaments
- Block-sequential update schedules and Boolean automata circuits
- Function perturbations in Boolean networks with its application in a \textit{D. melanogaster} gene network
- Disjunctive networks and update schedules
- Multi-Stability, Limit Cycles, and Period-Doubling Bifurcation with Reaction Systems
- On Boolean automata networks (de)composition
- About block-parallel Boolean networks: a position paper
- Combinatorics on update digraphs in Boolean networks
- Complexity of limit cycles with block-sequential update schedules in conjunctive networks
- Non-deterministic updates of Boolean networks
- Dynamically equivalent disjunctive networks
- Foundations of block-parallel automata networks
- Dynamical stability of threshold networks over undirected signed graphs
- Frustration and stability in random Boolean networks
- Complexity of limit-cycle problems in Boolean networks
- Sequential operator for filtering cycles in Boolean networks
This page was built for publication: Limit cycles and update digraphs in Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759857)
