Search arXivSearch

arXiv · 2511.22252

Stochastic Models of Resource Allocation in Chemical Reaction Networks

Abstract

This paper analyses of a stochastic model of a chemical reaction network with three types of chemical species ${\cal R}$, ${\cal M}$ and ${\cal U}$ that interact to transform a flow of external resources, the chemical species ${\cal Q}$, to produce a product, the chemical species ${\cal P}_r$. A regulation mechanism involving the sequestration of the chemical species ${\cal R}$ when the flow of resources is too low is investigated. The original motivation of the study is of analyzing the qualitative properties of a key regulation mechanism of gene expression in biological cells, the {\em stringent response}. A scaling analysis of a Markov process in $\N^5$ representing the state of the chemical reaction network is achieved. It is shown that, depending on the parameters of the model, there are, quite surprisingly, three possible asymptotic regimes. To each of them corresponds a stochastic averaging principle with a fast process expressed in terms of a network of $M/M/\infty$ queues. One of these regimes, the optimal sequestration regime, does not seem to have been identified up to now. Under this regime, the input flow of resources is low but the state of the network is still acceptable in terms of unused macro-molecules, showing the remarkable efficiency of this regulation mechanism. The technical proofs of the main convergence results rely on a combination of coupling arguments, technical estimates of the solutions of SDEs, of sample paths of fast processes in particular, and the stability properties of some dynamical systems in $\R^2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vincent Fromion, Philippe Robert, Jana Zaherddine. 2025-11-27. Stochastic Models of Resource Allocation in Chemical Reaction Networks. https://arxiv.org/abs/2511.22252

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Villani's conjecture for Kac's walk

We prove Villani's conjecture on entropy production for Kac's walk with uniform collision angles. For every $N\geq2$, with total collision rate $N$, the optimal entropy production constant is $2/(N-1)$. We show that the known lower bound is sharp by constructing two families of smooth strictly positive probability densities, invariant under coordinate permutations and sign changes. The first consists of normalized products of inverse powers; the second is obtained by conditioning products of Gaussian mixtures on the energy sphere. With $N$ fixed, we compute the leading terms of entropy and entropy production. Successive parameter limits yield two independent proofs of sharpness.

math.PR

Scaling limit and tail bounds for a random walk model of SOS level lines

This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D solid-on-solid (SOS) model, where the emergence of these level lines has been rigorously established. The model we consider is a line ensemble of non-crossing random walk bridges above a wall with geometrically growing area tilts. Our main result, which in particular resolves a question of Caputo, Ioffe, and Wachtel (2019), is an edge 1:2:3 scaling limit for this ensemble as the domain size diverges, with a growing number of walks (including the number of level lines of the SOS model) and high boundary conditions (covering the maximum upper deviation of the SOS level lines). As a key input, we establish Tracy--Widom-type upper tail bounds for each of the relevant curves in the line ensemble. An ingredient which may be of independent interest is a ballot theorem for random walk bridges under a broader range of boundary values than available in the literature.

math.PR

One-dimensional particle clouds with elastic collisions

We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it tries to jump left, the jump is executed. If not, 'momentum' is transferred to increase the rate of jumping left of the minimal-label particle. Similarly for jumps to the right. The collision rule is 'elastic' in the sense that the net rate of flow of mass is independent of the present configuration, in contrast to the exclusion process, for example. We show that the particle masses and jump rates determine explicitly, via a concave majorant of a simple `potential' function associated to the masses and jump rates, a unique partition of the system into maximal stable subsystems. The internal configuration of each stable subsystem remains tight, while the location of each stable subsystem obeys a strong law of large numbers with an explicit speed. We indicate connections to adjacent models, including diffusions with rank-based coefficients, where, to the authors' knowledge, the problem of identifying the analogous decomposition into stable sub-systems is yet to be fully solved.

math.PR