About non-monotony in Boolean automata networks
From MaRDI portal
Publication:393147
DOI10.1016/J.TCS.2012.05.034zbMATH Open1297.68179arXiv1111.4552OpenAlexW2057775364MaRDI QIDQ393147FDOQ393147
Authors: Mathilde Noual, Damien Regnault, Sylvain Sené
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1111.4552
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
Systems biology, networks (92C42) Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)
Cites Work
- Neural networks and physical systems with emergent collective computational abilities.
- Boolean monomial dynamical systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorics of Boolean automata circuits dynamics
- Disjunctive networks and update schedules
- Neurons with graded response have collective computational properties like those of two-state neurons.
- A logical calculus of the ideas immanent in nervous activity
- The dynamics of conjunctive and disjunctive Boolean network models
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Complexity of Langton's ant
- Linear Finite Dynamical Systems
- Applications and Theory of Petri Nets 2004
- Decreasing energy functions as a tool for studying threshold networks
- Fixed points and maximal independent sets in AND-OR networks
- Local negative circuits and fixed points in non-expansive Boolean networks
- Necessary conditions for multistationarity in discrete dynamical systems
- Comparison between parallel and serial dynamics of Boolean networks
- Negative circuits and sustained oscillations in asynchronous automata networks
- Comportement périodique des fonctions à seuil binaires et applications
- Computing with truly asynchronous threshold logic networks
- Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
- On limit cycles of monotone functions with symmetric connection graph
- Discrete dynamical systems
- Regulatory network for cell shape changes during \textit{Drosophila} ventral furrow formation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- R. Thomas' modeling of biological regulatory networks: Introduction of singular states in the qualitative dynamics
- Linear analysis of switching nets
- Combinatorics on update digraphs in Boolean networks
Cited In (14)
- Counting periodic points in parallel graph dynamical systems
- Algorithms for finding inverse of two patterned matrices over \(\mathbb{Z}_p\)
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
- Asynchronous Dynamics of Boolean Automata Double-Cycles
- Equalities and inequalities for norms of block imaginary circulant operator matrices
- Norms and spread of the Fibonacci and Lucas RSFMLR circulant matrices
- On the flora of asynchronous locally non-monotonic Boolean automata networks
- Finite Dynamical Systems, Hat Games, and Coding Theory
- On the stability and instability of finite dynamical systems with prescribed interaction graphs
- Synchronism versus asynchronism in monotonic Boolean automata networks
- On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One
- Stability structures of conjunctive Boolean networks
- Identification of biological regulatory networks from process hitting models
- Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding
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)