SearcharxivSearch

arXiv · 2108.05546

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

Abstract

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Bryan S. Hernandez, Deza A. Amistas, Ralph John L. De la Cruz, Lauro L. Fontanil, Aurelio A. de los Reyes V, Eduardo R. Mendoza. 2021-08-12. Independent, Incidence Independent and Weakly Reversible Decompositions of Chemical Reaction Networks. https://arxiv.org/abs/2108.05546

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

KEEP EXPLORING

Related papers

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS