Abstract

We consider the totally asymmetric simple exclusion process 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 TL − 1, L and that intertwine the Markov matrices of consecutive system sizes: . This semi-conjugation property of the dynamics provides an algebraic counterpart for the matrix-product representation of the steady state of the process.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.