Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
DOI10.1137/22m148063xOpenAlexW4391574520MaRDI QIDQ6202750
Amanda Pascoe Streib, Sarah Miracle
Publication date: 27 February 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/22m148063x
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
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
- Interaction of Markov processes
- Comparison theorems for reversible Markov chains
- Comparison techniques for random walk on finite groups
- Mixing times of lozenge tiling and card shuffling Markov chains
- Markov chain decomposition for convergence rate analysis
- Mixing of permutations by biased transpositions
- Analyzing Glauber dynamics by comparison of Markov chains
- Markov Chain Algorithms for Planar Lattice Structures
- NON-NULL RANKING MODELS. I
- 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
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
- Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations
This page was built for publication: Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
