A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
From MaRDI portal
Publication:424186
DOI10.1007/s10910-011-9911-7zbMath1238.92077arXiv1107.1659MaRDI QIDQ424186
David Siegel, Matthew D. Johnston, Gábor Szederkényi
Publication date: 31 May 2012
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1659
65C20: Probabilistic models, generic numerical methods in probability and statistics
90C90: Applications of mathematical programming
90C11: Mixed integer programming
90C05: Linear programming
92E20: Classical flows, reactions, etc. in chemistry
Related Items
An Efficient Characterization of Complex-Balanced, Detailed-Balanced, and Weakly Reversible Systems, First-order chemical reaction networks. I: Theoretical considerations, A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem, Linear conjugacy in biochemical reaction networks with rational reaction rates, A computational approach to extinction events in chemical reaction networks with discrete state spaces, A computational approach to steady state correspondence of regular and generalized mass action systems, A computational approach to persistence, permanence, and endotacticity of biochemical reaction systems, A computational approach to linear conjugacy in a class of power law kinetic systems, Conditions for extinction events in chemical reaction networks with discrete state spaces, Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks, Linear conjugacy of chemical kinetic systems, Realizations of kinetic differential equations, Analysis of mass-action systems by split network translation, Dynamical properties of discrete reaction networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear conjugacy of chemical reaction networks
- Toric dynamical systems
- Comment on ``Identifiability of chemical reaction networks by G. Craciun and C. Pantea
- Computing sparse and dense realizations of reaction kinetic systems
- Identifiability of chemical reaction networks
- On finding the strongly connected components in a directed graph
- A family of sparse polynomial systems arising in chemical reaction systems
- Concordant chemical reaction networks
- A Petri net approach to the study of persistence in chemical reaction networks
- The mathematical structure of chemical kinetics in homogeneous single- phase systems
- The Dynamics of Weakly Reversible Population Processes near Facets
- Convergence in Strongly Monotone Systems with an Increasing First Integral
- Global Asymptotic Stability for a Class of Nonlinear Chemical Equations
- Monotonicity in chemical reaction systems
- Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction
- Understanding bistability in complex enzyme-driven reaction networks
- Persistence and Permanence of Mass-Action and Power-Law Dynamical Systems
- Multiple Equilibria in Complex Chemical Reaction Networks: I. The Injectivity Property
- Multiple Equilibria in Complex Chemical Reaction Networks: II. The Species-Reaction Graph
