Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations

DOI10.1137/1.9781611973105.1zbMath1423.60109OpenAlexW4247306430MaRDI QIDQ5741709

Sarah Miracle, Dana Randall, Prateek Bhakta, 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

Mathematics Subject Classification ID

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

Related Items (8)

Mixing times of Markov chains for self‐organizing lists and biased permutations ⋮ Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling ⋮ Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations ⋮ Maximum Kolmogorov-Sinai entropy versus minimum mixing time in Markov chains ⋮ Unnamed Item ⋮ Sampling and Counting 3-Orientations of Planar Triangulations ⋮ Sampling biased monotonic surfaces using exponential metrics ⋮ Mixing of permutations by biased transpositions

This page was built for publication: Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations