Positive and negative cycles in Boolean networks
From MaRDI portal
Abstract: We review and discuss some results about the influence of positive and negative feedback cycles in asynchronous Boolean networks. These results merge several ideas of Thomas: positive and negative feedback cycles have been largely emphasized by Thomas, through the so called Thomas' rules, and asynchronous Boolean networks have been introduced by Thomas as a model for the dynamics of gene networks, which is nowadays very popular.
Recommendations
- Fixed points and connections between positive and negative cycles in Boolean networks
- On Negations in Boolean Networks
- Cycles of periodically time-variant Boolean networks
- Existence and non existence of limit cycles in Boolean networks
- Local cycles and dynamical properties of Boolean networks
- Dynamics of Boolean networks
- Positive and negative circuits in dynamical systems
- FINDING CYCLES IN SYNCHRONOUS BOOLEAN NETWORKS WITH APPLICATIONS TO BIOCHEMICAL SYSTEMS
- Bifurcations in Boolean Networks
- Local negative circuits and fixed points in non-expansive Boolean networks
Cites work
- ``Immunetworks, intersecting circuits and dynamics
- A circuit-preserving mapping from multilevel to Boolean dynamics
- A combinatorial analogue of the Jacobian problem in automata networks
- An extension of a combinatorial fixed point theorem of Shih and Dong
- Application of formal methods to biological regulatory networks: extending Thomas' asynchronous logical approach with temporal logic
- Asynchronous dynamics of Boolean automata double-cycles
- Asynchronous simulation of Boolean networks by monotone Boolean networks
- Asynchronous threshold networks
- Combinatorics of Boolean automata circuits dynamics
- Comportement périodique des fonctions à seuil binaires et applications
- Connectivity and dynamics for random subgraphs of the directed cube
- Discrete dynamical systems
- Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
- Fixed points and connections between positive and negative cycles in Boolean networks
- Fixed points in conjunctive networks and maximal independent sets in graph contractions
- Fixed points of Boolean networks, guessing graphs, and coding theory
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- scientific article; zbMATH DE number 4042465 (Why is no real title available?)
- scientific article; zbMATH DE number 3771418 (Why is no real title available?)
- scientific article; zbMATH DE number 50840 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 475591 (Why is no real title available?)
- Information flows, graphs and their guessing numbers
- Itérations sur des ensembles finis et automates cellulaires contractants
- Local negative circuits and fixed points in non-expansive Boolean networks
- Logical identification of all steady states: The concept of feedback loop characteristic states
- Maximum number of fixed points in AND-OR-NOT networks
- Maximum number of fixed points in regulatory Boolean networks
- Multistationarity, the basis of cell differentiation and memory. I: Structural conditions of multistationarity and other nontrivial behavior
- Multistationarity, the basis of cell differentiation and memory. II: Logical analysis of regulatory networks in terms of feedback circuits
- Necessary conditions for multistationarity in discrete dynamical systems
- Negative circuits and sustained oscillations in asynchronous automata networks
- Negative local feedbacks in Boolean networks
- Number of fixed points and disjoint cycles in monotone Boolean networks
- On a lemma of Littlewood and Offord
- On periodical behaviour in societies with symmetric influences
- On recursively directed hypercubes
- On the convergence of Boolean automata networks without negative cycles
- On the rank and periodic rank of finite dynamical systems
- Packing directed circuits
- Packing directed circuits fractionally
- Permanents, Pfaffian orientations, and even directed circuits
- Positive circuits and maximal number of fixed points in discrete dynamical systems
- Qualitative dynamics of piecewise-linear differential equations: a discrete mapping approach
- Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
- Solution of the Boolean Markus-Yamabe problem
- Stable periodicity and negative circuits in differential systems
Cited in
(16)- Fixed points and connections between positive and negative cycles in Boolean networks
- Existence and non existence of limit cycles in Boolean networks
- From additive flowers to additive automata networks
- Complexity of fixed point counting problems in Boolean networks
- Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules
- Prologue to the special issue of JTB dedicated to the memory of René Thomas (1928--2017). A journey through biological circuits, logical puzzles and complex dynamics
- On the convergence of Boolean automata networks without negative cycles
- Asynchronous dynamics of Boolean automata double-cycles
- Exponentially long orbits in Boolean networks with exclusively positive interactions
- Negative local feedbacks in Boolean networks
- Avoid one's doom: finding cliff-edge configurations in Petri nets
- Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
- An extensive study of two-node McCulloch-Pitts networks
- Relations between gene regulatory networks and cell dynamics in Boolean models
- There is no prime functional digraph: Seifert's proof revisited
- Sequential operator for filtering cycles in Boolean networks
This page was built for publication: Positive and negative cycles in Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1717061)
