pith. sign in

arxiv: 1309.3957 · v4 · pith:B4A53DT6new · submitted 2013-09-16 · 🧮 math.DS · cs.CE· q-bio.MN

Autocatalysis in Reaction Networks

classification 🧮 math.DS cs.CEq-bio.MN
keywords drainablepersistencesiphonsconjecturecriticalnetworksreactionself-replicable
0
0 comments X
read the original 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 towards 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 non-autocatalytic 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.