SearcharxivSearch

arXiv · 1305.4766

Weak law of large numbers for some Markov chains along non homogeneous genealogies

Abstract

We consider a population with non-overlapping generations, whose size goes to infinity. It is described by a discrete genealogy which may be time non-homogeneous and we pay special attention to branching trees in varying environments. A Markov chain models the dynamic of the trait of each individual along this genealogy and may also be time non-homogeneous. Such models are motivated by transmission processes in the cell division, reproduction-dispersion dynamics or sampling problems in evolution. We want to determine the evolution of the distribution of the traits among the population, namely the asymptotic behavior of the proportion of individuals with a given trait. We prove some quenched laws of large numbers which rely on the ergodicity of an auxiliary process, in the same vein as \cite{guy,delmar}. Applications to time inhomogeneous Markov chains lead us to derive a backward (with respect to the environment) law of large numbers and a law of large numbers on the whole population until generation $n$. A central limit is also established in the transient case.

Explore related subjects

Keep this discovery

BibTeXRIS

Vincent Bansaye, Chunmao Huang. 2013-05-21. Weak law of large numbers for some Markov chains along non homogeneous genealogies. https://arxiv.org/abs/1305.4766

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