Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
From MaRDI portal
Publication:2342676
DOI10.1016/j.tcs.2015.03.038zbMath1310.94244arXiv1302.6346OpenAlexW2279548912MaRDI QIDQ2342676
Publication date: 29 April 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.6346
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Bistability and asynchrony in a Boolean model of the \textsc{L}-arabinose operon in \textit{Escherichia coli} ⋮ Positive and negative cycles in Boolean networks ⋮ Negative local feedbacks in Boolean networks ⋮ Fixed points and connections between positive and negative cycles in Boolean networks ⋮ Cyclic attractors of nonexpanding \(q\)-ary networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorics of Boolean automata circuits dynamics
- Maximum number of fixed points in regulatory Boolean networks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Negative circuits and sustained oscillations in asynchronous automata networks
- On kernel-perfect critical digraphs
- Itérations sur des ensembles finis et automates cellulaires contractants
- Solution of the Boolean Markus-Yamabe problem
- A combinatorial analogue of the Jacobian problem in automata networks
- Discrete dynamical systems
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- A new necessary condition on interaction graphs for multistationarity
- Local negative circuits and fixed points in non-expansive Boolean networks
- Finding All the Elementary Circuits of a Directed Graph
- Digraphs
This page was built for publication: Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
