2004
DOI: 10.1103/physreve.69.066136
|View full text |Cite
|
Sign up to set email alerts
|

Generalized determinant solution of the discrete-time totally asymmetric exclusion process and zero-range process

Abstract: We consider the discrete-time evolution of a finite number of particles obeying the totally asymmetric exclusion process with backward-ordered update on an infinite chain. Our first result is a determinant expression for the conditional probability of finding the particles at given initial and final positions, provided that they start and finish simultaneously. The expression has the same form as the one obtained by J. Stat. Phys. 88, 427 (1997)] for the continuous-time process. Next we prove that under some s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
37
0
2

Year Published

2005
2005
2022
2022

Publication Types

Select...
9

Relationship

3
6

Authors

Journals

citations
Cited by 28 publications
(39 citation statements)
references
References 37 publications
0
37
0
2
Order By: Relevance
“…Some other updates that we will not discuss further here have been proposed, such as sequential update ordered backward or forward in space [45,55,54,291,116] or sublattice update [158,121,287,290]. They can be seen as particular realisations of the frozen shuffle update.…”
Section: Update Schemementioning
confidence: 99%
“…Some other updates that we will not discuss further here have been proposed, such as sequential update ordered backward or forward in space [45,55,54,291,116] or sublattice update [158,121,287,290]. They can be seen as particular realisations of the frozen shuffle update.…”
Section: Update Schemementioning
confidence: 99%
“…Of course, it is independent of t 0 because of the time shift invariance. It is essential that determinant form (4) of G t (x | x 0 ) generalizes to the GGF (also see [24]). N -point configurations (x, t) and (x 0 , t 0 ) be given such that t i > t 0 i for i = 1, .…”
Section: Proposition 31 the Gf Has The Determinant Formmentioning
confidence: 99%
“…For this, we introduce a generalized GF (GGF) [24], which can be explained using the language of nonintersecting lattice paths. We consider the two-dimensional integer lattice L = Z 2 .…”
Section: Proposition 31 the Gf Has The Determinant Formmentioning
confidence: 99%
“…It follows easily from (2) that F GUE(n) (η) = det(D j−i+1 φ 1/2 (η)) 1≤i,j≤n . (4) This formula, given in [18], can also be obtained directly from the GUE eigenvalue measure, see Proposition 2.3 below.…”
Section: Introductionmentioning
confidence: 96%