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...
Autori principali: | Galanis, A, Stefankovic, D, Vigoda, E |
---|---|
Natura: | Journal article |
Pubblicazione: |
Wiley
2018
|
Documenti analoghi
-
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
di: Galanis, A, et al.
Pubblicazione: (2016) -
Criticality of the random-site Ising model: Metropolis, Swendsen-Wang and Wolff Monte Carlo algorithms
di: D.Ivaneyko, et al.
Pubblicazione: (2005-01-01) -
Sampling in uniqueness from the potts and random-cluster models on random regular graphs
di: Blanca, A, et al.
Pubblicazione: (2018) -
Metastability of the Potts ferromagnet on random regular graphs
di: Coja-Oghlan, A, et al.
Pubblicazione: (2022) -
Metastability of the Potts ferromagnet on random regular graphs
di: Coja-Oghlan, A, et al.
Pubblicazione: (2023)