Random Cluster Dynamics for the Ising Model is Rapidly Mixing

Heng Guo, Mark Jerrum

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at q = 2 on an arbitrary n- vertex graph is bounded by a polynomial in n. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic Ising model at any temperature also has a polynomial mixing time bound.
Original languageEnglish
Title of host publicationProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
PublisherSociety for Industrial and Applied Mathematics
Pages1818-1827
Number of pages10
Volume28
Edition2
ISBN (Electronic)978-1-61197-478-2
DOIs
Publication statusE-pub ahead of print - 19 Jan 2017
EventTwenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms - Hotel Porta Fira, Barcelona, Spain
Duration: 16 Jan 201719 Jan 2017
http://www.siam.org/meetings/da17/

Conference

ConferenceTwenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Abbreviated titleSIAM 2017
CountrySpain
CityBarcelona
Period16/01/1719/01/17
Internet address

Fingerprint Dive into the research topics of 'Random Cluster Dynamics for the Ising Model is Rapidly Mixing'. Together they form a unique fingerprint.

Cite this