Search arXivSearch

arXiv · 1608.08075

Harmonic moments and large deviations for a supercritical branching process in a random environment

Abstract

Let $(Z_n)$ be a supercritical branching process in an independent and identically distributed random environment $\xi$. We study the asymptotic of the harmonic moments $\mathbb{E}\left[Z_n^{-r} | Z_0=k \right]$ of order $r>0$ as $n \to \infty$. We exhibit a phase transition with the critical value $r_k>0$ determined by the equation $\mathbb E p_1^k = \mathbb E m_0^{-r_k},$ where $m_0=\sum_{k=0}^\infty k p_k$ with $p_k=\mathbb P(Z_1=k | \xi),$ assuming that $p_0=0.$ Contrary to the constant environment case (the Galton-Watson case), this critical value is different from that for the existence of the harmonic moments of $W=\lim_{n\to\infty} Z_n / \mathbb E (Z_n|\xi).$ The aforementioned phase transition is linked to that for the rate function of the lower large deviation for $Z_n$. As an application, we obtain a lower large deviation result for $Z_n$ under weaker conditions than in previous works and give a new expression of the rate function. We also improve an earlier result about the convergence rate in the central limit theorem for $W-W_n,$ and find an equivalence for the large deviation probabilities of the ratio $Z_{n+1} / Z_n$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ion Grama, Quansheng Liu, Eric Miqueu. 2016-08-29. Harmonic moments and large deviations for a supercritical branching process in a random environment. https://arxiv.org/abs/1608.08075

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