SearcharxivSearch

arXiv · 2501.00932

An upper tail field of the KPZ fixed point

Abstract

The KPZ fixed point is a (1+1)-dimensional space-time random field conjectured to be the universal limit for models within the Kardar-Parisi-Zhang (KPZ) universality class. We consider the KPZ fixed point with the narrow-wedge initial condition, conditioning on a large value at a specific point. By zooming in the neighborhood of this high point appropriately, we obtain a limiting random field, which we call an upper tail field of the KPZ fixed point. Different from the KPZ fixed point, where the time parameter has to be nonnegative, the upper tail field is defined in the full $2$-dimensional space. Especially, if we zoom out the upper tail field appropriately, it behaves like a Brownian-type field in the negative time regime, and the KPZ fixed point in the positive time regime. One main ingredient of the proof is an upper tail estimate of the joint tail probability functions of the KPZ fixed point near the given point, which generalizes the well known one-point upper tail estimate of the GUE Tracy-Widom distribution.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhipeng Liu, Ruixuan Zhang. 2025-01-01. An upper tail field of the KPZ fixed point. https://arxiv.org/abs/2501.00932

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