Multi-floor Generalization of TASEP

Abstract We consider an interacting particle system, which generalizes the classical totally asymmetric simple exclusion process (TASEP), in that each site can contain up to a fixed finite number of particles, and the particle movement is governed by a back-pressure (BP) algorithm (also often called MaxWeight ). There are N sites (with N finite or infinite), each may contain at most c particles, $$1 \le c &lt; \infty $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>≤</mml:mo> <mml:mi>c</mml:mi> <mml:mo>&lt;</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> . New particles enter the system at the left-most site 1 as a Poisson process of rate $$\alpha \le 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>α</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , unless site 1 has c particles. Particles (if any) are removed from the right-most site N as a Poisson process of rate $$\beta \le 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>β</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> . The left-to-right movement of particles between neighboring sites is governed by the BP rule: one particle moves from site n to $$n+1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> at epochs of a rate 1 Poisson process, as long as the former site has strictly more particles than the latter. When $$c=1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>c</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , this is the standard TASEP. Our main results address the asymptotics of the stationary distribution of a finite system, and especially the limit of the flux (current) as $$N\rightarrow \infty $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>→</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> . In particular, we prove that interesting non-trivial phase transitions take place in a system with $$c&gt;1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>c</mml:mi> <mml:mo>&gt;</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> . For example, if $$c&gt;1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>c</mml:mi> <mml:mo>&gt;</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> and $$1/2 \le \beta \le 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> <mml:mo>≤</mml:mo> <mml:mi>β</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , the maximum limiting flux 1/4 is achieved as long as $$\alpha \ge \alpha _c^*$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>α</mml:mi> <mml:mo>≥</mml:mo> <mml:msubsup> <mml:mi>α</mml:mi> <mml:mi>c</mml:mi> <mml:mo>∗</mml:mo> </mml:msubsup> </mml:mrow> </mml:math> , where $$\alpha _c^* &lt; 1/2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msubsup> <mml:mi>α</mml:mi> <mml:mi>c</mml:mi> <mml:mo>∗</mml:mo> </mml:msubsup> <mml:mo>&lt;</mml:mo> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> is some non-trivial threshold. (For the standard TASEP the threshold is 1/2.) We also put forward a general conjecture about the stationary distribution asymptotics under an arbitrary parameter setting. We illustrate our formal results and the conjecture by simulations, and identify interesting directions for further research.

Authors

Institutions

Publication Details

Journal
Journal of Statistical Physics
Published
2026-07-30
DOI
https://doi.org/10.1007/s10955-026-03671-6
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-floor Generalization of TASEP

Alexander Stolyar, Y. Baryshnikov
Journal of Statistical Physics
Stochastic processes and statistical mechanics
article

Multi-floor Generalization of TASEP

Alexander Stolyar, Y. Baryshnikov
article en

Abstract

Abstract We consider an interacting particle system, which generalizes the classical totally asymmetric simple exclusion process (TASEP), in that each site can contain up to a fixed finite number of particles, and the particle movement is governed by a back-pressure (BP) algorithm (also often called MaxWeight ). There are N sites (with N finite or infinite), each may contain at most c particles, $$1 \le c &lt; \infty $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>≤</mml:mo> <mml:mi>c</mml:mi> <mml:mo>&lt;</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> . New particles enter the system at the left-most site 1 as a Poisson process of rate $$\alpha \le 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>α</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , unless site 1 has c particles. Particles (if any) are removed from the right-most site N as a Poisson process of rate $$\beta \le 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>β</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> . The left-to-right movement of particles between neighboring sites is governed by the BP rule: one particle moves from site n to $$n+1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> at epochs of a rate 1 Poisson process, as long as the former site has strictly more particles than the latter. When $$c=1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>c</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , this is the standard TASEP. Our main results address the asymptotics of the stationary distribution of a finite system, and especially the limit of the flux (current) as $$N\rightarrow \infty $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>→</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> . In particular, we prove that interesting non-trivial phase transitions take place in a system with $$c&gt;1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>c</mml:mi> <mml:mo>&gt;</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> . For example, if $$c&gt;1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>c</mml:mi> <mml:mo>&gt;</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> and $$1/2 \le \beta \le 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> <mml:mo>≤</mml:mo> <mml:mi>β</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , the maximum limiting flux 1/4 is achieved as long as $$\alpha \ge \alpha _c^*$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>α</mml:mi> <mml:mo>≥</mml:mo> <mml:msubsup> <mml:mi>α</mml:mi> <mml:mi>c</mml:mi> <mml:mo>∗</mml:mo> </mml:msubsup> </mml:mrow> </mml:math> , where $$\alpha _c^* &lt; 1/2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msubsup> <mml:mi>α</mml:mi> <mml:mi>c</mml:mi> <mml:mo>∗</mml:mo> </mml:msubsup> <mml:mo>&lt;</mml:mo> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> is some non-trivial threshold. (For the standard TASEP the threshold is 1/2.) We also put forward a general conjecture about the stationary distribution asymptotics under an arbitrary parameter setting. We illustrate our formal results and the conjecture by simulations, and identify interesting directions for further research.

Journal of Statistical PhysicsVol. 193(8)
University of Illinois Urbana-Champaign (US), Urbana University (US)
Reduced inequalities
Openalex Percentile: Top 4%
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.