Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
From MaRDI portal
Publication:282518
DOI10.1214/15-AOP1004zbMath1408.60061arXiv1309.3873MaRDI QIDQ282518
Publication date: 12 May 2016
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.3873
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Lattice dynamics and infinite-dimensional dissipative dynamical systems (37L60)
Related Items
An adjacent-swap Markov chain on coalescent trees ⋮ Mixing times for the simple exclusion process in ballistic random environment ⋮ Spectral gap and cutoff phenomenon for the Gibbs sampler of \(\nabla \varphi\) interfaces with convex potential ⋮ Cutoff profiles for quantum Lévy processes and quantum random transpositions ⋮ Mixing time and cutoff for the weakly asymmetric simple exclusion process ⋮ Shuffling cards by spatial motion ⋮ Cutoff for the mean-field zero-range process with bounded monotone rates ⋮ A real-world Markov chain arising in recreational volleyball ⋮ The mixing time of the Lozenge tiling Glauber dynamics ⋮ Mixing times of Markov chains for self‐organizing lists and biased permutations ⋮ Universal cutoff for Dyson Ornstein Uhlenbeck process ⋮ Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling ⋮ Mixing of the averaging process and its discrete dual on finite-dimensional geometries ⋮ Mixing times for the simple exclusion process with open boundaries ⋮ The mean-field zero-range process with unbounded monotone rates: mixing time, cutoff, and Poincaré constant ⋮ Mixing times for the TASEP in the maximal current phase ⋮ Large deviations for the interchange process on the interval and incompressible flows ⋮ Mixing time and cutoff for one-dimensional particle systems ⋮ Mixing time for the asymmetric simple exclusion process in a random environment ⋮ Cutoff profile of the metropolis biased card shuffling ⋮ Universality of cutoff for exclusion with reservoirs ⋮ Cutoff for the Glauber dynamics of the lattice free field ⋮ Scaling limits for Rudvalis card shuffles ⋮ Cutoff for the non reversible SSEP with reservoirs ⋮ Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations ⋮ Unnamed Item ⋮ Exponentially slow mixing and hitting times of rare events for a reaction--diffusion model ⋮ Mixing time of the adjacent walk on the simplex ⋮ The exclusion process mixes (almost) faster than independent particles ⋮ The interchange process on high-dimensional products ⋮ Cutoff for a one-sided transposition shuffle ⋮ Mixing of the exclusion process with small bias ⋮ Convergence to equilibrium for a directed \((1+d)\)-dimensional polymer ⋮ Cutoff for the mean-field zero-range process ⋮ The full spectrum of random walks on complete finite \(d\)-ary trees ⋮ Cutoff for the cyclic adjacent transposition shuffle ⋮ Mixing times for exclusion processes on hypergraphs ⋮ Cutoff for polymer pinning dynamics in the repulsive phase ⋮ A version of Aldous' spectral-gap conjecture for the zero range process ⋮ Metastability for expanding bubbles on a sticky substrate ⋮ Fick's law in a random lattice Lorentz gas
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Can extra updates delay mixing?
- Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
- Interacting particle systems. With a new postface.
- A strong uniform time for random transpositions
- The mixing time for simple exclusion
- Trailing the dovetail shuffle to its lair
- Correlation inequalities on some partially ordered sets
- Mixing times of lozenge tiling and card shuffling Markov chains
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Zero-temperature 2D stochastic Ising model and anisotropic curve-shortening flow
- The simple exclusion process on the circle has a diffusive cutoff window
- Cutoff phenomenon for the simple exclusion process on the complete graph
- Generating a random permutation with random transpositions
- Optimal Transport
