SearcharxivSearch

arXiv · 1504.08160

Speed of coming down from infinity for birth and death processes

Abstract

We finely describe the speed of "coming down from infinity" for birth and death processes which eventually become extinct. Under general assumptions on the birth and death rates, we firstly determine the behavior of the successive hitting times of large integers. We put in light two different regimes depending on whether the mean time for the process to go from $n+1$ to $n$ is negligible or not compared to the mean time to reach $n$ from infinity. In the first regime, the coming down from infinity is very fast and the convergence is weak. In the second regime, the coming down from infinity is gradual and a law of large numbers and a central limit theorem for the hitting times sequence hold. By an inversion procedure, we deduce that the process is a.s. equivalent to a non-increasing function when the time goes to zero. Our results are illustrated by several examples including applications to population dynamics and population genetics. The particular case where the death rate varies regularly is studied in details.

Explore related subjects

Keep this discovery

BibTeXRIS

Vincent Bansaye, Sylvie Méléard, Mathieu Richard. 2015-04-30. Speed of coming down from infinity for birth and death processes. https://arxiv.org/abs/1504.08160

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