SearcharxivSearch

arXiv · 1911.09426

KPZ statistics of second class particles in ASEP via mixing

Abstract

We consider the asymmetric simple exclusion process on $\mathbb{Z}$ with a single second class particle initially at the origin. The first class particles form two rarefaction fans which come together at the origin, where the large time density jumps from $0$ to $1$. We are interested in $X(t)$, the position of the second class particle at time $t$. We show that, under the KPZ $1/3$ scaling, $X(t)$ is asymptotically distributed as the difference of two independent, $\mathrm{GUE}$-distributed random variables.The key part of the proof is to show that $X(t)$ equals, up to a negligible term, the difference of a random number of holes and particles, with the randomness built up by ASEP itself. This provides a KPZ analogue to the 1994 result of Ferrari and Fontes \cite{FF94b}, where this randomness comes from the initial data and leads to Gaussian limit laws.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Nejjar. 2019-11-21. KPZ statistics of second class particles in ASEP via mixing. https://doi.org/10.1007/s00220-020-03782-5

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