Fixed points and connections between positive and negative cycles in Boolean networks

DOI10.1016/j.dam.2017.12.037zbMath1387.05244arXiv1509.07702OpenAlexW2962714361MaRDI QIDQ1752437

Adrien Richard

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.07702

zbMATH Keywords

fixed pointBoolean networkinteraction graphnegative cyclepositive cycle

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Complexity of fixed point counting problems in Boolean networks ⋮ Attractor separation and signed cycles in asynchronous Boolean networks ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Positive and negative cycles in Boolean networks ⋮ Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates ⋮ A general model of binary opinions updating ⋮ Sequentialization and procedural complexity in automata networks ⋮ Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics of Boolean automata circuits dynamics
• Relations between gene regulatory networks and cell dynamics in Boolean models
• On kernels and semikernels of digraphs
• 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
• Positive circuits and maximal number of fixed points in discrete dynamical systems
• A combinatorial analogue of the Jacobian problem in automata networks
• From kernels in directed graphs to fixed points and negative cycles in Boolean networks
• A new necessary condition on interaction graphs for multistationarity
• Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
• Necessary conditions for multistationarity in discrete dynamical systems
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• Solutions of irreflexive relations
• Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits
• Asynchronous Dynamics of Boolean Automata Double-Cycles
• Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
• Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
• Network information flow
• Neural networks and physical systems with emergent collective computational abilities.
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: Fixed points and connections between positive and negative cycles in Boolean networks