A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
From MaRDI portal
Publication:424186
DOI10.1007/S10910-011-9911-7zbMATH Open1238.92077arXiv1107.1659OpenAlexW2045275095MaRDI QIDQ424186FDOQ424186
Authors: Matthew D. Johnston, David Siegel, Gábor Szederkényi 
Publication date: 31 May 2012
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Abstract: A numerically effective procedure for determining weakly reversible chemical reaction networks that are linearly conjugate to a known reaction network is proposed in this paper. The method is based on translating the structural and algebraic characteristics of weak reversibility to logical statements and solving the obtained set of linear (in)equalities in the framework of mixed integer linear programming. The unknowns in the problem are the reaction rate coefficients and the parameters of the linear conjugacy transformation. The efficacy of the approach is shown through numerical examples.
Full work available at URL: https://arxiv.org/abs/1107.1659
Recommendations
- Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- Dynamical equivalence and linear conjugacy of chemical reaction networks: new results and methods
- Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory
- A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem
Linear programming (90C05) Applications of mathematical programming (90C90) Probabilistic models, generic numerical methods in probability and statistics (65C20) Mixed integer programming (90C11) Classical flows, reactions, etc. in chemistry (92E20)
Cites Work
- A Petri net approach to the study of persistence in chemical reaction networks
- Title not available (Why is that?)
- Multiple Equilibria in Complex Chemical Reaction Networks: I. The Injectivity Property
- On finding the strongly connected components in a directed graph
- Title not available (Why is that?)
- Understanding bistability in complex enzyme-driven reaction networks
- Multiple Equilibria in Complex Chemical Reaction Networks: II. The Species-Reaction Graph
- Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction
- Toric dynamical systems
- Global Asymptotic Stability for a Class of Nonlinear Chemical Equations
- Persistence and permanence of mass-action and power-law dynamical systems
- A family of sparse polynomial systems arising in chemical reaction systems
- Linear conjugacy of chemical reaction networks
- Computing sparse and dense realizations of reaction kinetic systems
- Identifiability of chemical reaction networks
- Title not available (Why is that?)
- Concordant chemical reaction networks
- Monotonicity in chemical reaction systems
- The dynamics of weakly reversible population processes near facets
- The mathematical structure of chemical kinetics in homogeneous single- phase systems
- Convergence in Strongly Monotone Systems with an Increasing First Integral
- Comment on ``Identifiability of chemical reaction networks by G. Craciun and C. Pantea
Cited In (20)
- Nonnegative Linear Elimination for Chemical Reaction Networks
- First-order chemical reaction networks. I: Theoretical considerations
- Dynamical equivalence and linear conjugacy of chemical reaction networks: new results and methods
- Conditions for extinction events in chemical reaction networks with discrete state spaces
- Linear conjugacy of chemical kinetic systems
- An Efficient Characterization of Complex-Balanced, Detailed-Balanced, and Weakly Reversible Systems
- Dynamical properties of discrete reaction networks
- Realizations of kinetic differential equations
- A computational approach to the structural analysis of uncertain kinetic systems
- A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem
- Linear conjugacy in biochemical reaction networks with rational reaction rates
- Linear conjugacy of chemical reaction networks
- 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
- Analysis of mass-action systems by split network translation
- Rigorously proven chaos in chemical kinetics
- Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency
- A computational approach to linear conjugacy in a class of power law kinetic systems
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- A computational approach to extinction events in chemical reaction networks with discrete state spaces
This page was built for publication: A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424186)
