SearcharxivSearch

arXiv · 2001.03961

Local stationarity of exponential last passage percolation

Abstract

We consider point to point last passage times to every vertex in a neighbourhood of size $\delta N^{\frac{2}{3}}$, distance $N$ away from the starting point. The increments of these last passage times in this neighbourhood are shown to be jointly equal to their stationary versions with high probability that depends on $\delta$ only. With the help of this result we show that 1) the $\text{Airy}_2$ process is locally close to a Brownian motion in total variation; 2) the tree of point to point geodesics starting from every vertex in a box of side length $\delta N^{\frac{2}{3}}$ going to a point at distance $N$ agree inside the box with the tree of infinite geodesics going in the same direction; 3) two geodesics starting from $N^{\frac{2}{3}}$ away from each other, to a point at distance $N$ will not coalesce too close to either endpoints on the macroscopic scale. Our main results rely on probabilistic methods only.

Explore related subjects

Keep this discovery

BibTeXRIS

Márton Balázs, Ofer Busani, Timo Seppäläinen. 2020-01-12. Local stationarity of exponential last passage percolation. https://doi.org/10.1007/s00440-021-01035-7

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