SearcharxivSearch

arXiv · 2405.17634

On the Growth of the Extremal and Cluster Level Sets in Branching Brownian Motion

Abstract

We study the limiting extremal and cluster point processes of branching Brownian motion. The former records the heights of all extreme values of the process, while the latter records the relative heights of extreme values in a genealogical neighborhood of order unity around a local maximum thereof. For the extremal point process, we show that the mass of upper level sets $[-v, \infty)$ grows as $C_\star Z v e^{\sqrt{2} v}(1+o(1))$ as $v \to \infty$, almost surely, where $Z$ is the limit of the associated derivative martingale and $C_\star \in (0, \infty)$ is a universal constant. For the cluster point process, we show that the logarithm of the mass of $[-v, \infty)$ grow as $\sqrt{2}v$ minus random fluctuations of order $v^{2/3}$, which are governed by an explicit law in the limit. The first result improves upon the works of Cortines et al. (arXiv:1703.06529) and Mytnik et al. (arXiv:2009.02042) in which asymptotics are shown in probability, while the second makes rigorous the derivation in the physics literature by Mueller et al. (arXiv:1910.06382) and Le et al. (arXiv:2207.07672) and resolves a conjecture thereof.

Explore related subjects

Keep this discovery

BibTeXRIS

Lisa Hartung, Oren Louidor, Tianqi Wu. 2024-05-27. On the Growth of the Extremal and Cluster Level Sets in Branching Brownian Motion. https://arxiv.org/abs/2405.17634

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