SearcharxivSearch

arXiv · 2009.02042

Fisher-KPP equation with small data and the extremal process of branching Brownian motion

Abstract

We consider the limiting extremal process ${\mathcal X}$ of the particles of the binary branching Brownian motion. We show that after a shift by the logarithm of the derivative martingale $Z$, the rescaled "density" of particles, which are at distance $n+x$ from a position close to the tip of ${\mathcal X}$, converges in probability to a multiple of the exponential $e^x$ as $n\to+\infty$. We also show that the fluctuations of the density, after another scaling and an additional random but explicit shift, converge to a $1$-stable random variable. Our approach uses analytic techniques and is motivated by the connection between the properties of the branching Brownian motion and the Bramson shift of the solutions to the Fisher-KPP equation with some specific initial conditions initiated in \cite{BD1,BD2} and further developed in the present paper. The proofs of the limit theorems for ${\mathcal X}$ rely crucially on the fine asymptotics of the behavior of the Bramson shift for the Fisher-KPP equation starting with initial conditions of "size" $0<\varepsilon\ll 1$, up to terms of the order $[{(\log \varepsilon^{-1})]^{-1-γ}}$, with some $γ>0$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leonid Mytnik, Jean-Michel Roquejoffre, Lenya Ryzhik. 2021-11-01. Fisher-KPP equation with small data and the extremal process of branching Brownian motion. https://arxiv.org/abs/2009.02042

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