6 citations · 10 across the 3 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
Rapid Mixing of -Class Biased Permutations
Sarah Miracle, Amanda Pascoe Streib
In this paper, we study a biased version of the nearest-neighbor transposition Markov chain on the set of permutations where neighboring elements and are placed in order $(…
cs.DM2012★ 6 cited
Mixing Times of Self-Organizing Lists and Biased Permutations
Prateek Bhakta, Sarah Miracle, Dana Randall +1
Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \cal{M}}_{nn} is known to converge in time Θ(n^3 \log n) i…