Mixing properties of the Swendsen-Wang process on classes of graphs

We consider the mixing properties of the widely used Swendsen–Wang process for the Markov chain Monte Carlo estimation of the partition function of the ferromagnetic 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 obtained results for the mixing properties of the Swendsen–Wang process on the complete graph Kn. Our main results for graphs with n vertices are the following: For graphs with small maximum degree, the mixing time is polynomial in n for small enough values of the coupling constant β. For trees, the mixing time is O(n) for any β. For cycles, the mixing time is O(n log n) for any β. For random graphs Gn, p, p=Ω(n−1/3), there are values of the coupling constant β for which whp the Swendsen–Wang process does not mix rapidly.  ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 242–261, 1999

[1]  R. B. Potts.  Some generalized order-disorder transformations , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  C. Fortuin,et al.  On the random-cluster model: I. Introduction and relation to other models , 1972 .

[3]  Wang,et al.  Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.

[4]  A. Sokal,et al.  Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. , 1988, Physical review. D, Particles and fields.

[5]  Ray,et al.  Mean-field study of the Swendsen-Wang dynamics. , 1989, Physical review. A, General physics.

[6]  Li,et al.  Rigorous lower bound on the dynamic critical exponents of the Swendsen-Wang algorithm. , 1989, Physical review letters.

[7]  James G. Oxley,et al.  Tutte polynomials computable in polynomial time , 1992, Discret. Math..

[8]  Mark Jerrum,et al.  A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.

[9]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[10]  Martin E. Dyer,et al.  Path coupling: A technique for proving rapid mixing in Markov chains , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[11]  Mark Huber,et al.  Efficient exact sampling from the Ising model using Swendsen-Wang , 1999, SODA '99.

[12]  M. Jerrum,et al.  The Swendsen–Wang Process Does Not Always Mix Rapidly , 1999 .