A strong uniform time for random transpositions
From MaRDI portal
Publication:753282
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
- 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?)
- Generating a random permutation with random transpositions
- Shuffling Cards and Stopping Times
Cited in
(8)- Partial Shuffles by Lazy Swaps
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- Markov chains for Monte Carlo tests of genetic equilibrium in multidimensional contingency tables
- Comparing limit profiles of reversible Markov chains
- Limit profile for random transpositions
- A sharp log-Sobolev inequality for the multislice
- On the diameters of friends-and-strangers graphs
- Perfect shuffling by lazy swaps
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)
