SearcharxivSearch

arXiv · 2402.00265

Limits of Random Motzkin paths with KPZ related asymptotics

Abstract

We study Motzkin paths of length $L$ with general weights on the edges and end points. We investigate the limit behavior of the initial and final segments of the random Motzkin path viewed as a pair of processes starting from each of the two end points as $L$ becomes large. We then study macroscopic limits of the resulting processes, where in two different regimes we obtain Markov processes that appeared in the description of the stationary measure for the KPZ equation on the half line and of conjectural stationary measure of the hypothetical KPZ fixed point on the half line. Our results rely on the behavior of the Al-Salam--Chihara polynomials in the neighbourhood of the upper end of their orthogonality interval and on the limiting properties of the $q$-Pochhammer and $q$-Gamma functions as $q\nearrow 1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Wlodzimierz Bryc, Alexey Kuznetsov, Jacek Wesolowski. 2024-02-01. Limits of Random Motzkin paths with KPZ related asymptotics. https://doi.org/10.1093/imrn%2Frnaf022

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