Mixing time of the adjacent walk on the simplex

DOI10.1214/20-AOP1428zbMath1456.60185arXiv1904.01088OpenAlexW2931628324MaRDI QIDQ2212599

Cyril Labbé, Hubert Lacoin, Pietro Caputo

Publication date: 24 November 2020

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

cutoffspectral gapmixing timeadjacent walk

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Interacting particle systems in time-dependent statistical mechanics (82C22) Ergodicity, mixing, rates of mixing (37A25)

Related Items (8)

Spectral gap and cutoff phenomenon for the Gibbs sampler of \(\nabla \varphi\) interfaces with convex potential ⋮ Rates of convergence for Gibbs sampling in the analysis of almost exchangeable data ⋮ Universal cutoff for Dyson Ornstein Uhlenbeck process ⋮ Mixing of the averaging process and its discrete dual on finite-dimensional geometries ⋮ Mixing time and cutoff for one-dimensional particle systems ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
• Total variation and separation cutoffs are not equivalent and neither one implies the other
• Can extra updates delay mixing?
• Interacting particle systems. With a new postface.
• Strong uniform times and finite random walks
• Mixing times of lozenge tiling and card shuffling Markov chains
• Determination of the spectral gap for Kac's master equation and related stochastic evolution.
• Cut-off phenomenon in the uniform plane Kac walk
• Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
• A Gibbs sampler on the \(n\)-simplex
• Analysis of convergence rates of some Gibbs samplers on continuous state spaces
• On the spectral gap of the Kac walk and other binary collision processes
• A random polynomial-time algorithm for approximating the volume of convex bodies
• On Choosing and Bounding Probability Metrics
• The cutoff phenomenon in finite Markov chains.
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• A Characterization of the Gamma Distribution

This page was built for publication: Mixing time of the adjacent walk on the simplex