Search arXivSearch

arXiv · 1004.1263

Upper large deviations for Branching Processes in Random Environment with heavy tails

Abstract

Branching Processes in a Random Environment (BPREs) $(Z_n:n\geq0)$ are a generalization of Galton Watson processes where in each generation the reproduction law is picked randomly in an i.i.d. manner. We determine here the upper large deviation of the process when the reproduction law may have heavy tails. The behavior of BPREs is related to the associated random walk of the environment, whose increments are distributed like the logarithmic mean of the offspring distributions. We obtain an expression of the upper rate function of $(Z_n:n\geq0)$, that is the limit of $-\log \mathbb{P}(Z_n\geq e^{θn})/n$ when $n\to \infty$. It depends on the rate function of the associated random walk of the environment, the logarithmic cost of survival $γ:=-\lim_{n\to\infty} \log \mathbb{P}(Z_n>0)/n$ and the polynomial decay $β$ of the tail distribution of $Z_1$. We give interpretations of this rate function in terms of the least costly ways for the process $(Z_n: n \geq 0)$ of attaining extraordinarily large values and describe the phase transitions. We derive then the rate function when the reproduction law does not have heavy tails, which generalizes the results of Böinghoff and Kersting (2009) and Bansaye and Berestycki (2008) for upper large deviations. Finally, we specify the upper large deviations for the Galton Watson processes with heavy tails.

Explore related subjects

Keep this discovery

BibTeXRIS

Vincent Bansaye, Christian Boeinghoff. 2010-04-08. Upper large deviations for Branching Processes in Random Environment with heavy tails. https://arxiv.org/abs/1004.1263

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