Mixing times of Markov chains for self-organizing lists and biased permutations

DOI10.1137/1.9781611973105.1zbMATH Open1423.60109OpenAlexW4247306430MaRDI QIDQ5741709FDOQ5741709

Authors: Prateek Bhakta, Sarah Miracle, Dana Randall, Amanda Pascoe Streib 

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.1

Recommendations

• Mixing times of Markov chains for self‐organizing lists and biased permutations
• scientific article; zbMATH DE number 1195779
• Rapid mixing of \(k\)-class biased permutations
• Mixing of permutations by biased transpositions
• Mixing of permutations by biased transposition

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cited In (10)

• Mixing of permutations by biased transpositions
• Title not available (Why is that?)
• Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
• Mixing times of Markov chains for self‐organizing lists and biased permutations
• Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
• Sampling biased monotonic surfaces using exponential metrics
• Rapid mixing of \(k\)-class biased permutations
• Maximum Kolmogorov-Sinai entropy versus minimum mixing time in Markov chains
• Mixing of permutations by biased transposition
• Sampling and counting 3-orientations of planar triangulations

This page was built for publication: Mixing times of Markov chains for self-organizing lists and biased permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741709)