Swendsen-Wang algorithm on the mean-field Potts model
We study the $q$-state ferromagnetic Potts model on the $n$-vertex complete graph known as the mean-field (Curie-Weiss) model. We analyze the Swendsen-Wang algorithm which is a Markov chain that utilizes the random cluster representation for the ferromagnetic Potts model to recolor large sets of ver...
Main Authors: | Galanis, A, Stefankovic, D, Vigoda, E |
---|---|
Format: | Journal article |
Izdano: |
Wiley
2018
|
Podobne knjige/članki
-
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
od: Galanis, A, et al.
Izdano: (2016) -
Criticality of the random-site Ising model: Metropolis, Swendsen-Wang and Wolff Monte Carlo algorithms
od: D.Ivaneyko, et al.
Izdano: (2005-01-01) -
Sampling in uniqueness from the potts and random-cluster models on random regular graphs
od: Blanca, A, et al.
Izdano: (2018) -
Metastability of the Potts ferromagnet on random regular graphs
od: Coja-Oghlan, A, et al.
Izdano: (2022) -
Metastability of the Potts ferromagnet on random regular graphs
od: Coja-Oghlan, A, et al.
Izdano: (2023)