SearcharxivSearch

arXiv · 2107.06350

Shift-Invariance of the Colored TASEP and Finishing Times of the Oriented Swap Process

Abstract

We prove a new shift-invariance property of the colored TASEP. From the shift-invariance of the colored stochastic six-vertex model (proved in Borodin-Gorin-Wheeler or Galashin), one can get a shift-invariance property of the colored TASEP at one time, and our result generalizes this to multiple times. Our proof takes the single-time shift-invariance as an input, and uses analyticity of the probability functions and induction arguments. We apply our shift-invariance to prove a distributional identity between the finishing times of the oriented swap process and the point-to-line passage times in exponential last-passage percolation, which is conjectured by Bisi-Cunden-Gibbons-Romik and Bufetov-Gorin-Romik, and is also equivalent to a purely combinatorial identity related to the Edelman-Greene correspondence. With known results from last-passage percolation, we also get new asymptotic results on the colored TASEP and the finishing times of the oriented swap process.

Explore related subjects

Keep this discovery

BibTeXRIS

Lingfu Zhang. 2021-07-13. Shift-Invariance of the Colored TASEP and Finishing Times of the Oriented Swap Process. https://arxiv.org/abs/2107.06350

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