Local negative circuits and fixed points in non-expansive Boolean networks
From MaRDI portal
Publication:2275909
DOI10.1016/J.DAM.2011.01.010zbMATH Open1253.94082OpenAlexW1998873491MaRDI QIDQ2275909FDOQ2275909
Authors: Adrien Richard 
Publication date: 10 August 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.010
Recommendations
- Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
- A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Negative local feedbacks in Boolean networks
- Fixed points and connections between positive and negative cycles in Boolean networks
Cites Work
- A combinatorial analogue of the Jacobian problem in automata networks
- Title not available (Why is that?)
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Necessary conditions for multistationarity in discrete dynamical systems
- Negative circuits and sustained oscillations in asynchronous automata networks
- Discrete dynamical systems
- Solution of the Boolean Markus-Yamabe problem
- Itérations sur des ensembles finis et automates cellulaires contractants
- An extension of a combinatorial fixed point theorem of Shih and Dong
Cited In (14)
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- Linear and nonlinear arabesques: a study of closed chains of negative 2-element circuits
- Fixed points and connections between positive and negative cycles in Boolean networks
- Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
- A general model of binary opinions updating
- Generalization of Shih-Dong's combinational fixed point theorem to finite distributive lattices
- About non-monotony in Boolean automata networks
- Positive and negative cycles in Boolean networks
- Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
- Local negative circuits and cyclic attractors in Boolean networks with at most five components
- On circuit functionality in Boolean networks
- Negative local feedbacks in Boolean networks
- Cyclic attractors of nonexpanding \(q\)-ary networks
- Negative circuits and sustained oscillations in asynchronous automata networks
This page was built for publication: Local negative circuits and fixed points in non-expansive Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275909)
