A linear programming approach to dynamical equivalence, linear conjugacy, and the Deficiency One Theorem

@article{Johnston2016ALP,
  title={A linear programming approach to dynamical equivalence, linear conjugacy, and the Deficiency One Theorem},
  author={Matthew D. Johnston},
  journal={Journal of Mathematical Chemistry},
  year={2016},
  volume={54},
  pages={1612-1631}
}
  • M. Johnston
  • Published 22 January 2016
  • Mathematics
  • Journal of Mathematical Chemistry
The well-known Deficiency One Theorem gives structural conditions on a chemical reaction network under which, for any set of parameter values, the steady states of the corresponding mass action system may be easily characterized. It is also known, however, that mass action systems are not uniquely associated with reaction networks and that some representations may satisfy the Deficiency One Theorem while others may not. In this paper we present a mixed-integer linear programming framework… 
View on Springer
arxiv.org
8 Citations
Highly Influential Citations
1
Background Citations
2
Methods Citations
3

8 Citations

Linear conjugacy of chemical kinetic systems.

A general computational solution to construct linear conjugates of any "rate constant-interaction function decomposable" (RID) chemical kinetic systems, wherein each of its rate function is the product of a rate constant and an interaction function.

A computational approach to linear conjugacy in a class of power law kinetic systems

This paper studies linear conjugacy of PL-RDK systems, which are kinetic systems with power law rate functions whose kinetic orders are identical for branching reactions, i.e. reactions with the same…

Graph properties of biological interaction networks

It is shown how regulatory properties of Boolean networks can be investigated via satisfiability problems, and used to examine the role of local negative circuits in networks of small dimension, and proposes algorithms for elimination of intermediate species that can be used to find whether a mass action network simplifies to a given chemical system.

A computational approach to extinction events in chemical reaction networks with discrete state spaces.

Conditions for extinction events in chemical reaction networks with discrete state spaces

This work presents sufficient conditions on the structure of the network that guarantee the system exhibits an extinction event and suggests sequences of reactions which may lead to extinction events.

Conditions for extinction events in chemical reaction networks with discrete state spaces

This work presents sufficient conditions on the structure of the network that guarantee the system exhibits an extinction event and suggests sequences of reactions which may lead to extinction events.

Characterization of Biologically Relevant Network Structures form Time-series Data

  • Z. TuzaG. Stan
  • Computer Science
    2018 IEEE Conference on Decision and Control (CDC)
  • 2018
This paper presents state-of-the-art system identification techniques and combine them with chemical reaction network theory (CRNT) to generate dynamic models automatically to solve the challenge of closed-loop system identification.

Reachability Analysis of Subconservative Discrete Chemical Reaction Networks

In this paper, we give a computational solution for the reachability problem of subconservative discrete chemical reaction networks (d-CRNs), namely whether there exists a valid state transition…

References

SHOWING 1-10 OF 44 REFERENCES

Computing weakly reversible linearly conjugate chemical reaction networks with minimal deficiency.

Dynamical Equivalence and Linear Conjugacy of Chemical Reaction Networks: New Results and Methods

In the first part of this paper, we propose new optimization-based methods for the computation of preferred (dense, sparse, reversible, detailed and complex balanced) linearly conjugate reaction…

Computing zero deficiency realizations of kinetic systems

A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks

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…

Linear conjugacy of chemical reaction networks

Under suitable assumptions, the dynamic behaviour of a chemical reaction network is governed by an autonomous set of polynomial ordinary differential equations over continuous variables representing…

A Computational Approach to Steady State Correspondence of Regular and Generalized Mass Action Systems

  • M. Johnston
  • Computer Science
    Bulletin of mathematical biology
  • 2015
This paper develops the theory of network translation with particular focus on a subclass of translations known as improper translations, and presents a mixed-integer linear programming algorithm capable of determining whether a mass action system can be corresponded to a generalized system through the process of networktranslation.

Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks

Two new algorithms to find dynamically equivalent weakly reversible realizations of a given CRN are presented, based on linear programming and thus have polynomial time-complexity, and can deal with large-scale biochemical reaction networks, too.

A Family of Sparse Polynomial Systems Arising in Chemical Reaction Systems

The positive steady states of chemical reaction systems modeled by mass action kinetics are investigated and it is shown that the simplest cases are equivalent to binomial systems and are explained with the help of toric varieties.

Notes on the Deficiency-One Theorem: multiple linkage classes.

  • B. Boros
  • Mathematics
    Mathematical biosciences
  • 2012

Uniqueness of Equilibria for Complex Chemical Reaction Networks

Each chemical reaction network taken with mass action kinetics gives rise to a system of polynomial differential equations that govern the species concentrations, and in those equations many…