| Literature DB >> 25245394 |
Abhishek Deshpande1, Manoj Gopalkrishnan.
Abstract
The persistence conjecture is a long-standing open problem in chemical reaction network theory. It concerns the behavior of solutions to coupled ODE systems that arise from applying mass-action kinetics to a network of chemical reactions. The idea is that if all reactions are reversible in a weak sense, then no species can go extinct. A notion that has been found useful in thinking about persistence is that of "critical siphon." We explore the combinatorics of critical siphons, with a view toward the persistence conjecture. We introduce the notions of "drainable" and "self-replicable" (or autocatalytic) siphons. We show that: Every minimal critical siphon is either drainable or self-replicable; reaction networks without drainable siphons are persistent; and nonautocatalytic weakly reversible networks are persistent. Our results clarify that the difficulties in proving the persistence conjecture are essentially due to competition between drainable and self-replicable siphons.Mesh:
Year: 2014 PMID: 25245394 DOI: 10.1007/s11538-014-0024-x
Source DB: PubMed Journal: Bull Math Biol ISSN: 0092-8240 Impact factor: 1.758