Random cluster dynamics for the Ising model is rapidly mixing
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Perla Sousi.
We show that the mixing time of Glauber (single-edge update) dynamics for the random cluster model at q=2 is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic Ising model also runs in polynomial time, at any temperature, with the same time bound. (Joint work with Heng Guo, Edinburgh.)
This talk is part of the Probability series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|