Rapid Mixing of k-Class Biased Permutations
DOI10.1137/22M148063XOpenAlexW4391574520MaRDI QIDQ6202750FDOQ6202750
Authors: Sarah Miracle, Amanda Pascoe Streib 
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
Recommendations
- Rapid mixing of \(k\)-class biased permutations
- Mixing times of Markov chains for self-organizing lists and biased permutations
- Mixing times of Markov chains for self‐organizing lists and biased permutations
- Mixing of permutations by biased transpositions
- Mixing of permutations by biased transposition
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- An exponential model for infinite rankings
- NON-NULL RANKING MODELS. I
- Title not available (Why is that?)
- Generating a random permutation with random transpositions
- Interaction of Markov processes
- Markov chain algorithms for planar lattice structures
- Title not available (Why is that?)
- Markov chain decomposition for convergence rate analysis
- Mixing times of lozenge tiling and card shuffling Markov chains
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- Comparison techniques for random walk on finite groups
- Comparison theorems for reversible Markov chains
- Analyzing Glauber dynamics by comparison of Markov chains
- Title not available (Why is that?)
- Sampling biased lattice configurations using exponential metrics
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- Mixing of the exclusion process with small bias
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
- Mixing times of Markov chains for self-organizing lists and biased permutations
- Mixing of permutations by biased transpositions
- Mixing of permutations by biased transposition
- Title not available (Why is that?)
This page was built for publication: Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202750)
