SearcharxivSearch

arXiv · 2506.07939

The half-space KPZ line ensemble and its scaling limit

Abstract

For each $\alpha \in \mathbb{R}$, $t \geq 1$, we show that there exists a unique $\mathbb{N}$-indexed line ensemble of random continuous curves $\mathbb{R}_{\le 0} \to \mathbb{R}$ with the following properties: (1) The top curve is distributed as the time-$t$ Cole--Hopf solution to the half-space KPZ equation with narrow wedge initial condition and Neumann boundary condition with parameter $\alpha$. (2) The line ensemble satisfies a one-sided resampling invariance property, involving softly non-intersecting Brownian motions with an attractive potential between pairs at the boundary. We call this object the half-space KPZ line ensemble. For $\alpha=\mu t^{-1/3}$ with $\mu \in \mathbb{R}$ fixed (critical regime) and for $\alpha>0$ fixed (supercritical regime), we show that the half-space KPZ line ensemble is tight under 1:2:3 KPZ scaling as $t\to\infty$. Moreover, all subsequential limits approximate a parabola and enjoy a one-sided Brownian Gibbs property, described by non-intersecting Brownian motions with pairwise interaction at the boundary. In the critical case this agrees with the half-space Airy line ensemble recently constructed by Dimitrov and Yang. In the supercritical case, we demonstrate a novel structure involving pairwise pinned Brownian motions, one of the main technical contributions of this paper.

Explore related subjects

Keep this discovery

BibTeXRIS

Sayan Das, Christian Serio. 2025-06-09. The half-space KPZ line ensemble and its scaling limit. https://arxiv.org/abs/2506.07939

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