ﻻ يوجد ملخص باللغة العربية
In the multi-type totally asymmetric simple exclusion process (TASEP) on the line, each site of Z is occupied by a particle labeled with some number, and two neighboring particles are interchanged at rate one if their labels are in increasing order. Consider the process with the initial configuration where each particle is labeled by its position. It is known that in this case a.s. each particle has an asymptotic speed which is distributed uniformly on [-1,1]. We study the joint distribution of these speeds: the TASEP speed process. We prove that the TASEP speed process is stationary with respect to the multi-type TASEP dynamics. Consequently, every ergodic stationary measure is given as a projection of the speed process measure. This generalizes previous descriptions restricted to finitely many classes. By combining this result with known stationary measures for TASEPs with finitely many types, we compute several marginals of the speed process, including the joint density of two and three consecutive speeds. One striking property of the distribution is that two speeds are equal with positive probability and for any given particle there are infinitely many others with the same speed. We also study the partially asymmetric simple exclusion process (ASEP). We prove that the states of the ASEP with the above initial configuration, seen as permutations of Z, are symmetric in distribution. This allows us to extend some of our results, including the stationarity and description of all ergodic stationary measures, also to the ASEP.
In [AAV] Amir, Angel and Valk{o} studied a multi-type version of the totally asymmetric simple exclusion process (TASEP) and introduced the TASEP speed process, which allowed them to answer delicate questions about the joint distribution of the speed
We study the totally asymmetric simple exclusion process (TASEP) on trees where particles are generated at the root. Particles can only jump away from the root, and they jump from $x$ to $y$ at rate $r_{x,y}$ provided $y$ is empty. Starting from the
We provide a direct and elementary proof that the formula obtained in [MQR17] for the TASEP transition probabilities for general (one-sided) initial data solves the Kolmogorov backward equation. The same method yields the solution for the related PushASEP particle system.
Recently Johansson and Rahman obtained the limiting multi-time distribution for the discrete polynuclear growth model, which is equivalent to discrete TASEP model with step initial condition. In this paper, we obtain a finite time multi-point distrib
We consider the one-dimensional totally asymmetric simple exclusion process with an arbitrary initial condition in a spatially periodic domain, and obtain explicit formulas for the multi-point distributions in the space-time plane. The formulas are g