About non-monotony in Boolean automata networks
From MaRDI portal
Publication:393147
Abstract: This paper aims at setting the keystone of a prospective theoretical study on the role of non-monotone interactions in biological regulation networks. Focusing on discrete models of these networks, namely, Boolean automata networks, we propose to analyse the contribution of non-monotony to the diversity and complexity in their dynamical behaviours. More precisely, in this paper, we start by detailing some motivations, both mathematical and biological, for our interest in non-monotony, and we discuss how it may account for phenomena that cannot be produced by monotony only. Then, to build some understanding in this direction, we propose some preliminary results on the dynamical behaviour of some specific non-monotone Boolean automata networks called XOR circulant networks.
Recommendations
- Boolean networks synchronism sensitivity and XOR circulant networks convergence time
- On the flora of asynchronous locally non-monotonic Boolean automata networks
- Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
- Combinatorics of Boolean automata circuits dynamics
- Asynchronous dynamics of Boolean automata double-cycles
Cites work
- scientific article; zbMATH DE number 4201618 (Why is no real title available?)
- scientific article; zbMATH DE number 4042465 (Why is no real title available?)
- scientific article; zbMATH DE number 4080924 (Why is no real title available?)
- scientific article; zbMATH DE number 3771418 (Why is no real title available?)
- scientific article; zbMATH DE number 45557 (Why is no real title available?)
- A logical calculus of the ideas immanent in nervous activity
- Applications and Theory of Petri Nets 2004
- Block-sequential update schedules and Boolean automata circuits
- Boolean monomial dynamical systems
- Combinatorics of Boolean automata circuits dynamics
- Combinatorics on update digraphs in Boolean networks
- Comparison between parallel and serial dynamics of Boolean networks
- Complexity of Langton's ant
- Comportement périodique des fonctions à seuil binaires et applications
- Computing with truly asynchronous threshold logic networks
- Decreasing energy functions as a tool for studying threshold networks
- Discrete dynamical systems
- Disjunctive networks and update schedules
- Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
- Fixed points and maximal independent sets in AND-OR networks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Linear Finite Dynamical Systems
- Linear analysis of switching nets
- Local negative circuits and fixed points in non-expansive Boolean networks
- Necessary conditions for multistationarity in discrete dynamical systems
- Negative circuits and sustained oscillations in asynchronous automata networks
- Neural networks and physical systems with emergent collective computational abilities
- Neurons with graded response have collective computational properties like those of two-state neurons
- On limit cycles of monotone functions with symmetric connection graph
- R. Thomas' modeling of biological regulatory networks: Introduction of singular states in the qualitative dynamics
- Regulatory network for cell shape changes during \textit{Drosophila} ventral furrow formation
- The dynamics of conjunctive and disjunctive Boolean network models
Cited in
(15)- Synchronism versus asynchronism in monotonic Boolean automata networks
- Identification of biological regulatory networks from process hitting models
- Boolean networks synchronism sensitivity and XOR circulant networks convergence time
- Counting periodic points in parallel graph dynamical systems
- Algorithms for finding inverse of two patterned matrices over \(\mathbb{Z}_p\)
- On the cost of simulating a parallel Boolean automata network by a block-sequential one
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
- Finite dynamical systems, hat games, and coding theory
- Asynchronous dynamics of Boolean automata double-cycles
- Stability structures of conjunctive Boolean networks
- Equalities and inequalities for norms of block imaginary circulant operator matrices
- Norms and spread of the Fibonacci and Lucas RSFMLR circulant matrices
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding
- On the flora of asynchronous locally non-monotonic Boolean automata networks
- On the stability and instability of finite dynamical systems with prescribed interaction graphs
This page was built for publication: About non-monotony in Boolean automata networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393147)
