Search arXivSearch

arXiv · 1909.11916

Accuracy of Multiscale Reduction for Stochastic Reaction Systems

Abstract

Stochastic models of chemical reaction networks are an important tool to describe and analyze noise effects in cell biology. When chemical species and reaction rates in a reaction system have different orders of magnitude, the associated stochastic system is often modeled in a multiscale regime. It is known that multiscale models can be approximated with a reduced system such as mean field dynamics or hybrid systems, but the accuracy of the approximation remains unknown. In this paper, we estimate the probability distribution of low copy species in multiscale stochastic reaction systems under short-time scale. We also establish an error bound for this approximation. Throughout the manuscript, typical mass action systems are mainly handled, but we also show that the main theorem can extended to general kinetics, which generalizes existing results in the literature. Our approach is based on a direct analysis of the Kolmogorov equation, in contrast to classical approaches in the existing literature.

Explore related subjects

Keep this discovery

BibTeXRIS

German Enciso, Jinsu Kim. 2019-09-26. Accuracy of Multiscale Reduction for Stochastic Reaction Systems. https://arxiv.org/abs/1909.11916

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR