Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates

The analysis of dynamic of chemical reaction networks by computing Hopf bifurcation is a method to understand the qualitative behavior of the network due to its relation to the existence of oscillations. For low dimensional reaction systems without additional constraints Hopf bifurcation can be computed by reducing the question of its occurrence to quantifier elimination problems on real closed fields. However deciding its occurrence in high dimensional system has proven to be difficult in practice. In this paper we present a fully algorithmic technique to compute Hopf bifurcation fixed point for reaction systems with linear conservation laws using reaction coordinates instead of concentration coordinates, a technique that extends the range of networks, which can be analyzed in practice, considerably.

[1]  Thomas Sturm,et al.  REDLOG: computer algebra meets computer logic , 1997, SIGS.

[2]  Volker Weispfenning,et al.  Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond , 1997, Applicable Algebra in Engineering, Communication and Computing.

[3]  M'hammed El Kahoui,et al.  Deciding Hopf Bifurcations by Quantifier Elimination in a Software-component Architecture , 2000, J. Symb. Comput..

[4]  Markus Eiswirth,et al.  Toric ideals and graph theory to analyze Hopf bifurcations in mass action systems , 2005, J. Symb. Comput..

[5]  Michael Hucka,et al.  The Systems Biology Markup Language (SBML): Language Specification for Level 3 Version 1 Core , 2010 .

[6]  B. L. Clarke.  Stability of Complex Reaction Networks , 2007 .

[7]  Christopher W. Brown.  QEPCAD B: a system for computing with semi-algebraic sets via cylindrical algebraic decomposition , 2004, SIGS.

[8]  G. Ziegler,et al.  Polytopes : combinatorics and computation , 2000 .

[9]  Markus Kirkilionis,et al.  Bistability and oscillations in chemical reaction networks , 2009, Journal of mathematical biology.

[10]  Thomas Sturm,et al.  Simplification of Quantifier-Free Formulae over Ordered Fields , 1997, J. Symb. Comput..

[11]  Robert Urbanczik,et al.  The geometry of the flux cone of a metabolic network. , 2005, Biophysical journal.

[12]  Andreas Zell,et al.  JSBML: a flexible and entirely Java-based library for working with SBML , 2011 .

[13]  Anne Shiu,et al.  Algebraic methods for biochemical reaction network theory , 2010 .

[14]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[15]  Werner M. Seiler,et al.  Involution - The Formal Theory of Differential Equations and its Applications in Computer Algebra , 2009, Algorithms and computation in mathematics.

[16]  Michael Joswig,et al.  polymake: a Framework for Analyzing Convex Polytopes , 2000 .

[17]  Thomas Sturm,et al.  Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology , 2009, Math. Comput. Sci..

[18]  Abdelhalim Larhlimi,et al.  New concepts and tools in constraint-based analysis of metabolic networks , 2009 .

[19]  Birkett Huber,et al.  A Family of Sparse Polynomial Systems Arising in Chemical Reaction Systems , 2002, J. Symb. Comput..

[20]  Alicia Dickenstein,et al.  Chemical Reaction Systems with Toric Steady States , 2011, Bulletin of mathematical biology.

[21]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.

[22]  J Reidl,et al.  Model of calcium oscillations due to negative feedback in olfactory cilia. , 2006, Biophysical journal.

[23]  Thomas Sturm,et al.  Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology , 2008, AB.