Rapid Mixing of k-Class Biased Permutations
From MaRDI portal
Publication:6202750
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)
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
Cites work
- scientific article; zbMATH DE number 420886 (Why is no real title available?)
- scientific article; zbMATH DE number 3812655 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 7758305 (Why is no real title available?)
- An exponential model for infinite rankings
- Analyzing Glauber dynamics by comparison of Markov chains
- Comparison techniques for random walk on finite groups
- Comparison theorems for reversible Markov chains
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
- Generating a random permutation with random transpositions
- Interaction of Markov processes
- Markov chain algorithms for planar lattice structures
- Markov chain decomposition for convergence rate analysis
- Mixing of permutations by biased transposition
- Mixing of permutations by biased transpositions
- Mixing of the exclusion process with small bias
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- Mixing times of Markov chains for self-organizing lists and biased permutations
- Mixing times of lozenge tiling and card shuffling Markov chains
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- NON-NULL RANKING MODELS. I
- Sampling biased lattice configurations using exponential metrics
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)
