SearcharxivSearch

arXiv · 2207.04162

Long and short time laws of iterated logarithms for the KPZ fixed point

Abstract

We consider the KPZ fixed point starting from a general class of initial data. In this article, we study the growth of the large peaks of the KPZ fixed point at a spatial point $0$ when time $t$ goes to $\infty$ and when $t$ approaches $1$. We prove that for a very broad class of initial data, as $t\to \infty$, the limsup of the KPZ fixed point height function when scaled by $t^{1/3}(\log\log t)^{2/3}$ almost surely equals a constant. The value of the constant is $(3/4)^{2/3}$ or $(3/2)^{2/3}$ depending on the initial data being non-random or Brownian respectively. Furthermore, we show that the increments of the KPZ fixed point near $t=1$ admits a short time law of iterated logarithm. More precisely, as the time increments $\Delta t :=t-1$ goes down to $0$, for a large class of initial data including the Brownian data initial data, we show that limsup of the height increments the KPZ fixed point near time $1$ when scaled by $(\Delta t)^{1/3}(\log\log (\Delta t)^{-1})^{2/3}$ almost surely equals $(3/2)^{2/3}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Sayan Das, Promit Ghosal, Yier Lin. 2022-07-09. Long and short time laws of iterated logarithms for the KPZ fixed point. https://arxiv.org/abs/2207.04162

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