Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
Adrien Richard

TL;DR
This paper characterizes fixed points in Boolean networks through forbidden subnetworks, extending existing theorems and providing a detailed classification based on network interaction graphs and subnetwork properties.
Contribution
It introduces a new characterization of Boolean networks with unique fixed points using forbidden subnetworks, generalizing previous fixed point theorems and classifying non-expansive networks.
Findings
Networks with no directed cycles in Jacobian graphs have unique fixed points
Non-expansive networks are exactly those with interaction graphs in ^+ ^-
Subnetwork fixed point properties are characterized by absence of certain forbidden subnetworks
Abstract
We are interested in fixed points in Boolean networks, {\em i.e.} functions from to itself. We define the subnetworks of as the restrictions of to the subcubes of , and we characterizes a class of Boolean networks satisfying the following property: Every subnetwork of has a unique fixed point if and only if has no subnetwork in . This characterization generalizes the fixed point theorem of Shih and Dong, which asserts that if for every in there is no directed cycle in the directed graph whose the adjacency matrix is the discrete Jacobian matrix of evaluated at point , then has a unique fixed point. Then, denoting by (resp. ) the networks whose the interaction graph is a positive (resp. negative) cycle, we show that the non-expansive networks of …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGene Regulatory Network Analysis · Protein Structure and Dynamics · Neural dynamics and brain function
