55 citations · 181 across the 20 of their papers we have counts for
5 papers · 1 filter
Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2
Antonio Blanca, David Galvin, Dana Randall +1
In the hard-core model on a finite graph we are given a parameter lambda>0, and an independent set I arises with probability proportional to lambda^|I|. On infinite graphs a Gibbs…
Phase coexistence and torpid mixing in the 3-coloring model on Z^d
David Galvin, Jeff Kahn, Dana Randall +1
We show that for all sufficiently large d, the uniform proper 3-coloring model (in physics called the 3-state antiferromagnetic Potts model at zero temperature) on Z^d admits multi…
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 . We show that there is a constant such that for all even $L \geq…
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…
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…