Topological fixed points in Boolean networks

DOI10.1016/j.crma.2010.07.014zbMath1194.94209OpenAlexW2039869737MaRDI QIDQ990227

Adrien Richard, Loïc Paulevé

Publication date: 6 September 2010

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2010.07.014

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Fixed-point and coincidence theorems (topological aspects) (54H25) Analytic circuit theory (94C05)

Related Items (4)

Complexity of fixed point counting problems in Boolean networks ⋮ Simple dynamics on graphs ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey

Cites Work

• Maximum number of fixed points in regulatory Boolean networks
• Unnamed Item

This page was built for publication: Topological fixed points in Boolean networks