Searcharxiv⌕ Search

arXiv · 2610.18087

Computational framework NetBiF predicts and classifies steady-state bifurcations in biochemical systems via reaction network structure

Abstract

Dynamics of biochemical systems are dictated by the stoichiometry and kinetics of reaction networks. These systems may admit positive steady states that could undergo qualitative change in response to varying rate parameters. These changes are called steady-state bifurcations, and they correspond to biologically meaningful processes. Classical bifurcation analysis relies on exact kinetics and rate parameters, which are often unknown or difficult to measure for complex systems. To address this, structural bifurcation analysis (SBA) was introduced to predict bifurcations using only the system's associated reaction network. In this work, the computational package NetBiF (Network Bifurcation Finder) is introduced to implement SBA. NetBiF is applied across diverse biochemical systems, including fundamental metabolic pathways, signaling and gene regulatory networks, and a large-scale carbon cycle model, to predict steady-state bifurcations. Crucially, for biochemical systems governed by power law kinetics, the implementation of NetBiF also classifies the steady-state bifurcations as saddle-node, transcritical, or pitchfork via a structural analog of Sotomayor's theorem. To this end, explicit formulations for the bifurcation criteria were derived for these biochemical systems. Determining and classifying bifurcation behaviors provide insight into biochemical systems' abilities to adapt to changing and fluctuating conditions. Collectively, the study presents NetBiF as a scalable, structure-based, and consistent computational tool to implement SBA. Our findings enable researchers to systematically study dynamical behaviors of biochemical systems through their reaction network structures without requiring explicit kinetic information.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Al Jay Lan J. Alamin, Bryan S. Hernandez. 2026-10-13. Computational framework NetBiF predicts and classifies steady-state bifurcations in biochemical systems via reaction network structure. https://arxiv.org/abs/2610.18087

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

When is a System Discoverable from Data? Discovery Requires Chaos

The deep learning revolution has enabled major AI advances in physical sciences, particularly in discovering dynamical systems from observational data. Yet the reliability of learned surrogates and symbolically discovered models is often undermined by non-uniqueness: models may fit observed trajectories perfectly, but lack genuine predictive power. We show that chaos, despite its association with unpredictability, is often what makes governing equations discoverable. We prove that the classical Lorenz system is analytically discoverable and verify experimentally that for many systems out-of-domain generalization emerges precisely at chaos onset. Conservative systems, by contrast, are inherently non-discoverable from data alone. The prevalence of chaotic systems in benchmarks may have inadvertently obscured this limitation. These findings help explain why AI excels at weather forecasting, yet struggles in many engineering applications: the systems most amenable to discovery (chaotic ones) are often least amenable to control.

math.DS↗

Foliations and minimality for twist maps

In this paper we consider area-preserving twist maps $f:\mathbf{T}^2\to\mathbf{T}^2$ with vertical rotation sets reduced to a single irrational number $α$. Our first result states that under these hypotheses, there exists a unique $f$-invariant foliation $\mathcal{F}_G=\{\operatorname{Graph}(ϕ_t)\}_{t\in\mathbf{T}^1}$, where each function $ϕ_t:\mathbf{T}^1\to\mathbf{T}^1$ is $K$-Lipschitz for some constant $K=K(f)$. Moreover, we also prove that if $\mathcal{F}_G$ is a Lipschitz foliation, then $f$ is minimal.

math.DS↗

Uniqueness of Limit Cycles for Abel Equations and Planar Systems

We study positive limit cycles of the Abel equation $$\dot{x}=A(t)x^{3}+B(t)x^{2},$$ where $A$ and $B$ are $2π$-periodic functions. By developing a half-period convexity method, we establish a new criterion ensuring that the equation has at most one positive limit cycle. Moreover, if such a limit cycle exists, it is hyperbolic. As applications, we consider two classes of planar polynomial systems that can be reduced to Abel equations. For a subfamily of cubic rigid systems, we prove that there is at most one limit cycle, thereby giving a partial answer to the first problem in Gasull's list of 33 open problems. For quadratic systems, we derive a new uniqueness criterion for limit cycles surrounding the origin and provide explicit parameter regions under which the criterion is satisfied.

math.DS↗