Font Size: a A A

Mixing time of the Swendsen-Wang dynamics on the complete graph and trees

Posted on:2010-06-06Degree:Ph.DType:Dissertation
University:University of California, BerkeleyCandidate:Long, YunFull Text:PDF
GTID:1440390002976634Subject:Mathematics
Abstract/Summary:
The Swendsen-Wang dynamics is a Markov chain widely used by physicists to sample from the Boltzmann-Gibbs distribution of the Ising model. Cooper, Dyer, Frieze and Rue proved that on the complete graph Kn the mixing time of the chain is O( n ) for all non-critical temperatures. We improve their result and provide sharp bounds for the mixing time in all temperatures. We show the mixing time is of order log n at super-critical temperatures, of constant order at sub-critical temperatures, and of order n 1/4 at the critical temperature. We also prove the mixing time is of order log n when the underlying graph is a tree, which improves Cooper and Frieze's early results. The main tool for the proof is understanding the Markov Chain dynamics via properties of critical percolation on the underlying graph.
Keywords/Search Tags:Dynamics, Mixing time, Graph, Chain
Related items