Dana Randall

most citedMixing Times of Self-Organizing Lists and Biased Permutations

6 citations · 10 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2012

Torpid Mixing of Local Markov Chains on 3-Colorings of the Discrete Torus

David Galvin, Dana Randall

We study local Markov chains for sampling 3-colorings of the discrete torus $T_{L, d} = 0, ..., L - 1^{d}$ . We show that there is a constant $ρ \approx .22$ such that for all even $L \geq…

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…