A strong uniform time for random transpositions

DOI10.1007/BF01048728zbMATH Open0716.60074MaRDI QIDQ753282FDOQ753282

Authors: D. Kharzeev 

Publication date: 1988

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

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

zbMATH Keywords

uniform distributiondeck of cardsmethod of strong uniform time

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Shuffling Cards and Stopping Times
• Generating a random permutation with random transpositions
• Title not available (Why is that?)

Cited In (7)

• Markov chains for Monte Carlo tests of genetic equilibrium in multidimensional contingency tables
• Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
• On the diameters of friends-and-strangers graphs
• Perfect shuffling by lazy swaps
• A sharp log-Sobolev inequality for the multislice
• Limit profile for random transpositions
• Comparing limit profiles of reversible Markov chains

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)