Abstract
In this article, we continue the combinatorial study of models of particles jumping on a row of cells which we initiated with the standard totally asymmetric simple exclusion process or TASEP (Duchi and Schaeffer, Journal of Combinatorial Theory, Series A, 110 (2005), 1-29). We consider here the parallel TASEP, in which particles can jump simultaneously. On the one hand, the interest in this process comes from highway traffic modeling: it is the only solvable special case of the Nagel-Schreckenberg automaton, the most popular model in that context. On the other hand, the parallel TASEP is of some theoretical interest because the derivation of its stationary distribution, as appearing in the physics literature, is harder than that of the standard TASEP. We offer here an elementary derivation that extends the combinatorial approach we developed for the standard TASEP. In particular, we show that this stationary distribution can be expressed in terms.
| Original language | English |
|---|---|
| Pages (from-to) | 434-451 |
| Number of pages | 18 |
| Journal | Random Structures and Algorithms |
| Volume | 33 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Dec 2008 |
Keywords
- Catalan numbers
- Combinatorial interpretation
- Discrete Markov chain
- Stationary distribution
Fingerprint
Dive into the research topics of 'A combinatorial approach to jumping particles: The parallel TASEP'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver