Year: 2012
Type: preprint
Abstract: 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 4$ and $d$ sufficiently large, certain local Markov chains require exponential time to converge to equilibrium. More precisely, if $\cM$ is a Markov chain on the set of proper 3-colorings of $T_{L,d}$ that updates the color of at most $ρL^d$ vertices at each step and whose stationary distribution is uniform, then the convergence to stationarity of $\cM$ is exponential in $L^{d-1}$. Our proof is based on a conductance argument that builds on sensitive new combinatorial enumeration techniques.
Source: arXiv (Cornell University)
Authors: Galvin, David, Randall, Dana
Institutions: University of Pennsylvania, Georgia Institute of Technology
Language: English
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W2001979585
