SearcharxivSearch

arXiv · 2201.01635

On the limiting law of line ensembles of Brownian polymers with geometric area tilts

Abstract

We study the line ensembles of non-crossing Brownian bridges above a hard wall, each tilted by the area of the region below it with geometrically growing pre-factors. This model, which mimics the level lines of the $(2+1)$D SOS model above a hard wall, was studied in two works from 2019 by Caputo, Ioffe and Wachtel. In those works, the tightness of the law of the top $k$ paths, for any fixed $k$, was established under either zero or free boundary conditions, which in the former setting implied the existence of a limit via a monotonicity argument. Here we address the open problem of a limit under free boundary conditions: we prove that as the interval length, followed by the number of paths, go to $\infty$, the top $k$ paths converge to the same limit as in the free boundary case, as conjectured by Caputo, Ioffe and Wachtel.

Explore related subjects

Keep this discovery

BibTeXRIS

Amir Dembo, Eyal Lubetzky, Ofer Zeitouni. 2022-01-05. On the limiting law of line ensembles of Brownian polymers with geometric area tilts. https://arxiv.org/abs/2201.01635

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