Combinatorics of the asymmetric exclusion process on a semi-infinite lattice

DOI10.4310/JOC.2014.V5.N4.A1MaRDI QIDQ2345756zbMATH OpenFDO

Authors Tomohiro Sasamoto, Lauren K. Williams

Publication date 20 May 2015

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.1114

zbMATH Keywords

asymmetric exclusion processMarkov processsemi-infinite latticestaircase tableaustationary measure

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We study two versions of the asymmetric exclusion process (ASEP) -- an ASEP on a semi-infinite lattice with an open left boundary, and an ASEP on a finite lattice with open left and right boundaries -- and we demonstrate a surprising relationship between their stationary measures. The semi-infinite ASEP was first studied by Liggett and then Grosskinsky, while the finite ASEP had been introduced earlier by Spitzer and Macdonald-Gibbs-Pipkin. We show that the finite correlation functions involving the first L sites for the stationary measures on the semi-infinite ASEP can be obtained as a nonphysical specialization of the stationary distribution of an ASEP on a finite one-dimensional lattice with L sites. Namely, if the output and input rates of particles at the right boundary of the finite ASEP are beta and delta, respectively, and we set delta=-beta, then this specialization corresponds to sending the right boundary of the lattice to infinity. Combining this observation with work of the second author and Corteel, we obtain a combinatorial formula for finite correlation functions of the ASEP on a semi-infinite lattice.

Review text

The asymmetric exclusion process is a Markov process in which particles hop on a lattice, subject to the condition that there is at most one particle per site. The paper under review studies two versions of this process: on a semi-infinite lattice \(\mathbb Z^+\), and on a finite interval in \(\mathbb Z\). In each case one specifies rates at which particles move left or right, or enter and exit at the boundaries. The main results concern the stationary measures for these models, which admit combinatorial formulæ in terms of staircase tableaux. The paper appears to be carefully written and referenced, and is focussed on proving its main results and as such is directed at experts. The relative outsider is not likely to be drawn into the subject by this paper. On the other hand, the references provide plenty of background, so this should not be taken as a criticism.

Recommendations

• Cylindric rhombic tableaux and the two-species ASEP on a ring
• The combinatorics of hopping particles and positivity in Markov chains
• Tableaux combinatorics for the asymmetric exclusion process
• Staircase tableaux and an alternative matrix formula for steady state probabilities in the asymmetric exclusion process (q=1)

Cited in

(11)

• Stochastic six-vertex model in a half-quadrant and half-line open asymmetric simple exclusion process
• 2-species exclusion processes and combinatorial algebras
• The semi-infinite asymmetric exclusion process: large deviations via matrix products
• The TASEP on Galton-Watson trees
• Asymmetric simple exclusion process with open boundaries and quadratic harnesses
• Asymptotic normality of the number of corners in tableaux associated with the partially asymmetric simple exclusion process
• The asymmetric simple exclusion process with an open boundary
• Approximating the stationary distribution of the ASEP with open boundaries
• Limits of open ASEP stationary measures near a boundary
• The open ASEP with light particles
• Combinatorics of the 2-species exclusion processes, marked Laguerre histories, and partially signed permutations

This page was built for publication: Combinatorics of the asymmetric exclusion process on a semi-infinite lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345756)