Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 55 min ago
PreprintCC BY 4.0arXiv

Optimization of Kinetic--Stoichiometric Growth Bounds over Autocatalytic Subnetworks

Abstract

Autocatalytic subnetworks govern sustained production and balanced growth in chemical reaction systems and can be naturally represented as directed multihypergraphs that jointly encode stoichiometric structure and reaction kinetics. Existing optimization approaches identify such subnetworks by maximizing their structural amplification, typically measured through the Maximum Amplification Factor (MAF). However, structural amplification alone does not determine growth potential, since highly amplifying subnetworks may be kinetically inefficient. Motivated by recent kinetic--stoichiometric bounds on balanced growth under scalable dynamics, we study the problem of selecting the autocatalytic subnetwork maximizing the growth bound (α*−1)|𝕊|𝒜'|κ, where α* is the MAF and |𝕊|𝒜'|κ is a kinetic consumption norm. We formulate the problem as a mixed-integer bilinear optimization model combining hypergraph selection with generalized fractional amplification constraints. Exploiting the discrete structure of the kinetic norm, we develop an exact parametric algorithm in which each subproblem reduces to MAF maximization and is solved through a Dinkelbach-type generalized fractional programming method. Finite convergence and global optimality are established. Applications to the Oregonator, the formose reaction, carbon-fixation cycles, and synthetic benchmark networks show when maximizing the kinetic--stoichiometric bound differs from maximizing the MAF alone, revealing the interplay between stoichiometric amplification, reaction kinetics, and balanced growth. The proposed framework provides an exact optimization methodology for identifying reaction subnetworks with the highest theoretical growth potential.

Related

  1. Cutoff profiles and boundary effects in the Togashi-Kaneko model of autocatalytic reactions with weak mutations
    Yangrui Xiang, Wasiur R. KhudaBukhsh
    arXivPreprintCC BY-NC-SA 4.0Full textProbabilityarXiv
  2. FluxDisco: Symbolic Regression for Stoichiometric Dynamical Systems via Monte Carlo Graph Search
    Cassandra Durr, Alvaro Köhn-Luque, Chris Jewell +1
    arXivPreprintCC BY 4.0Full textStatisticsComputational physicsarXiv
  3. Minimality in Reflexive and Stoichiometric Autocatalysis
    Richard Golnik, Thomas Gatter, Wim Hordijk +2
    arXivPreprintarXiv licenceFull textSystems & synthetic biologyCombinatorics & discrete mathematicsarXiv
  4. A law of large numbers for kinetic interacting diffusions
    Carlo Bellingeri, Fabio Coppini
    BernoulliPeer-reviewedLicence not statedFull textProbabilityHAL
  5. Derivation of the Wave Kinetic Equation: Full Range of Scaling Laws
    Yu Deng, Zaher Hani
    Memoirs of the American Mathematical SocietyPeer-reviewedLicence not statedFull text37 citedMathematical physicsOpenAlex
BibTeX
@misc{blanco2026optimization,
  title = {{Optimization of Kinetic--Stoichiometric Growth Bounds over Autocatalytic Subnetworks}},
  author = {Víctor Blanco and Gabriel González},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2607.23107},
  eprint = {2607.23107},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.23107},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Optimization of Kinetic--Stoichiometric Growth Bounds over Autocatalytic Subnetworks
AU  - Víctor Blanco
AU  - Gabriel González
PY  - 2026
DA  - 2026/10/07
PB  - arXiv
DO  - 10.48550/arxiv.2607.23107
UR  - https://arxiv.org/abs/2607.23107
AB  - Autocatalytic subnetworks govern sustained production and balanced growth in chemical reaction systems and can be naturally represented as directed multihypergraphs that jointly encode stoichiometric structure and reaction kinetics. Existing optimization approaches identify such subnetworks by maximizing their structural amplification, typically measured through the Maximum Amplification Factor (MAF). However, structural amplification alone does not determine growth potential, since highly amplifying subnetworks may be kinetically inefficient. Motivated by recent kinetic--stoichiometric bounds on balanced growth under scalable dynamics, we study the problem of selecting the autocatalytic subnetwork maximizing the growth bound (α^*−1)|𝕊|_𝒜'|_κ, where α^* is the MAF and |𝕊|_𝒜'|_κ is a kinetic consumption norm. We formulate the problem as a mixed-integer bilinear optimization model combining hypergraph selection with generalized fractional amplification constraints. Exploiting the discrete structure of the kinetic norm, we develop an exact parametric algorithm in which each subproblem reduces to MAF maximization and is solved through a Dinkelbach-type generalized fractional programming method. Finite convergence and global optimality are established. Applications to the Oregonator, the formose reaction, carbon-fixation cycles, and synthetic benchmark networks show when maximizing the kinetic--stoichiometric bound differs from maximizing the MAF alone, revealing the interplay between stoichiometric amplification, reaction kinetics, and balanced growth. The proposed framework provides an exact optimization methodology for identifying reaction subnetworks with the highest theoretical growth potential.
ER  -