Mixing times of Markov chains for self‐organizing lists and biased permutations
From MaRDI portal
Publication:6052471
DOI10.1002/rsa.21082zbMath1523.60123OpenAlexW4225256716MaRDI QIDQ6052471
Prateek Bhakta, Dana Randall, Sarah Miracle, Amanda Pascoe Streib
Publication date: 17 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.21082
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- Mixing of the exclusion process with small bias
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Comparison theorems for reversible Markov chains
- Comparison techniques for random walk on finite groups
- Mixing times of lozenge tiling and card shuffling Markov chains
- Rapid mixing of \(k\)-class biased permutations
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- Analyzing Glauber dynamics by comparison of Markov chains
- Generating a random permutation with random transpositions
- Mixing of Permutations by Biased Transposition
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations
This page was built for publication: Mixing times of Markov chains for self‐organizing lists and biased permutations