IDEAS home Printed from https://ideas.repec.org/a/hin/complx/1035974.html
   My bibliography  Save this article

Reachability Analysis of Low-Order Discrete State Reaction Networks Obeying Conservation Laws

Author

Listed:
  • Gergely Szlobodnyik
  • Gábor Szederkényi

Abstract

In this paper we study the reachability problem of sub- and superconservative discrete state chemical reaction networks (d-CRNs). It is known that a subconservative network has bounded reachable state space, while that of a superconservative one is unbounded. The reachability problem of superconservative reaction networks is traced back to the reachability of subconservative ones. We consider network structures composed of reactions having at most one input and one output species beyond the possible catalyzers. We give a proof that, assuming all the reactions are charged in the initial and target states, the reachability problems of sub- and superconservative reaction networks are equivalent to the existence of nonnegative integer solution of the corresponding d-CRN state equations. Using this result, the reachability problem is reformulated as an Integer Linear Programming (ILP) feasibility problem. Therefore, the number of feasible trajectories satisfying the reachability relation can be counted in polynomial time in the number of species and in the distance of initial and target states, assuming fixed number of reactions in the system.

Suggested Citation

  • Gergely Szlobodnyik & Gábor Szederkényi, 2019. "Reachability Analysis of Low-Order Discrete State Reaction Networks Obeying Conservation Laws," Complexity, Hindawi, vol. 2019, pages 1-13, March.
  • Handle: RePEc:hin:complx:1035974
    DOI: 10.1155/2019/1035974
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2019/1035974.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2019/1035974.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/1035974?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
    ---><---

    References listed on IDEAS

    as
    1. Alexander I. Barvinok, 1994. "A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed," Mathematics of Operations Research, INFORMS, vol. 19(4), pages 769-779, November.
    2. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    3. Stephen Smith & Ramon Grima, 2018. "Single-cell variability in multicellular organisms," Nature Communications, Nature, vol. 9(1), pages 1-8, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Friedrich Eisenbrand & Gennady Shmonin, 2008. "Parametric Integer Programming in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 839-850, November.
    2. Sascha Kurz & Nikolas Tautenhahn, 2013. "On Dedekind’s problem for complete simple games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 411-437, May.
    3. Matthias Köppe & Christopher Thomas Ryan & Maurice Queyranne, 2011. "Rational Generating Functions and Integer Programming Games," Operations Research, INFORMS, vol. 59(6), pages 1445-1460, December.
    4. Jesús A. De Loera & Raymond Hemmecke & Matthias Köppe & Robert Weismantel, 2006. "Integer Polynomial Optimization in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 147-153, February.
    5. K. Aardal & R. E. Bixby & C. A. J. Hurkens & A. K. Lenstra & J. W. Smeltink, 2000. "Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 192-202, August.
    6. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    7. Masing, Berenike & Lindner, Niels & Borndörfer, Ralf, 2022. "The price of symmetric line plans in the Parametric City," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 419-443.
    8. Danny Nguyen & Igor Pak, 2020. "The Computational Complexity of Integer Programming with Alternations," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 191-204, February.
    9. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    10. Ahmad Awde & Mostapha Diss & Eric Kamwa & Julien Yves Rolland & Abdelmonaim Tlidi, 2023. "Social Unacceptability for Simple Voting Procedures," Studies in Choice and Welfare, in: Sascha Kurz & Nicola Maaser & Alexander Mayer (ed.), Advances in Collective Decision Making, pages 25-42, Springer.
    11. Mostapha Diss & Michele Gori, 2022. "Majority properties of positional social preference correspondences," Theory and Decision, Springer, vol. 92(2), pages 319-347, March.
    12. Herbert E. Scarf & David F. Shallcross, 2008. "The Frobenius Problem and Maximal Lattice Free Bodies," Palgrave Macmillan Books, in: Zaifu Yang (ed.), Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research, chapter 7, pages 149-153, Palgrave Macmillan.
    13. Elhedhli, Samir & Naoum-Sawaya, Joe, 2015. "Improved branching disjunctions for branch-and-bound: An analytic center approach," European Journal of Operational Research, Elsevier, vol. 247(1), pages 37-45.
    14. Mauro Dell’Amico & Simone Falavigna & Manuel Iori, 2015. "Optimization of a Real-World Auto-Carrier Transportation Problem," Transportation Science, INFORMS, vol. 49(2), pages 402-419, May.
    15. Le Breton, Michel & Lepelley, Dominique & Smaoui, Hatem, 2016. "Correlation, partitioning and the probability of casting a decisive vote under the majority rule," Journal of Mathematical Economics, Elsevier, vol. 64(C), pages 11-22.
    16. Karen Aardal & Cor A. J. Hurkens & Arjen K. Lenstra, 2000. "Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 427-442, August.
    17. Hiroshi Hirai & Ryunosuke Oshiro & Ken’ichiro Tanaka, 2020. "Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 455-464, May.
    18. Diss, Mostapha & Louichi, Ahmed & Merlin, Vincent & Smaoui, Hatem, 2012. "An example of probability computations under the IAC assumption: The stability of scoring rules," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 57-66.
    19. Ariel D Procaccia & Michal Feldmany & Jeffrey S Rosenschein, 2007. "Approximability and Inapproximability of Dodgson and Young Elections," Levine's Bibliography 122247000000001616, UCLA Department of Economics.
    20. Eric Kamwa, 2017. "Stable Rules for Electing Committees and Divergence on Outcomes," Group Decision and Negotiation, Springer, vol. 26(3), pages 547-564, May.

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:1035974. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.