SearcharxivSearch

arXiv · 2006.15934

Two-point convergence of the stochastic six-vertex model to the Airy process

Abstract

In this paper we consider the stochastic six-vertex model in the quadrant started with step initial data. After a long time $T$, it is known that the one-point height function fluctuations are of order $T^{1/3}$ and governed by the Tracy-Widom distribution. We prove that the two-point distribution of the height function, rescaled horizontally by $T^{2/3}$ and vertically by $T^{1/3}$, converges to the two-point distribution of the Airy process. The starting point of this result is a recent connection discovered by Borodin-Bufetov-Wheeler between the stochastic six-vertex model and the ascending Hall-Littlewood process (a certain measure on plane partitions). Using the Macdonald difference operators, we obtain formulas for two-point observables for the ascending Hall-Littlewood process, which for the six-vertex model give access to the joint cumulative distribution function for its height function. A careful asymptotic analysis of these observables gives the two-point convergence result under certain restrictions on the parameters of the model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Evgeni Dimitrov. 2021-12-03. Two-point convergence of the stochastic six-vertex model to the Airy process. https://arxiv.org/abs/2006.15934

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