Marcondes de Freitas Michael, Feliu Elisenda, Wiuf Carsten
Department of Mathematical Sciences, University of Copenhagen, Copenhagen, Denmark.
J Math Biol. 2017 Mar;74(4):887-932. doi: 10.1007/s00285-016-1046-9. Epub 2016 Aug 1.
For dynamical systems arising from chemical reaction networks, persistence is the property that each species concentration remains positively bounded away from zero, as long as species concentrations were all positive in the beginning. We describe two graphical procedures for simplifying reaction networks without breaking known necessary or sufficient conditions for persistence, by iteratively removing so-called intermediates and catalysts from the network. The procedures are easy to apply and, in many cases, lead to highly simplified network structures, such as monomolecular networks. For specific classes of reaction networks, we show that these conditions for persistence are equivalent to one another. Furthermore, they can also be characterized by easily checkable strong connectivity properties of a related graph. In particular, this is the case for (conservative) monomolecular networks, as well as cascades of a large class of post-translational modification systems (of which the MAPK cascade and the n-site futile cycle are prominent examples). Since one of the aforementioned sufficient conditions for persistence precludes the existence of boundary steady states, our method also provides a graphical tool to check for that.
对于由化学反应网络产生的动力系统,持久性是指只要物种浓度在初始时均为正,那么每个物种的浓度就保持为正且远离零。我们描述了两种图形化方法,通过从网络中迭代去除所谓的中间体和催化剂,在不破坏已知的持久性必要或充分条件的情况下简化反应网络。这些方法易于应用,并且在许多情况下会导致高度简化的网络结构,例如单分子网络。对于特定类别的反应网络,我们表明这些持久性条件彼此等价。此外,它们还可以通过相关图的易于检查的强连通性属性来表征。特别是对于(保守的)单分子网络以及一大类翻译后修饰系统的级联(其中丝裂原活化蛋白激酶级联和n位点无效循环是突出的例子)就是这种情况。由于上述持久性的充分条件之一排除了边界稳态的存在,我们的方法还提供了一种图形工具来检查这一点。