Paper Info
Title
Mixing properties of the Swendsen-Wang process on classes of graphs
Abstract
We consider the mixing properties of the widely used Swendsen-Wang processfor the Markov chain Monte Carlo estimation of the partition function of theferromagnetic Q-state Potts model, for certain classes of graphs.In the paper The Swendsen-Wang process does not always mix rapidly, V.Gore and M. Jerrum obtain results for the mixing properties of the SwendsenWangprocess on the complete graph K n . Our main results for graphs with nvertices are: For graphs with small maximum degree, the ...
Year
DOI
Venue
1999
3.0.CO;2-C" target="_self" class="small-link-text"10.1002/(SICI)1098-2418(199910/12)15:3/43.0.CO;2-C
Random Structures and Algorithms
Keywords
Field
DocType
swendsen-wang process,potts model,partition function,markov chain monte carlo,complete graph,maximum degree
Discrete mathematics,Complete graph,Combinatorics,Markov chain mixing time,Random graph,Vertex (geometry),Tutte polynomial,Hybrid Monte Carlo,Degree (graph theory),Mathematics,Potts model
Journal
Volume
Issue
ISSN
15
3-4
1042-9832
Citations 
PageRank 
References 
18
2.76
4
Authors
2
Name
Order
Citations
PageRank
Colin Cooper128730.73
Alan M. Frieze24837787.00