Perfect shuffling by lazy swaps

DOI10.1214/18-ECP151zbMath1393.05004arXiv1802.05200MaRDI QIDQ1663759

Omer Angel, Alexander E. Holroyd

Publication date: 23 August 2018

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

transpositionrandom permutationreduced wordsorting networkshufflingperfect mixing

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (2)

Partial Shuffles by Lazy Swaps ⋮ Cutoff for the cyclic adjacent transposition shuffle

Cites Work

• Relating Edelman-Greene insertion to the Little map
• Some circumstances where extra updates can delay mixing
• On the number of reduced decompositions of elements of Coxeter groups
• Balanced tableaux
• Random sorting networks
• Negative dependence and the geometry of polynomials
• On Square Roots of the Uniform Distribution on Compact Groups
• The Representation of Hypergeometric Random Variables using Independent Bernoulli Random Variables
• A Permutation Network
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect shuffling by lazy swaps