arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.05546math.DS
收藏

化学反应网络的独立、关联和弱可逆分解

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

Bryan S. Hernandez, Deza A. Amistas, Ralph John L. De la Cruz, Lauro L. Fontanil, Aurelio A. de los Reyes, Eduardo R. Mendoza

摘要:

化学反应网络(CRN)是以反应物或积复形为顶点,反应为弧的有向图。CRN是弱可逆的,如果它的每个连通分支是强连通的。弱可逆网络可以被认为是最重要的一类反应网络。现在,网络的化学计量子空间是反应向量的线性跨度(即,产物和反应物络合物之间的差异)。如果子网络的化学计量子空间(关联映射)的直和等于整个网络的化学计量子空间(关联映射),则CRN的分解是独立的(关联无关的)。分解可以用来研究整个系统的稳态(通过划分底层网络的反应集而产生)与其子系统的稳态之间的关系。在这项工作中,我们重新审视我们的新方法,找到独立的分解,并使用它来扩大适用性(向量)组件的稳定状态。我们还探讨了嵌入亏零独立子网络的CRN。此外,我们建立了一个方法来寻找关联独立的分解的CRN。我们确定了网络的独立和关联独立分解的所有形式,并给出了这种分解的个数。最后,对于弱可逆网络,我们确定了关联独立性是分解弱可逆性的充分条件,并且我们确定了弱可逆网络的子类,其中任何独立的分解都是弱可逆的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑