SearcharxivSearch

arXiv · 2412.13032

Characterization of the directed landscape from the KPZ fixed point

Abstract

We show that the directed landscape is the unique coupling of the KPZ fixed point from all initial conditions satisfying three natural properties: independent increments, monotonicity, and shift commutativity. Equivalently, we show that the directed landscape is the unique directed metric on $\mathbb R^2$ with independent increments and KPZ fixed point marginals. This unifies the two central objects in the KPZ universality class. Our main theorem also provides a general framework for proving convergence to the directed landscape given convergence to the KPZ fixed point. We apply this framework to prove landscape convergence in a range of models: exotic couplings of ASEP and TASEP, the random walk and Brownian web distances, and a class of non-integrable asymmetric exclusion processes with the basic coupling that perturb off of TASEP (this final class requires random initial data). All of our convergence theorems are new except for colored TASEP, where we provide a short alternative proof.

Explore related subjects

Keep this discovery

BibTeXRIS

Duncan Dauvergne, Lingfu Zhang. 2024-12-17. Characterization of the directed landscape from the KPZ fixed point. https://arxiv.org/abs/2412.13032

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