SearcharxivSearch

arXiv · 2308.16812

Tail estimates for the stationary stochastic six vertex model and ASEP

Abstract

This work studies the tail exponents for the height function of the stationary stochastic six vertex model in the moderate deviations regime. For the upper tail of the height function we find upper and lower bounds of matching order, with a tail exponent of $\frac{3}{2}$, characteristic of KPZ distributions. We also obtain an upper bound for the lower tail of the same order. Our results for the stochastic six vertex model hold under a restriction on the model parameters for which a certain "microscopic concavity" condition holds. Nevertheless, our estimates are sufficiently strong to pass through the degeneration of the stochastic six vertex model to the ASEP. We therefore obtain tail estimates for both the current as well as the location of a second class particle in the ASEP with stationary (Bernoulli) initial data. Our estimates complement the variance bounds obtained in the seminal work of Bal\'azs and Sepp\"al\"ainen.}

Explore related subjects

Keep this discovery

BibTeXRIS

Benjamin Landon, Philippe Sosoe. 2023-08-31. Tail estimates for the stationary stochastic six vertex model and ASEP. https://doi.org/10.2140/pmp.2025.6.1327

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