Spectral Gap for Random-to-Random Shuffling on Linear Extensions

DOI10.1080/10586458.2015.1107868zbMath1360.60133arXiv1412.7488OpenAlexW3100041946MaRDI QIDQ2969993

Anne Schilling, Arvind Ayyer, Nicolas Marc Thiéry

Publication date: 24 March 2017

Published in: Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

posetsspectral gapmixing timesecond largest eigenvaluelinear extensionsdiscrete Markov chainrandom-to-random shuffling

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Related Items (4)

Total variation cutoff for the flip-transpose top with random shuffle ⋮ Spectral analysis of random-to-random Markov chains ⋮ THE EXPECTED JAGGEDNESS OF ORDER IDEALS ⋮ Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets

Cites Work

• An interlacing theorem for eigenvalues of self-adjoint operators
• Faster random generation of linear extensions
• Combinatorial Markov chains on linear extensions
• Proof of Aldous’ spectral gap conjecture
• Unnamed Item

This page was built for publication: Spectral Gap for Random-to-Random Shuffling on Linear Extensions