SearcharxivSearch

arXiv · 2010.06861

Strong Gaussian approximation of metastable density-dependent Markov chains on large time scales

Abstract

Density-dependent Markov chains form an important class of continuous-time Markov chains in population dynamics. On any fixed time window [0, T ], when the scale parameter K > 0 is large such chains are well approximated by the solution of an ODE (the fluid limit), with Gaussian fluctuations superimposed upon it. In this paper we quantify the period of time during which this Gaussian approximation remains precise, uniformly on the trajectory, in the case where the fluid limit converges to an exponentially stable equilibrium point. We provide a new coupling between the density-dependent chain and the approximating Gaussian process, based on a construction of Kurtz using the celebrated Koml{\'o}s-Major-Tusn{\'a}dy theorem for random walks. We show that under mild hypotheses the time T(K) necessary for the strong approximation error to reach a threshold $\epsilon$(K)<<1 is at least of order exp(V K $\epsilon$(K)), for some constant V > 0. This notably entails that the Gaussian approximation yields the correct asymptotics regarding the time scales of moderate deviations. We also present applications to the Gaussian approximation of the logistic birth-and-death process conditioned to survive, and to the estimation of a quantity modeling the cost of an epidemic.

Explore related subjects

Keep this discovery

BibTeXRIS

Adrien Prodhomme. 2020-10-14. Strong Gaussian approximation of metastable density-dependent Markov chains on large time scales. https://arxiv.org/abs/2010.06861

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