SearcharxivSearch

arXiv · 2411.09629

A Kesten Stigum theorem for Galton-Watson processes with infinitely many types in a random environment

Abstract

In this paper, we study a Galton-Watson process $(Z_n)$ with infinitely many types in a random ergodic environment $\bar{\xi}=(\xi_n)_{n\geq 0}$. We focus on the supercritical regime of the process, where the quenched average of the size of the population grows exponentially fast to infinity. We work under Doeblin-type assumptions coming from a previous paper, which ensure that the quenched mean semi group of $(Z_n)$ satisfies some ergodicity property and admits a $\bar{\xi}$-measurable family of space-time harmonic functions. We use these properties to derive an associated nonnegative martingale $(W_n)$. Under a $L\log(L)^{1+\varepsilon}$-integrabilty assumption on the offspring distribution, we prove that the almost sure limit $W$ of the martingale $(W_n)$ is not degenerate. Assuming some uniform $L^2$-integrability of the offspring distribution, we prove that conditionally on $\{W>0\}$, at a large time $n$, both the size of the population and the distribution of types correspond to those of the quenched mean of the population $\mathbb{E}[Z_n|\bar{\xi}, Z_0]$. We finally introduce an example of a process modelling a population with a discrete age structure. In this context, we provide more tractable criterions which guarantee our various assumptions are met.

Explore related subjects

Keep this discovery

BibTeXRIS

Maxime Ligonnière. 2024-11-14. A Kesten Stigum theorem for Galton-Watson processes with infinitely many types in a random environment. https://arxiv.org/abs/2411.09629

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