# Transfer matrices for the totally asymmetric simple exclusion process

* Corresponding author
Abstract : We consider the totally asymmetric simple exclusion process (TASEP) on a finite lattice with open boundaries. We show, using the recursive structure of the Markov matrix that encodes the dynamics, that there exist two transfer matrices $T_{L−1,L}$ and $\tilde T_{L−1,L}$ that intertwine the Markov matrices of consecutive system sizes:$\tilde T_{L−1,L}$$M_{L−1} = M_LT_{L−1,L}$. This semi-conjugation property of the dynamics provides an algebraic counterpart for the matrix-product representation of the steady state of the process.
Document type :
Journal articles

Cited literature [31 references]

https://hal-cea.archives-ouvertes.fr/cea-02924648
Contributor : Bruno Savelli Connect in order to contact the contributor
Submitted on : Friday, August 28, 2020 - 11:48:30 AM
Last modification on : Monday, December 13, 2021 - 9:16:11 AM
Long-term archiving on: : Sunday, November 29, 2020 - 12:25:00 PM

### File

Woe1.pdf
Files produced by the author(s)

### Citation

Marko Woelki, Kirone Mallick. Transfer matrices for the totally asymmetric simple exclusion process. Journal of Physics A: Mathematical and Theoretical, IOP Publishing, 2010, 43 (18), pp.185003. ⟨10.1088/1751-8113/43/18/185003⟩. ⟨cea-02924648⟩

Record views