Autocatalysis in reaction networks
From MaRDI portal
Publication:486624
DOI10.1007/S11538-014-0024-XzbMATH Open1330.92139arXiv1309.3957OpenAlexW2059398978WikidataQ46835359 ScholiaQ46835359MaRDI QIDQ486624FDOQ486624
Authors: Abhishek Deshpande, Manoj Gopalkrishnan 
Publication date: 16 January 2015
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1309.3957
Recommendations
- On the persistence and global stability of mass-action systems
- Intermediates, catalysts, persistence, and boundary steady states
- A Petri net approach to the study of persistence in chemical reaction networks
- Catalysis in reaction networks
- Reachability, persistence, and constructive chemical reaction networks. I: Reachability approach to the persistence of chemical reaction networks
Cites Work
- Title not available (Why is that?)
- A Petri net approach to the study of persistence in chemical reaction networks
- Strand Algebras for DNA Computing
- Siphons in chemical reaction networks
- Computation with finite stochastic chemical reaction networks
- Deterministic Function Computation with Chemical Reaction Networks
- The emergence of a self-catalysing structure in abstract origin-of-life models
- Detecting autocatalytic, self-sustaining sets in chemical reaction systems
- Predicting template-based catalysis rates in a simple catalytic reaction model
- Random biochemical networks: the probability of self-sustaining autocatalysis
- Global Asymptotic Stability for a Class of Nonlinear Chemical Equations
- Persistence and permanence of mass-action and power-law dynamical systems
- Local and global stability of equilibria for a class of chemical reaction networks
- On the persistence and global stability of mass-action systems
- A proof of the global attractor conjecture in the single linkage class case
- A geometric approach to the global attractor conjecture
- A projection argument for differential inclusions, with applications to persistence of mass-action kinetics
- Biochemical systems theory and metabolic control theory: I. Fundamental similarities and differences
- The dynamics of weakly reversible population processes near facets
- Catalysis in reaction networks
- Reachability, persistence, and constructive chemical reaction networks. I: Reachability approach to the persistence of chemical reaction networks
- Advances in Petri nets 1989. 9th European workshop on applications and theory of Petri nets, Venice, Italy in June 1988. Proceedings
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Endotactic Networks and Toric Differential Inclusions
- Title not available (Why is that?)
- Autocatalytic reaction dynamics in systems crowded by catalytic obstacles
- Siphons in chemical reaction networks
- Catalysis in reaction networks
- Endotactic and strongly endotactic networks with infinitely many positive steady states
- Source-Only Realizations, Weakly Reversible Deficiency One Networks, and Dynamical Equivalence
- Reachability, persistence, and constructive chemical reaction networks. I: Reachability approach to the persistence of chemical reaction networks
- Autocatalytic confusion clarified
- Reachability, persistence, and constructive chemical reaction networks. II: A formalism for species composition in chemical reaction network theory and application to persistence
- Autocatalytic sets in polymer networks with variable catalysis distributions
- Weakly reversible single linkage class realizations of polynomial dynamical systems: an algorithmic perspective
- A Petri net approach to the study of persistence in chemical reaction networks
- Title not available (Why is that?)
- Dynamics of small autocatalytic reaction networks. II: Replication, mutation and catalysis
- Polyhedral geometry and combinatorics of an autocatalytic ecosystem
- Autocatalytic recombination systems: a reaction network perspective
- Intermediates, catalysts, persistence, and boundary steady states
- Computational Complexity of Atomic Chemical Reaction Networks
- Reachability, persistence, and constructive chemical reaction networks. III: A mathematical formalism for binary enzymatic networks and application to persistence
This page was built for publication: Autocatalysis in reaction networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486624)
