Authors
Christian Borgs, Jennifer T Chayes, Alan Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda
Publication date
1999/10/17
Conference
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039)
Pages
218-229
Publisher
IEEE
Description
Studies two widely used algorithms, Glauber dynamics and the Swendsen-Wang (1987) algorithm, on rectangular subsets of the hypercubic lattice Z/sup d/. We prove that, under certain circumstances, the mixing time in a box of side length L with periodic boundary conditions can be exponential in L/sup d-1/. In other words, under these circumstances, the mixing in these widely used algorithms is not rapid; instead it is torpid. The models we study are the independent set model and the q-state Potts model. For both models, we prove that Glauber dynamics is torpid in the region with phase coexistence. For the Potts model, we prove that the Swendsen-Wang mixing is torpid at the phase transition point.
Total citations
19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024112415355225811116510461553641
Scholar articles
C Borgs, JT Chayes, A Frieze, JH Kim, P Tetali… - 40th Annual Symposium on Foundations of Computer …, 1999