IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v287-288y2016ip60-73.html
   My bibliography  Save this article

Analyzing multistationarity in chemical reaction networks using the determinant optimization method

Author

Listed:
  • Félix, Bryan
  • Shiu, Anne
  • Woodstock, Zev

Abstract

Multistationary chemical reaction networks are of interest to scientists and mathematicians alike. While some criteria for multistationarity exist, obtaining explicit reaction rates and steady states that exhibit multistationarity for a given network—in order to check nondegeneracy or determine stability of the steady states, for instance—is nontrivial. Nonetheless, we accomplish this task for a certain family of sequestration networks. Additionally, our results allow us to prove the existence of nondegenerate steady states for some of these sequestration networks, thereby resolving a subcase of a conjecture of Joshi and Shiu. Our work relies on the determinant optimization method, developed by Craciun and Feinberg, for asserting that certain networks are multistationary. More precisely, we implement the construction of reaction rates and multiple steady states which appears in the proofs that underlie their method. Furthermore, we describe in detail the steps of this construction so that other researchers can more easily obtain, as we did, multistationary rates and steady states.

Suggested Citation

  • Félix, Bryan & Shiu, Anne & Woodstock, Zev, 2016. "Analyzing multistationarity in chemical reaction networks using the determinant optimization method," Applied Mathematics and Computation, Elsevier, vol. 287, pages 60-73.
  • Handle: RePEc:eee:apmaco:v:287-288:y:2016:i::p:60-73
    DOI: 10.1016/j.amc.2016.04.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316302806
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2016.04.030?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:287-288:y:2016:i::p:60-73. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.