SearcharxivSearch

arXiv · 2607.21443

The critical KPZ scale for the Averaging Process

Abstract

KPZ-type extremal fluctuations have recently been proved for several models of random walks in space-time random environments (RWRE) in $1+1$ dimensions. A general moment criterion predicts the spatial scale at which this behavior should occur, but does not by itself guarantee non-trivial fluctuations at that scale. In this paper, we show that the averaging process provides an instance in which this criterion is not sharp: because of a degeneracy in the update mechanism, the actual KPZ limit appears only beyond the predicted scale. The relevant critical contribution arises from the interplay of two distinct fluctuation mechanisms, a phenomenon that appears to be rather special within the RWRE setting. Our proof builds on Dobrushin-type local-time limit theorems for zero-sum additive functionals, refined estimates for tilted $k$-point motions, and the recent moment-based axiomatic characterization of Cole--Hopf solutions to the one-dimensional KPZ equation. We also identify the behavior on the two sides of the critical scale, thereby sharply separating the subcritical, critical, and supercritical regimes of the model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hindy Drillick, Shalin Parekh, Federico Sau. 2026-07-23. The critical KPZ scale for the Averaging Process. https://arxiv.org/abs/2607.21443

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