Stability analysis for non-weakly reversible single linkage class chemical reaction networks with arbitrary time delays

Komatsu, Hirokazu; Nakajima, Hiroyuki

doi:10.1109/cdc42340.2020.9304119

Cited by 2 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Komatsu and Nakajima [27] provided an algorithm for finding a weakly reversible decomposition of a CRN. On the other hand, Hernandez and Mendoza [21] established an algorithm for finding a weakly reversible decomposition of a non-complex factorizable (NF) chemical kinetic system, that considers both the underlying CRN and kinetics, into weakly reversible complex factorizable (CF) subsystems.…”

Section: Number Of Independent and Incidence Independent Decompositions Of A Reaction Networkmentioning

confidence: 99%

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

Hernandez¹,

Amistas²,

Cruz³

et al. 2021

match

View full text Add to dashboard Cite

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 positive 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.

show abstract

Section: Number Of Independent and Incidence Independent Decompositions Of A Reaction Networkmentioning

confidence: 99%