SearcharxivSearch

arXiv · 1111.0575

Jeu de taquin dynamics on infinite Young tableaux and second class particles

Abstract

We study an infinite version of the "jeu de taquin" sliding game, which can be thought of as a natural measure-preserving transformation on the set of infinite Young tableaux equipped with the Plancherel probability measure. We use methods from representation theory to show that the Robinson-Schensted-Knuth ($\operatorname {RSK}$) algorithm gives an isomorphism between this measure-preserving dynamical system and the one-sided shift dynamics on a sequence of independent and identically distributed random variables distributed uniformly on the unit interval. We also show that the jeu de taquin paths induced by the transformation are asymptotically straight lines emanating from the origin in a random direction whose distribution is computed explicitly, and show that this result can be interpreted as a statement on the limiting speed of a second-class particle in the Plancherel-TASEP particle system (a variant of the Totally Asymmetric Simple Exclusion Process associated with Plancherel growth), in analogy with earlier results for second class particles in the ordinary TASEP.

Explore related subjects

Keep this discovery

BibTeXRIS

Dan Romik, Piotr Śniady. 2011-11-02. Jeu de taquin dynamics on infinite Young tableaux and second class particles. https://doi.org/10.1214/13-aop873

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