Laboratory for Control, Learning, and Systems Biology

biological networks

2026
  1. ▪M.A. Al-Radhawi, D. Angeli, E.D. Sontag, "On structural contraction of biological interaction networks", SIAM J Applied Dynamical Systems, vol. 25, pp. 1939–1980, 2026. pdf
    Abstract

    Biological networks are customarily described as structurally robust. This means that they often function extremely well under large forms of perturbations affecting both the concentrations and the kinetic parameters. In order to explain this property, various mathematical notions have been proposed in the literature. In this paper, we propose the notion of structural contractivity, building on the previous work of the authors. That previous work characterized the long-term dynamics of classes of biological interaction networks, based on ``rate-dependent Lyapunov functions."" Here, we show that stronger notions of convergence can be established by proving structural contractivity with respect to nonstandard polyhedral ℓ ∞ -norms. In particular, we show that such networks are nonexpansive. With additional verifiable conditions, we show that they are strictly contractive over arbitrary positive compact sets. In addition, we show that such networks entrain to periodic inputs. We illustrate our theory with examples drawn from the modeling of intracellular signaling pathways.

  2. ▪E.D. Sontag, "Global stability of Michaelis-Menten networks", arXiv 2610.24351, 2026. wwwpdf
    Abstract

    In a very nice paper, Blanchini, Breda, Giordano and Liessi studied networks of species coupled through Michaelis–Menten interactions. Under standard assumptions of strong connectedness and non-degeneracy, they show that there is a unique equilibrium, which is (locally) asymptotically stable. This note shows that global stability, which was stated there as an open problem, holds as well. In fact, whenever a positive equilibrium exists, it attracts every solution with positive initial condition, with no connectedness or non-degeneracy hypothesis at all; those assumptions are needed only in order to guarantee existence and to cover solutions starting on the boundary of the orthant. The key is to note that the system is contractive with respect to the Thompson part metric.

  3. ▪E.D. Sontag, "Dynamic response phenotypes and model discrimination in systems and synthetic biology", IEEE Control Systems Magazine, 2026. doipdf
    To appear. Preprint in arXiv 2512.24945
    Abstract

    Biological systems encode function not primarily in steady states, but in the structure of transient responses elicited by time-varying stimuli. Overshoots, biphasic dynamics, adaptation kinetics, fold-change detection, entrainment, and cumulative exposure effects often determine phenotypic outcomes, yet are poorly captured by classical steady-state or dose-response analyses. This paper develops an input-output perspective on such "dynamic phenotypes," emphasizing how qualitative features of transient behavior constrain underlying network architectures independently of detailed parameter values. A central theme is the role of sign structure and interconnection logic, particularly the contrast between monotone systems and architectures containing antagonistic pathways. We show how incoherent feedforward (IFF) motifs provide a simple and recurrent mechanism for generating non-monotonic and adaptive responses across multiple levels of biological organization, from molecular signaling to immune regulation and population dynamics. Conversely, monotonicity imposes sharp impossibility results that can be used to falsify entire classes of models from transient data alone. Beyond step inputs, we highlight how periodic forcing, ramps, and integral-type readouts such as cumulative dose responses offer powerful experimental probes that reveal otherwise hidden structure, separate competing motifs, and expose invariances such as fold-change detection. Throughout, we illustrate how control-theoretic concepts, including monotonicity, equivariance, and input-output analysis, can be used not as engineering metaphors, but as precise mathematical tools for biological model discrimination. Thus we argue for a shift in emphasis from asymptotic behavior to transient and input-driven dynamics as a primary lens for understanding, testing, and reverse-engineering biological networks.

2024
  1. ▪S. Wang, M.A. Al-Radhawi, D.A. Lauffenburger, E.D. Sontag, "Recovering biomolecular network dynamics from single-cell omics data requires three time points.", npj Systems Biology and Applications, vol. 10, pp. 97-, 2024. pdf
    Abstract

    Single-cell omics technologies can measure millions of cells for up to thousands of biomolecular features, which enables the data-driven study of highly complex biological networks. However, these high-throughput experimental techniques often cannot track individual cells over time, thus complicating the understanding of dynamics such as the time trajectories of cell states. These ``dynamical phenotypes'' are key to understanding biological phenomena such as differentiation fates. We show by mathematical analysis that, in spite of high-dimensionality and lack of individual cell traces, three timepoints of single-cell omics data are theoretically necessary and sufficient in order to uniquely determine the network interaction matrix and associated dynamics. Moreover, we show through numerical simulations that an interaction matrix can be accurately determined with three or more timepoints even in the presence of sampling and measurement noise typical of single-cell omics. Our results can guide the design of single-cell omics time-course experiments, and provide a tool for data-driven phase-space analysis.

2018
  1. ▪F. Blanchini, H. El-Samad, G. Giordano, E. D. Sontag, "Control-theoretic methods for biological networks", In Proc. 2018 IEEE Conf. Decision and Control, pp. 466-483, 2018. pdf
    Abstract

    This is a tutorial paper on control-theoretic methods for the analysis of biological systems.

2016
  1. ▪J.A. Ascensao, P. Datta, B. Hancioglu, E.D. Sontag, M.L. Gennaro, O.A. Igoshin, "Non-monotonic response dynamics of glyoxylate shunt genes in Mycobacterium tuberculosis", PLoS Computational Biology, vol. 12, pp. e1004741, 2016. pdf
    Abstract

    Understanding how dynamical responses of biological networks are constrained by underlying network topology is one of the fundamental goals of systems biology. Here we employ monotone systems theory to formulate a theorem stating necessary conditions for non-monotonic time-response of a biochemical network to a monotonic stimulus. We apply this theorem to analyze the non-monotonic dynamics of the sigmaB-regulated glyoxylate shunt gene expression in Mycobacterium tuberculosis cells exposed to hypoxia. We first demonstrate that the known network structure is inconsistent with observed dynamics. To resolve this inconsistency we employ the formulated theorem, modeling simulations and optimization along with follow-up dynamic experimental measurements. We show a requirement for post-translational modulation of sigmaB activity in order to reconcile the network dynamics with its topology. The results of this analysis make testable experimental predictions and demonstrate wider applicability of the developed methodology to a wide class of biological systems.

2015
  1. ▪T. Kang, R. Moore, Y. Li, E.D. Sontag, L. Bleris, "Discriminating direct and indirect connectivities in biological networks", Proc Natl Acad Sci USA, vol. 112, pp. 12893-12898, 2015. pdf
    Abstract

    Reverse engineering of biological pathways involves an iterative process between experiments, data processing, and theoretical analysis. In this work, we engineer synthetic circuits, subject them to perturbations, and then infer network connections using a combination of nonparametric single-cell data resampling and modular response analysis. Intriguingly, we discover that recovered weights of specific network edges undergo divergent shifts under differential perturbations, and that the particular behavior is markedly different between different topologies. Investigating topological changes under differential perturbations may address the longstanding problem of discriminating direct and indirect connectivities in biological networks.

2011
  1. ▪L. Bleris, Z. Xie, D. Glass, A. Adadey, E.D. Sontag, Y. Benenson, "Synthetic incoherent feed-forward circuits show adaptation to the amount of their genetic template", Molecular Systems Biology, vol. 7, pp. 519-, 2011. pdf
    Abstract

    Natural and synthetic biological networks must function reliably in the face of fluctuating stoichiometry of their molecular components. These fluctuations are caused in part by changes in relative expression efficiency and the DNA template amount of the network-coding genes. Gene product levels could potentially be decoupled from these changes via built-in adaptation mechanisms, thereby boosting network reliability. Here we show that a mechanism based on an incoherent feed-forward motif enables adaptive gene expression in mammalian cells. We modeled, synthesized, and tested transcriptional and post-transcriptional incoherent loops and found that in all cases the gene product adapts to changes in DNA template abundance. We also observed that the post-transcriptional form results in superior adaptation behavior, higher absolute expression levels, and lower intrinsic fluctuations. Our results support a previously-hypothesized endogenous role in gene dosage compensation for such motifs and suggest that their incorporation in synthetic networks will improve their robustness and reliability.

2008
  1. ▪E.D. Sontag, A. Veliz-Cuba, R. Laubenbacher, A.S. Jarrah, "The effect of negative feedback loops on the dynamics of Boolean networks", Biophysical Journal, vol. 95, pp. 518-526, 2008. pdf
    Abstract

    Feedback loops play an important role in determining the dynamics of biological networks. In order to study the role of negative feedback loops, this paper introduces the notion of "distance to positive feedback (PF-distance)" which in essence captures the number of "independent" negative feedback loops in the network, a property inherent in the network topology. Through a computational study using Boolean networks it is shown that PF-distance has a strong influence on network dynamics and correlates very well with the number and length of limit cycles in the phase space of the network. To be precise, it is shown that, as the number of independent negative feedback loops increases, the number (length) of limit cycles tends to decrease (increase). These conclusions are consistent with the fact that certain natural biological networks exhibit generally regular behavior and have fewer negative feedback loops than randomized networks with the same numbers of nodes and connectivity.

2007
  1. ▪B. DasGupta, G.A. Enciso, E.D. Sontag, Y. Zhang, "Algorithmic and complexity aspects of decompositions of biological networks into monotone subsystems", BioSystems, vol. 90, pp. 161-178, 2007. pdf
    Abstract

    A useful approach to the mathematical analysis of large-scale biological networks is based upon their decompositions into monotone dynamical systems. This paper deals with two computational problems associated to finding decompositions which are optimal in an appropriate sense. In graph-theoretic language, the problems can be recast in terms of maximal sign-consistent subgraphs. The theoretical results include polynomial-time approximation algorithms as well as constant-ratio inapproximability results. One of the algorithms, which has a worst-case guarantee of 87.9% from optimality, is based on the semidefinite programming relaxation approach of Goemans-Williamson. The algorithm was implemented and tested on a Drosophila segmentation network and an Epidermal Growth Factor Receptor pathway model.

2006
  1. ▪B. Dasgupta, G.A. Enciso, E.D. Sontag, Y. Zhang, "Algorithmic and complexity results for decompositions of biological networks into monotone subsystems", In Lecture Notes in Computer Science: Experimental Algorithms: 5th International Workshop, WEA 2006, pp. 253–264, 2006.
    (Cala Galdana, Menorca, Spain, May 24-27, 2006)
  2. ▪B. Dasgupta, P. Berman, E.D. Sontag, "Computational complexities of combinatorial problems with applications to reverse engineering of biological networks", In Advances in Computational Intelligence: Theory & Applications, pp. 303–316, 2006.