Mixing times for the interchange process

zbMath1290.60071arXiv1210.6916MaRDI QIDQ2863811

Johan Jonasson

Publication date: 4 December 2013

Full work available at URL: https://arxiv.org/abs/1210.6916

zbMATH Keywords

electrical networkrandom graphcard shufflingcomparison techniqueWilson's technique

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (8)

SPEck: mining statistically-significant sequential patterns efficiently with exact sampling ⋮ Mixing of the averaging process and its discrete dual on finite-dimensional geometries ⋮ The exclusion process mixes (almost) faster than independent particles ⋮ The interchange process on high-dimensional products ⋮ Comparing with octopi ⋮ The full spectrum of random walks on complete finite \(d\)-ary trees ⋮ A sharp log-Sobolev inequality for the multislice ⋮ A version of Aldous' spectral-gap conjecture for the zero range process

This page was built for publication: Mixing times for the interchange process