6 citations · 10 across the 2 of their papers we have counts for
2 papers
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…
cs.DS2012★ 4 cited
Algorithms for Sampling 3-Orientations of Planar Triangulations
Sarah Miracle, Dana Randall, Amanda Pascoe Streib +1
Given a planar triangulation, a 3-orientation is an orientation of the internal edges so all internal vertices have out-degree three. Each 3-orientation gives rise to a unique edge…