SearcharxivSearch

arXiv · 1103.2322

The Extremal Process of Branching Brownian Motion

Abstract

We prove that the extremal process of branching Brownian motion, in the limit of large times, converges weakly to a cluster point process. The limiting process is a (randomly shifted) Poisson cluster process, where the positions of the clusters is a Poisson process with exponential density. The law of the individual clusters is characterized as branching Brownian motions conditioned to perform "unusually large displacements", and its existence is proved. The proof combines three main ingredients. First, the results of Bramson on the convergence of solutions of the Kolmogorov-Petrovsky-Piscounov equation with general initial conditions to standing waves. Second, the integral representations of such waves as first obtained by Lalley and Sellke in the case of Heaviside initial conditions. Third, a proper identification of the tail of the extremal process with an auxiliary process, which fully captures the large time asymptotics of the extremal process. The analysis through the auxiliary process is a rigorous formulation of the cavity method developed in the study of mean field spin glasses.

Explore related subjects

Keep this discovery

BibTeXRIS

Louis-Pierre Arguin, Anton Bovier, Nicola Kistler. 2011-03-11. The Extremal Process of Branching Brownian Motion. https://arxiv.org/abs/1103.2322

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