Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids

DOI10.1063/1.533194zbMath1019.82011OpenAlexW2146613875WikidataQ57401538 ScholiaQ57401538MaRDI QIDQ2737882

Colin Cooper, Martin Dyer, Rachel Rue, Alan M. Frieze

Publication date: 30 August 2001

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/1.533194

zbMATH Keywords

partition functionmixingMarkov chain Monte Carlo estimationferromagnetic \(Q\)-state Potts modelSwendsen-Wang process

Mathematics Subject Classification ID

Related Items (13)

Markov chain decomposition for convergence rate analysis ⋮ Simulated tempering and swapping on mean-field models ⋮ Exponentially slow mixing in the mean-field Swendsen-Wang dynamics ⋮ Cutoff for the Swendsen-Wang dynamics on the lattice ⋮ Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point ⋮ Unnamed Item ⋮ Swendsen‐Wang algorithm on the mean‐field Potts model ⋮ The worm process for the Ising model is rapidly mixing ⋮ Tunneling behavior of Ising and Potts models in the low-temperature regime ⋮ Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains ⋮ A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics ⋮ Comparison of Swendsen-Wang and heat-bath dynamics ⋮ Rapid mixing of Swendsen–Wang dynamics in two dimensions

Cites Work

• Dynamical analysis of low-temperature Monte Carlo cluster algorithms
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• On the existence of a factor of degree one of a connected random graph

This page was built for publication: Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids