arXiv subjects

Aurelio A. de los Reyes V

Publications and source records attributed to Aurelio A. de los Reyes V.

5 recordsLinked to original sources

arXiv2026

CRITERIA: A network decomposition and elementary flux mode translation-based tool for computing equilibria of biochemical systems

Understanding how biochemical systems settle into stable states, such as how protein concentrations reach equilibrium, is central to explaining cellular behavior and designing synthetic biological circuits. However, existing analytical tools for computing these equilibria, such as COMPILES, are limited by computational bottlenecks and can only be applied to a restricted class of reaction networks. In this work, we introduce CRITERIA (Computing paRametrized posITive EquilibRIA), a new computational framework that makes equilibrium analysis more efficient and broadly applicable. CRITERIA uses a graph-based approach built on elementary flux modes to streamline key steps in the computation. It also changes how the problem is solved by combining subnetworks into a single system before computing equilibria, which avoids complicated symbolic calculations required in previous methods. We demonstrate the usefulness of CRITERIA by studying biologically important systems, including the EnvZ-OmpR signaling pathway and a synthetic CRISPRi circuit. Our approach enables faster and more scalable analysis, allowing researchers to better understand how complex biochemical networks behave over time.

math.DS↗

arXiv2021

Independent, Incidence Independent and Weakly Reversible Decompositions of Chemical Reaction Networks

Chemical reaction networks (CRNs) are directed graphs with reactant or product complexes as vertices, and reactions as arcs. A CRN is weakly reversible if each of its connected components is strongly connected. Weakly reversible networks can be considered as the most important class of reaction networks. Now, the stoichiometric subspace of a network is the linear span of the reaction vectors (i.e., difference between the product and the reactant complexes). A decomposition of a CRN is independent (incidence independent) if the direct sum of the stoichiometric subspaces (incidence maps) of the subnetworks equals the stoichiometric subspace (incidence map) of the whole network. Decompositions can be used to study relationships between steady states of the whole system (induced from partitioning the reaction set of the underlying network) and those of its subsystems. In this work, we revisit our novel method of finding independent decomposition, and use it to expand applicability on (vector) components of steady states. We also explore CRNs with embedded deficiency zero independent subnetworks. In addition, we establish a method for finding incidence independent decomposition of a CRN. We determine all the forms of independent and incidence independent decompositions of a network, and provide the number of such decompositions. Lastly, for weakly reversible networks, we determine that incidence independence is a sufficient condition for weak reversibility of a decomposition, and we identify subclasses of weakly reversible networks where any independent decomposition is weakly reversible.

math.DS↗

arXiv2020

A Computational Approach to Multistationarity in Poly-PL Kinetic Systems

One important question that interests those who work in chemical reaction network theory (CRNT) is this: Does the system obtained from a reaction network admit a positive equilibrium and if it does, can there be more than one within a stoichiometric class? The higher deficiency algorithm (HDA) of Ji and Feinberg provided a method of determining the multistationarity capacity of a CRN with mass action kinetics (MAK). An extension of this, called Multistationarity Algorithm (MSA), recently came into the scene tackling CRNs with power law kinetics (PLK), a kinetic system which is more general (having MAK systems as a special case). For this paper, we provide a computational approach to study the multistationarity feature of reaction networks endowed with kinetics which are non-negative linear combinations of power law functions called poly-PL kinetics (PYK). The idea is to use MSA and combine it with a transformation called STAR-MSC (i.e., $S$-invariant Termwise Addition of Reactions via Maximal Stoichiometric Coefficients) producing PLKs that are dynamically equivalent to PYKs. This leads us to being able to determinine the multistationarity capacity of a much larger class of kinetic systems. We show that if the transformed dynamically equivalent PLK system is multistationary for a stoichiometric class for a set of particular rate constants, then so is its original corresponding PYK system. Moreover, the monostationarity property of the transformed PLK system also implies the monostationarity property of the original PYK system.

math.DS↗

arXiv2020

Fundamental Decompositions and Multistationarity of Power-Law Kinetic Systems

The fundamental decomposition of a chemical reaction network (also called its "$\mathscr{F}$-decomposition") is the set of subnetworks generated by the partition of its set of reactions into the "fundamental classes" introduced by Ji and Feinberg in 2011 as the basis of their "higher deficiency algorithm" for mass action systems. The first part of this paper studies the properties of the $\mathscr{F}$-decomposition, in particular, its independence (i.e., the network's stoichiometric subspace is the direct sum of the subnetworks' stoichiometric subspaces) and its incidence-independence (i.e., the image of the network's incidence map is the direct sum of the incidence maps' images of the subnetworks). We derive necessary and sufficient conditions for these properties and identify network classes where the $\mathscr{F}$-decomposition coincides with other known decompositions. The second part of the paper applies the above-mentioned results to improve the Multistationarity Algorithm for power-law kinetic systems (MSA), a general computational approach that we introduced in previous work. We show that for systems with non-reactant determined interactions but with an independent $\mathscr{F}$-decomposition, the transformation to a dynamically equivalent system with reactant-determined interactions -- required in the original MSA -- is not necessary. We illustrate this improvement with the subnetwork of Schmitz's carbon cycle model recently analyzed by Fortun et al.

math.DS↗

arXiv2020

A Computational Approach to Multistationarity of Power-Law Kinetic Systems

This paper presents a computational solution to determine if a chemical reaction network endowed with power-law kinetics (PLK system) has the capacity for multistationarity, i.e., whether there exist positive rate constants such that the corresponding differential equations admit multiple positive steady states within a stoichiometric class. The approach, which is called the "Multistationarity Algorithm for PLK systems" (MSA), combines (i) the extension of the "higher deficiency algorithm" of Ji and Feinberg for mass action to PLK systems with reactant-determined interactions, and (ii) a method that transforms any PLK system to a dynamically equivalent one with reactant-determined interactions. Using this algorithm, we obtain two new results: the monostationarity of a popular model of anaerobic yeast fermentation pathway, and the multistationarity of a global carbon cycle model with climate engineering, both in the generalized mass action format of biochemical systems theory. We also provide examples of the broader scope of our approach for deficiency one PLK systems in comparison to the extension of Feinberg's "deficiency one algorithm" to such systems.

math.DS↗