Rate of convergence for shuffling cards by transpositions

DOI10.1007/BF02214260zbMath0878.60043OpenAlexW2318438148MaRDI QIDQ1356617

Shirin J. Handjani, Douglas S. Jungreis

Publication date: 9 June 1997

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02214260

zbMATH Keywords

spectral gapgraphsrandom walkinterchange processshuffling cards

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Eigenvalues of Cayley graphs ⋮ On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions ⋮ Aldous' spectral gap property for normal Cayley graphs on symmetric groups ⋮ Mixing times of lozenge tiling and card shuffling Markov chains ⋮ The second eigenvalue of some normal Cayley graphs of highly transitive groups ⋮ Proof of Aldous’ spectral gap conjecture ⋮ Comparing with octopi ⋮ Quantum crystals and spin chains ⋮ On the spectral gap of some Cayley graphs on the Weyl group \(W(B_n)\) ⋮ A Few Remarks on the Octopus Inequality and Aldous’ Spectral Gap Conjecture

Cites Work

• Random shuffles and group representations
• Comparison techniques for random walk on finite groups
• Exponential \(L_ 2\) convergence of attractive reversible nearest particle systems
• Generating a random permutation with random transpositions