Mixing of permutations by biased transpositions
From MaRDI portal
Publication:2321931
DOI10.1007/S00224-018-9899-5zbMATH Open1430.60060OpenAlexW2963420018WikidataQ128896416 ScholiaQ128896416MaRDI QIDQ2321931FDOQ2321931
Authors: Shahrzad Haddadan, Peter Winkler
Publication date: 27 August 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-018-9899-5
Recommendations
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- NON-NULL RANKING MODELS. I
- Trailing the dovetail shuffle to its lair
- Generating a random permutation with random transpositions
- On self-organizing sequential search heuristics
- Mixing times of lozenge tiling and card shuffling Markov chains
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- The mixing time for simple exclusion
- Approximating the Permanent
- Comparison techniques for random walk on finite groups
- Analyzing Glauber dynamics by comparison of Markov chains
- Title not available (Why is that?)
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
- Title not available (Why is that?)
- Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations
- Rapid mixing of \(k\)-class biased permutations
- Mixing of Permutations by Biased Transposition
Cited In (2)
This page was built for publication: Mixing of permutations by biased transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321931)