The Swendsen-Wang process does not always mix rapidly

Journal of Statistical Physics

Volumn 97, Issue 1-2, 1999, Pages 67-86

  Gore, Vivek K ^a,b   Jerrum, Mark R ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Client Network Services Inc   (United States)

Author keywords

Ferromagnetic Potts model; First order phase transition; Mixing time; Random graph model; Swendsen Wang dynamics

Indexed keywords

EID: 0033211906     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1004610900745     Document Type: Article

References (31)

1. F. Barahona, On the computational complexity of Ising spin glass models, J. Phys. A: Math. Gen. 15:3241-3253 (1982).
2. R. J. Baxter, Exactly Solved Models in Statistical Mechanics (Academic Press, London, 1982).
3. B. Bollobás, Random Graphs (Academic Press, London, 1985).
4. B. Bollobás, G. Grimmett, and S. Janson, The random-cluster model on the complete graph, Prob. The. Rel. Fields 104:283-317 (1996).
5. R. Bubley and M. Dyer, Path coupling: A technique for proving rapid mixing in Markov chains. Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (Computer Society Press, 1997), pp. 223-231.
6. R. Bubley, M. Dyer, and C. Greenhill, Beating the 2Δ bound for approximately counting colourings: A computer-assisted proof of rapid mixing, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM SIAM (1998), pp. 355-363.
7. Colin Cooper and Alan M. Frieze, Mixing properties of the Swendsen-Wang process on classes of graphs. To appear in Proceedings of a DIMACS Workshop on Statistical Physics Methods in Discrete Probability, Combinatorics and Theoretical Computer Science, Jennifer T. Chayes and Dana Randall, eds. (American Mathematical Society).
8. R. G. Edwards and A. D. Sokal, Generalizations of the Fortuin-Kasteleyn Swendsen Wang representation and Monte Carlo algorithm. Phys. Rev. D 38:2009-2012 (1988).
9. R. S. Ellis, Entropy, Large Deviations, and Statistical Mechanics, Grundlehren der mathematischen Wissenschaften, Vol. 271 (Springer-Verlag, 1985).
10. C. M. Fortuin and P. W. Kasteleyn, On the random cluster model I: Introduction and relation to other models, Physica 57:536-564 (1972).
11. V. Gore and M. Jerrum, The Swendsen-Wang process does not always mix rapidly, Proceedings of the 29th ACM Symposium on Theory of Computation (ACM Press, 1997), pp. 674-681.
12. M. Jerrum and A. Sinclair, Polynomial-time approximation algorithms for the Ising model, SIAM J. Comput. 22:1087-1116 (1993).
13. M. Jerrum, A very simple algorithm for estimating the number of k-colourings of a low-degree graph, Random Structures and Algorithms 7:157-165 (1995).
14. M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: An approach to approximate counting and integration. In Approximation Algorithms for NP-hard Problems, Dorit Hochbaum, ed. (PWS, 1996), pp. 482-520.
15. R. Kannan, Markov chains and polynomial time algorithms, Proceedings of the 35th Annual IEEE Symposium on Foundation of Computer Science (Computer Society Press, 1994), pp. 656-671.
16. R. M. Karp and M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (Computer Society Press, 1983), 56-64.
17. R. M. Karp, The transitive closure of a random digraph, Random Structures and Algorithms 1:73-93 (1990).
18. H. Kesten and R. H. Schonmann, Behavior in large dimensions of the Potts and Heisenberg models, Rev. Math. Phys. 1:147-182 (1990).
19. L. Laanait, A. Messager, S. Miracle-Sole, J. Ruiz, and S. Shlosman, Interfaces in the Potts model I: Piragov-Sinai theory of the Fortuin-Kasteleyn representation. Commun. Math. Phys. 140:81-91 (1991).
20. C. McDiarmid, On the method of bounded differences, London Mathematical Society Lecture Note Series, Vol. 141 (Cambridge University Press, 1989), pp. 148-188.
21. P. Martin, Potts Models and Related Problems in Statistical Mechanics (World Scientific, Singapore, 1991).
22. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of state calculations by fast computing machines, J. Chem. Phys. 21:1087-1092 (1953).
23. R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, 1995).
24. Neil O'Connell, Some large deviation results for sparse random graphs, Prob. Theo. Rel. Fields 10:277-285 (1998).
25. R. B. Potts, Some generalised order-disorder transformations, Proc. Cambridge Phil. Soc. 48:106-109 (1952).
26. J. Salas and A. D. Sokal, Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem, J. Stat. Phys. 86:551-579 (1997).
27. Alistair Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flows, Combin. Prob. Comput. 1:351-370 (1992).
28. A. Sokal, Personal communication (1995).
29. R. H. Swendsen and J.-S. Wang, Non-universal critical dynamics in Monte-Carlo simulations, Phys. Rev. Lett. 58:86-88 (1987).
30. D. J. A. Welsh, The computational complexity of some classical problems from statistical physics, In Disorder in Physical Systems (Oxford University Press, 1990), pp. 307-321.
31. D. J. A. Welsh, Complexity: Knots, colourings and counting, London Mathematical Society Lecture Notes, Vol. 186 (Cambridge University Press, 1993).