Random recursive trees and the Bolthausen-Sznitman coalescent.
The jammed phase of the Biham-Middleton-Levine traffic model.
Fragmenting random permutations.
Multiclass Hammersley–Aldous–Diaconis process and multiclass-customer queues
In the Hammersley–Aldous–Diaconis process, infinitely many particles sit in ℝ and at most one particle is allowed at each position. A particle at , whose nearest neighbor to the right is at , jumps at rate − to a position uniformly distributed in the interval (, ). The basic coupling between trajectories with different initial configuration induces a process with different classes of particles. We show that the invariant measures for the two-class process can be obtained as follows. First, a stationary...
Collision probabilities in the rarefaction fan of asymmetric exclusion processes
We consider the one-dimensional asymmetric simple exclusion process (ASEP) in which particles jump to the right at rate ∈(1/2, 1] and to the left at rate 1−, interacting by exclusion. In the initial state there is a finite region such that to the left of this region all sites are occupied and to the right of it all sites are empty. Under this initial state, the hydrodynamical limit of the process converges to the rarefaction fan of the associated Burgers equation. In particular suppose that the...
Page 1