The combinatorics of hopping particles and positivity in Markov chains
From MaRDI portal
Publication:5078699
Abstract: The asymmetric simple exclusion process (ASEP) is a model for translation in protein synthesis and traffic flow; it can be defined as a Markov chain describing particles hopping on a one-dimensional lattice. In this article I give an overview of some of the connections of the stationary distribution of the ASEP to combinatorics (tableaux and multiline queues) and special functions (Askey-Wilson polynomials, Macdonald polynomials, and Schubert polynomials). I also make some general observations about positivity in Markov chains.
Recommendations
- A Hopf-power Markov chain on compositions
- scientific article; zbMATH DE number 4026482
- scientific article; zbMATH DE number 4064192
- A combinatorial approach to jumping particles: The parallel TASEP
- scientific article; zbMATH DE number 5018838
- scientific article; zbMATH DE number 17014
- Random walks on the Comb model and its generalizations
- scientific article; zbMATH DE number 2127751
- Total positivity in Markov structures
- Combinatiorial Markov chains
Cited in
(4)- Combinatorics of the 2-species exclusion processes, marked Laguerre histories, and partially signed permutations
- Approximating the stationary distribution of the ASEP with open boundaries
- Some recent progress on the stationary measure for the open KPZ equation
- Combinatorics of the asymmetric exclusion process on a semi-infinite lattice
This page was built for publication: The combinatorics of hopping particles and positivity in Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5078699)
