Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region

Authors Antonio Blanca, Zongchen Chen, Eric Vigoda



PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2018.32.pdf
  • Filesize: 428 kB
  • 18 pages

Document Identifiers

Author Details

Antonio Blanca
  • School of Computer Science, Georgia Institute of Technology, Atlanta GA 30332, USA
Zongchen Chen
  • School of Mathematics, Georgia Institute of Technology, Atlanta GA 30332, USA
Eric Vigoda
  • School of Computer Science, Georgia Institute of Technology, Atlanta GA 30332, USA

Cite AsGet BibTex

Antonio Blanca, Zongchen Chen, and Eric Vigoda. Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 32:1-32:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.32

Abstract

The Swendsen-Wang dynamics is a popular algorithm for sampling from the Gibbs distribution for the ferromagnetic Ising model on a graph G=(V,E). The dynamics is a "global" Markov chain which is conjectured to converge to equilibrium in O(|V|^{1/4}) steps for any graph G at any (inverse) temperature beta. It was recently proved by Guo and Jerrum (2017) that the Swendsen-Wang dynamics has polynomial mixing time on any graph at all temperatures, yet there are few results providing o(|V|) upper bounds on its convergence time. We prove fast convergence of the Swendsen-Wang dynamics on general graphs in the tree uniqueness region of the ferromagnetic Ising model. In particular, when beta < beta_c(d) where beta_c(d) denotes the uniqueness/non-uniqueness threshold on infinite d-regular trees, we prove that the relaxation time (i.e., the inverse spectral gap) of the Swendsen-Wang dynamics is Theta(1) on any graph of maximum degree d >= 3. Our proof utilizes a version of the Swendsen-Wang dynamics which only updates isolated vertices. We establish that this variant of the Swendsen-Wang dynamics has mixing time O(log{|V|}) and relaxation time Theta(1) on any graph of maximum degree d for all beta < beta_c(d). We believe that this Markov chain may be of independent interest, as it is a monotone Swendsen-Wang type chain. As part of our proofs, we provide modest extensions of the technology of Mossel and Sly (2013) for analyzing mixing times and of the censoring result of Peres and Winkler (2013). Both of these results are for the Glauber dynamics, and we extend them here to general monotone Markov chains. This class of dynamics includes for example the heat-bath block dynamics, for which we obtain new tight mixing time bounds.

Subject Classification

ACM Subject Classification
  • Theory of computation → Random walks and Markov chains
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Swendsen-Wang dynamics
  • mixing time
  • relaxation time
  • spatial mixing
  • censoring

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. A. Blanca, P. Caputo, A. Sinclair, and E. Vigoda. Spatial Mixing and Non-local Markov chains. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1965-1980, 2018. Google Scholar
  2. A. Blanca, Z. Chen, and E. Vigoda. Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region. ArXiv preprint arXiv:1806.04602, 2018. Google Scholar
  3. A. Blanca and A. Sinclair. Dynamics for the mean-field random-cluster model. In Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM), pages 528-543, 2015. Google Scholar
  4. C. Borgs, J. Chayes, and P. Tetali. Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point. Probability Theory and Related Fields, 152(3-4):509-557, 2012. Google Scholar
  5. C. Borgs, A. M. Frieze, J. H. Kim, P. Tetali, E. Vigoda, and V. Vu. Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 218-229, 1999. Google Scholar
  6. F. Cesi. Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields. Probability Theory and Related Fields, 120(4):569-584, 2001. Google Scholar
  7. C. Daskalakis, E. Mossel, and S. Roch. Evolutionary trees and the Ising model on the Bethe lattice: a proof of Steel’s conjecture. Probability Theory and Related Fields, 149(1-2):149-189, 2011. Google Scholar
  8. J. Ding, E. Lubetzky, and Y. Peres. Mixing time of critical Ising model on trees is polynomial in the height. Communications in Mathematical Physics, 295(1):161-207, 2010. Google Scholar
  9. J. Ding and Y. Peres. Mixing time for the Ising model: a uniform lower bound for all graphs. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 47(4):1020-1028, 2011. Google Scholar
  10. M. Dyer, A. Sinclair, E. Vigoda, and D. Weitz. Mixing in time and space for lattice spin systems: A combinatorial view. Random Structures &Algorithms, 24(4):461-479, 2004. Google Scholar
  11. R. G. Edwards and A. D. Sokal. Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Physical Review D, 38(6):2009-2012, 1988. Google Scholar
  12. G. Ellison. Learning, local interaction, and coordination. Econometrica: Journal of the Econometric Society, pages 1047-1071, 1993. Google Scholar
  13. J. Felsenstein. Inferring Phylogenies, volume 2. Sinauer Associates Sunderland, MA, 2004. Google Scholar
  14. J. A. Fill and J. Kahn. Comparison inequalities and fastest-mixing Markov chains. The Annals of Applied Probability, 23(5):1778-1816, 2013. Google Scholar
  15. A. Galanis, D. Štefankovič, and E. Vigoda. Swendsen-Wang algorithm on the mean-field Potts model. In Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM), pages 815-828, 2015. Google Scholar
  16. D. Gamarnik and D. Katz. Correlation decay and deterministic FPTAS for counting list-colorings of a graph. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1245-1254, 2007. Google Scholar
  17. S. Geman and C. Graffigne. Markov random field image models and their applications to computer vision. In Proceedings of the International Congress of Mathematicians, pages 1496-1517, 1986. Google Scholar
  18. R. Gheissari, E. Lubetzky, and Y. Peres. Exponentially slow mixing in the mean-field Swendsen-Wang dynamics. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1981-1988, 2018. Google Scholar
  19. W. R. Gilks, S. Richardson, and D. J. Spiegelhalter. Markov chain Monte Carlo in practice. London: Chapman and Hall, 1996. Google Scholar
  20. V. K. Gore and M. R. Jerrum. The Swendsen-Wang process does not always mix rapidly. Journal of Statistical Physics, 97(1-2):67-86, 1999. Google Scholar
  21. G. R. Grimmett. The Random-Cluster Model, volume 333. Springer-Verlag, 2009. Google Scholar
  22. H. Guo and M. Jerrum. Random cluster dynamics for the Ising model is rapidly mixing. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1818-1827, 2017. Google Scholar
  23. T. P. Hayes and A. Sinclair. A general lower bound for mixing of single-site dynamics on graphs. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 511-520, 2005. Google Scholar
  24. A. E. Holroyd. Some Circumstances Where Extra Updates Can Delay Mixing. Journal of Statistical Physics, 145(6):1649-1652, 2011. Google Scholar
  25. E. Ising. Beitrag zur theorie des ferromagnetismus. Zeitschrift für Physik, 31(1):253-258, 1925. Google Scholar
  26. M. Jerrum and A. Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM Journal on Computing, 22(5):1087-1116, 1993. Google Scholar
  27. M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM, 51(4):671-697, 2004. Google Scholar
  28. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43(2-3):169-188, 1986. Google Scholar
  29. R. Kannan, L. Lovász, and M. Simonovits. Random walks and an O^*(n⁵) volume algorithm for convex bodies. Random Structures &Algorithms, 11(1):1-50, 1997. Google Scholar
  30. D. P. Landau and K. A. Binder. A guide to Monte Carlo simulations in statistical physics. Cambridge University Press, 2014. Google Scholar
  31. W. Lenz. Beiträge zum verstandnis der magnetischen eigenschaften in festen korpern. Physikalische Zeitschrift, 21:613-615, 1920. Google Scholar
  32. D. A. Levin and Y. Peres. Markov Chains and Mixing Times, 2nd edition, volume 107. American Mathematical Society, 2017. Google Scholar
  33. L. Li, P. Lu, and Y. Yin. Correlation decay up to uniqueness in spin systems. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 67-84, 2013. Google Scholar
  34. Y. Long, A. Nachmias, W. Ning, and Y. Peres. A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics. Memoirs of the American Mathematical Society, 232(1092):84 pages, 2014. Google Scholar
  35. F. Martinelli and E. Olivieri. Approach to equilibrium of Glauber dynamics in the one phase region. I. The attractive case. Communications in Mathematical Physics, 161(3):447-486, 1994. Google Scholar
  36. F. Martinelli and E. Olivieri. Approach to equilibrium of Glauber dynamics in the one phase region. II. The general case. Communications in Mathematical Physics, 161(3):458-514, 1994. Google Scholar
  37. A. Montanari and A. Saberi. The spread of innovations in social networks. Proceedings of the National Academy of Sciences, 107(47):20196-20201, 2010. Google Scholar
  38. E. Mossel and A. Sly. Exact thresholds for Ising-Gibbs samplers on general graphs. The Annals of Probability, 41(1):294-328, 2013. Google Scholar
  39. Y. Peres. Personal communication, 2016. Google Scholar
  40. Y. Peres and P. Winkler. Can Extra Updates Delay Mixing? Communications in Mathematical Physics, 323(3):1007-1016, 2013. Google Scholar
  41. C. J. Preston. Gibbs States on Countable Sets. Cambridge Tracts in Mathematics, 1974. Google Scholar
  42. J. Salas and A. D. Sokal. Dynamic critical behavior of a Swendsen-Wang-type algorithm for the Ashkin-Teller model. Journal of Statistical Physics, 85(3-4):297-361, 1996. Google Scholar
  43. J. Salas and A. D. Sokal. Dynamic critical behavior of the Swendsen-Wang algorithm: The two-dimensional three-state potts model revisited. Journal of Statistical Physics, 87(1-2):1-36, 1997. Google Scholar
  44. A. Sinclair, P. Srivastava, D. Štefankovič, and Y. Yin. Spatial mixing and the connective constant: Optimal bounds. Probability Theory and Related Fields, 168(1-2):153-197, 2017. Google Scholar
  45. A. Sinclair, P. Srivastava, and M. Thurley. Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. Journal of Statistical Physics, 155(4):666-686, 2014. Google Scholar
  46. A. Sly. Computational transition at the uniqueness threshold. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 287-296, 2010. Google Scholar
  47. A. Sly and N. Sun. The computational hardness of counting in two-spin models on d-regular graphs. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 361-369, 2012. Google Scholar
  48. D. Štefankovič, S. Vempala, and E. Vigoda. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. Journal of the ACM, 56(3):1-36, 2009. Google Scholar
  49. R. H. Swendsen and J. S. Wang. Nonuniversal critical dynamics in Monte Carlo simulations. Physical Review Letters, 58(2):86-88, 1987. Google Scholar
  50. M. Ullrich. Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensions. Dissertationes Mathematicae, 2014. Google Scholar
  51. J. S. Wang. Critical dynamics of the Swendsen-Wang algorithm in the three-dimensional Ising model. Physica A, 164(2):240-244, 1990. Google Scholar
  52. D. Weitz. Counting independent sets up to the tree threshold. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pages 140-149, 2006. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail