Papers
Topics
Authors
Recent
2000 character limit reached

Strong Gaussian approximation of metastable density-dependent Markov chains on large time scales (2010.06861v3)

Published 14 Oct 2020 in math.PR

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.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.