ﻻ يوجد ملخص باللغة العربية
We study mixing times for the totally asymmetric simple exclusion process (TASEP) on a segment of size $N$ with open boundaries. We focus on the maximal current phase, and prove that the mixing time is of order $N^{3/2}$, up to logarithmic corrections. In the triple point, where the TASEP with open boundaries approaches the Uniform distribution on the state space, we show that the mixing time is precisely of order $N^{3/2}$. This is conjectured to be the correct order of the mixing time for a wide range of particle systems with maximal current. Our arguments rely on a connection to last-passage percolation, and recent results on moderate deviations of last-passage times.
We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well as on the
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.
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.
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 consider TASEP in continuous time with non-random initial conditions and arbitrary fixed density of particles rho. We show GOE Tracy-Widom universality of the one-point fluctuations of the associated height function. The result phrased in last pas