Abstract
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 are equivalent to one another and, thus, necessary and sufficient for persistence. Furthermore, they can also be characterized by easily checkable strong connectivity properties of the underlying 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 the aforementioned sufficient conditions for persistence preclude the existence of boundary steady states, our method also provides a graphical tool to check for that.
| Originalsprog | Engelsk |
|---|---|
| Tidsskrift | Journal of Mathematical Biology |
| Vol/bind | 74 |
| Udgave nummer | 4 |
| Sider (fra-til) | 887–932 |
| ISSN | 0303-6812 |
| DOI | |
| Status | Udgivet - 1 mar. 2017 |
Emneord
- math.DS
- q-bio.MN