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