A strong uniform time for random transpositions

DOI10.1007/BF01048728MaRDI QIDQ753282zbMATH OpenFDO

Authors D. Kharzeev

Publication date 1988

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

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

zbMATH Keywords

deck of cardsmethod of strong uniform timeuniform distribution

Mathematics Subject Classification ID

Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Review text

The author considers a deck of cards. At each step two cards are chosen by the left and right hands and transposed. After a large number k of steps the distribution \(\mu^ k\) of the resulting permutation is close to the uniform distribution \({\mathcal U}\). The author gives sharp upper and lower bounds for the distance between \(\mu^ k\) and \({\mathcal U}\), using the method of strong uniform time introduced by Aldous and Diaconis.

Recommendations

• Strong uniform times and finite random walks
• On strongly equivalent nonrandomized transition probabilities
• Limit profile for random transpositions
• On large deviations for uniformly strong mixing sequences
• Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
• Improved bounds for the mixing time of the random-to-random shuffle
• Tightness bounds for strongly mixing random sequences
• On some transformations of random sequences

Cites work

• Generating a random permutation with random transpositions
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3812655 (Why is no real title available?)
• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• Shuffling Cards and Stopping Times

Cited in

(11)

• Markov chains for Monte Carlo tests of genetic equilibrium in multidimensional contingency tables
• Rate of convergence for shuffling cards by transpositions
• Perfect shuffling by lazy swaps
• A sharp log-Sobolev inequality for the multislice
• Limit profile for random transpositions
• Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
• Partial Shuffles by Lazy Swaps
• Comparing limit profiles of reversible Markov chains
• On the diameters of friends-and-strangers graphs
• Representation theory and cycle statistics for random walks on the symmetric group
• Cutoff for the biased random transposition shuffle

This page was built for publication: A strong uniform time for random transpositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753282)