We present new applications of parity inversion and time reversal to the emergence of complex behavior from simple dynamical rules in stochastic discrete models. Our parity-based encoding of causal relationships and time-reversal construction efficiently reveal discrete analogs of stable and unstable manifolds. We demonstrate their predictive power by studying decision-making in systems biology and statistical physics models. These applications underpin a novel attractor identification algorithm implemented for Boolean networks under stochastic dynamics. Its speed enables resolving a long-standing open question of how attractor count in critical random Boolean networks scales with network size and whether the scaling matches biological observations. Via 80-fold improvement in probed network size (N = 16,384), we find the unexpectedly low scaling exponent of 0.12 ± 0.05, approximately one-tenth the analytical upper bound. We demonstrate a general principle: A system’s relationship to its time reversal and state-space inversion constrains its repertoire of emergent behaviors.

We present a technique applicable in any dynamical framework to identify control-robust subsets of an interacting system. These robust subsystems, which we call stable modules, are characterized by constraints on the variables that make up the subsystem. They are robust in the sense that if the defining constraints are satisfied at a given time, they remain satisfied for all later times, regardless of what happens in the rest of the system, and can only be broken if the constrained variables are externally manipulated. We identify stable modules as graph structures in an expanded network, which represents causal links between variable constraints. A stable module represents a system “decision point”, or trap subspace. Using the expanded network, small stable modules can be composed sequentially to form larger stable modules that describe dynamics on the system level. Collections of large, mutually exclusive stable modules describe the system’s repertoire of long-term behaviors. We implement this technique in a broad class of dynamical systems and illustrate its practical utility via examples and algorithmic analysis of two published biological network models. In the segment polarity gene network of Drosophila melanogaster, we obtain a state-space visualization that reproduces by novel means the four possible cell fates and predicts the outcome of cell transplant experiments. In the T-cell signaling network, we identify six signaling elements that determine the high-signal response and show that control of an element connected to them cannot disrupt this response.

Summary pystablemotifs is a Python 3 library for analyzing Boolean networks. Its non-heuristic and exhaustive attractor identification algorithm was previously presented in (Rozum et al. 2021). Here, we illustrate its performance improvements over similar methods and discuss how it uses outputs of the attractor identification process to drive a system to one of its attractors from any initial state. We implement six attractor control algorithms, five of which are new in this work. By design, these algorithms can return different control strategies, allowing for synergistic use. We also give a brief overview of the other tools implemented in pystablemotifs. Availability The source code is on GitHub at https://github.com/jcrozum/pystablemotifs/. Supplementary information Supplementary data are available at Bioinformatics online.

We perform logic-based network analysis on a model of the mammalian cell cycle. This model is composed of a Restriction Switch driving cell cycle commitment and a Phase Switch driving mitotic entry and exit. By generalizing the concept of stable motif, i.e., a self-sustaining positive feedback loop that maintains an associated state, we introduce the concept of a conditionally stable motif, the stability of which is contingent on external conditions. We show that the stable motifs of the Phase Switch are contingent on the state of three nodes through which it receives input from the rest of the network. Biologically, these conditions correspond to cell cycle checkpoints. Holding these nodes locked (akin to a checkpoint-free cell) transforms the Phase Switch into an autonomous oscillator that robustly toggles through the cell cycle phases G1, G2 and mitosis. The conditionally stable motifs of the Phase Switch Oscillator are organized into an ordered sequence, such that they serially stabilize each other but also cause their own destabilization. Along the way they channel the dynamics of the module onto a narrow path in state space, lending robustness to the oscillation. Self-destabilizing conditionally stable motifs suggest a general negative feedback mechanism leading to sustained oscillations.

No abstract