The oriented swap process
Particles labeled 1\(,\dots,n\) are initially arranged in increasing order. Later each pair of neighboring particles which is in increasing order swaps according to a Poisson process of unit rate. It is shown that the trajectories of the particles converge to a family of random curves. It is shown also that random permutation which defines the system pattern, converges to a deterministic limit. The model is generalized in the form of an infinite oriented swap process, one then considers the totally asymmetric simple exclusion process (TASEP), from where one switches to the hydrodynamic limit.
- Asymptotics of Plancherel measures for symmetric groups
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- Hydrodynamic limit for attractive particle systems on \(\mathbb{Z}{}^ d\)
- Hydrodynamics and large deviation for simple exclusion processes
- Level-spacing distributions and the Airy kernel
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- Non-equilibrium behaviour of a many particle process: Density profile and local equilibria
- On the distribution of the length of the longest increasing subsequence of random permutations
- Random sorting networks
- Second class particles in the rarefaction fan
- Shape fluctuations and random matrices
- The motion of a second class particle for the TASEP starting from a decreasing shock profile
- The TASEP speed process
- On collisions times of `self-sorting' interacting particles in one-dimension with random initial positions and velocities
- Color-position symmetry in interacting particle systems
- Symmetries of stochastic colored vertex models
- Shock fluctuations in TASEP under a variety of time scalings
- Absorbing time asymptotics in the oriented swap process
- Cutoff profile of ASEP on a segment
- Coxeter group actions on interacting particle systems
- Sorting networks, staircase Young tableaux, and last passage percolation
- Random sorting networks: local statistics via random matrix laws
- Jeu de taquin dynamics on infinite Young tableaux and second class particles
- Shift-invariance of the colored TASEP and finishing times of the oriented swap process
- The ASEP speed process
- The Archimedean limit of random sorting networks
- Circular support in random sorting networks
- Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
- TASEP speed process: an effective medium approach
- The oriented swap process and last passage percolation
- Cutoff profile of the metropolis biased card shuffling
- Mallows product measure
- Tagged particle fluctuations for TASEP with dynamics restricted by a moving wall
- Shift invariance of half space integrable models
- From pinned billiard balls to partial differential equations
- Grothendieck shenanigans: permutons from pipe dreams via integrable probability
- TASEP with a general initial condition and a deterministically moving wall
- The TASEP speed process
- A convergence framework for \(\mathrm{Airy}_\beta\) line ensemble via pole evolution
- The second-class particle in the half-line open totally asymmetric simple exclusion process
This page was built for publication: The oriented swap process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035867)