Document Open Access Logo

Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems

Authors Shuai Shao , Yuxin Sun

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2020.96.pdf
  • Filesize: 0.55 MB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Approximation algorithms
Keywords
  • 2-Spin system
  • Correlation decay
  • Zero-freeness
  • Phase transition
  • Contraction

Metrics

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

Abstract

We study complex zeros of the partition function of 2-spin systems, viewed as a multivariate polynomial in terms of the edge interaction parameters and the uniform external field. We obtain new zero-free regions in which all these parameters are complex-valued. Crucially based on the zero-freeness, we are able to extend the existence of correlation decay to these complex regions from real parameters. As a consequence, we obtain an FPTAS for computing the partition function of 2-spin systems on graphs of bounded degree for these parameter settings. We introduce the contraction property as a unified sufficient condition to devise FPTAS via either Weitz’s algorithm or Barvinok’s algorithm. Our main technical contribution is a very simple but general approach to extend any real parameter of which the 2-spin system exhibits correlation decay to its complex neighborhood where the partition function is zero-free and correlation decay still exists. This result formally establishes the inherent connection between two distinct notions of phase transition for 2-spin systems: the existence of correlation decay and the zero-freeness of the partition function via a unified perspective, contraction.

Cite As Get BibTex

Shuai Shao and Yuxin Sun. Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 96:1-96:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.ICALP.2020.96

Author Details

Shuai Shao
  • Department of Computer Sciences, University of Wisconsin-Madison, Madison, WI, USA
Yuxin Sun
  • Department of Computer Sciences, University of Wisconsin-Madison, Madison, WI, USA

Funding

The authors are supported by NSF CCF-1714275.

Acknowledgements

We want to thank Professor Jin-Yi Cai, the advisor of the first author, for many inspiring discussions and valuable comments on a preliminary version of this paper. Despite his support, he generously declined our invitation for co-authorship. We also want to thank Professor Alex Scott, Dr. Jingcheng Liu and anonymous reviewers for their helpful comments.

References

  1. Taro Asano. Lee-Yang Theorem and the Griffiths Inequality for the Anisotropic Heisenberg Ferromagnet. Physical Review Letters, 24(25):1409, 1970. Google Scholar
  2. Francisco Barahona. On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical and General, 15(10):3241, 1982. Google Scholar
  3. Alexander Barvinok. Combinatorics and Complexity of Partition Functions, volume 9. Springer, 2016. Google Scholar
  4. Ferenc Bencs and Péter Csikvári. Note on the zero-free region of the hard-core model. arXiv preprint, 2018. URL: http://arxiv.org/abs/1807.08963.
  5. Andrei Bulatov and Martin Grohe. The complexity of partition functions. Theoretical Computer Science, 348(2-3):148-186, 2005. Google Scholar
  6. Andrei A Bulatov. The complexity of the counting constraint satisfaction problem. Journal of the ACM (JACM), 60(5):1-41, 2013. Google Scholar
  7. Jin-Yi Cai and Xi Chen. Complexity of counting CSP with complex weights. Journal of the ACM (JACM), 64(3):1-39, 2017. Google Scholar
  8. Jin-Yi Cai, Xi Chen, and Pinyan Lu. Graph homomorphisms with complex values: A dichotomy theorem. SIAM Journal on Computing, 42(3):924-1029, 2013. Google Scholar
  9. Jin-Yi Cai, Pinyan Lu, and Mingji Xia. The complexity of complex weighted Boolean #CSP. Journal of Computer and System Sciences, 80(1):217-236, 2014. Google Scholar
  10. Martin Dyer, Leslie Ann Goldberg, and Mark Jerrum. The complexity of weighted Boolean #CSP. SIAM Journal on Computing, 38(5):1970-1986, 2009. Google Scholar
  11. Martin Dyer and Catherine Greenhill. The complexity of counting graph homomorphisms. Random Structures & Algorithms, 17(3-4):260-289, 2000. Google Scholar
  12. Martin Dyer and David Richerby. An effective dichotomy for the counting constraint satisfaction problem. SIAM Journal on Computing, 42(3):1245-1274, 2013. Google Scholar
  13. Andreas Galanis, Daniel Štefankovič, and Eric Vigoda. Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models. Combinatorics, Probability and Computing, 25(4):500-559, 2016. Google Scholar
  14. Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, and Marc Thurley. A complexity dichotomy for partition functions with mixed signs. SIAM Journal on Computing, 39(7):3336-3402, 2010. Google Scholar
  15. Leslie Ann Goldberg, Mark Jerrum, and Mike Paterson. The computational complexity of two-state spin systems. Random Structures & Algorithms, 23(2):133-154, 2003. Google Scholar
  16. Heng Guo, Jingcheng Liu, and Pinyan Lu. Zeros of ferromagnetic 2-spin systems. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 181-192. SIAM, 2020. Google Scholar
  17. Heng Guo and Pinyan Lu. Uniqueness, spatial mixing, and approximation for ferromagnetic 2-spin systems. ACM Transactions on Computation Theory (TOCT), 10(4):1-25, 2018. Google Scholar
  18. Nicholas JA Harvey, Piyush Srivastava, and Jan Vondrák. Computing the independence polynomial: from the tree threshold down to the roots. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1557-1576. SIAM, 2018. Google Scholar
  19. Mark Jerrum and Alistair Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM Journal on computing, 22(5):1087-1116, 1993. Google Scholar
  20. Mark R Jerrum, Leslie G Valiant, and Vijay V Vazirani. Random Generation of Combinatorial Structures from a Uniform Distribution. Theoretical Computer Science, 43:169-188, 1986. Google Scholar
  21. T. D. Lee and C. N. Yang. Statistical theory of equations of state and phase transitions. II. Lattice gas and Ising model. Phys. Rev., 87:410-419, August 1952. Google Scholar
  22. Liang Li, Pinyan Lu, and Yitong Yin. Approximate counting via correlation decay in spin systems. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pages 922-940. SIAM, 2012. Google Scholar
  23. Liang Li, Pinyan Lu, and Yitong Yin. Correlation decay up to uniqueness in spin systems. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pages 67-84. SIAM, 2013. Google Scholar
  24. Elliott H Lieb and Alan D Sokal. A general Lee-Yang theorem for one-component and multicomponent ferromagnets. Communications in Mathematical Physics, 80(2):153-179, 1981. Google Scholar
  25. Jingcheng Liu. Approximate counting, phase transitions and geometry of polynomials. PhD thesis, UC Berkeley, 2019. Google Scholar
  26. Jingcheng Liu, Pinyan Lu, and Chihao Zhang. The complexity of ferromagnetic two-spin systems with external fields. arXiv preprint, 2014. URL: http://arxiv.org/abs/1402.4346.
  27. Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava. Fisher zeros and correlation decay in the Ising model. Journal of Mathematical Physics, 60(10):103304, 2019. Google Scholar
  28. Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava. The Ising partition function: zeros and deterministic approximation. Journal of Statistical Physics, 174(2):287-315, 2019. Google Scholar
  29. Charles M Newman. Zeros of the partition function for generalized Ising systems. Communications on Pure and Applied Mathematics, 27(2):143-159, 1974. Google Scholar
  30. Viresh Patel and Guus Regts. Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. SIAM Journal on Computing, 46(6):1893-1919, 2017. Google Scholar
  31. Han Peters and Guus Regts. Location of zeros for the partition function of the Ising model on bounded degree graphs. Journal of the London Mathematical Society, 2018. Google Scholar
  32. Han Peters and Guus Regts. On a conjecture of Sokal concerning roots of the independence polynomial. The Michigan Mathematical Journal, 68(1):33-55, 2019. Google Scholar
  33. Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, and Linji Yang. Improved mixing condition on the grid for counting and sampling independent sets. Probability Theory and Related Fields, 156(1-2):75-99, 2013. Google Scholar
  34. David Ruelle. Extension of the Lee-Yang circle theorem. Physical Review Letters, 26(6):303, 1971. Google Scholar
  35. Alexander D Scott and Alan D Sokal. The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma. Journal of Statistical Physics, 118(5-6):1151-1261, 2005. Google Scholar
  36. Shuai Shao and Yuxin Sun. Contraction: a Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems. arXiv preprint, 2019. URL: http://arxiv.org/abs/1909.04244.
  37. Barry Simon and Robert B Griffiths. The (ϕ⁴)₂ field theory as a classical Ising model. Communications in Mathematical Physics, 33(2):145-164, 1973. Google Scholar
  38. Alistair Sinclair, Piyush Srivastava, Daniel Štefankovič, and Yitong Yin. Spatial mixing and the connective constant: optimal bounds. Probability Theory and Related Fields, 168(1-2):153-197, 2017. Google Scholar
  39. Alistair Sinclair, Piyush Srivastava, and Marc 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
  40. Allan Sly and Nike Sun. Counting in two-spin models on d-regular graphs. The Annals of Probability, 42(6):2383-2416, 2014. Google Scholar
  41. Alan D Sokal. Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions. Combinatorics, Probability and Computing, 10(1):41-77, 2001. Google Scholar
  42. Elias M Stein and Rami Shakarchi. Complex Analysis, volume 2. Princeton University Press, 2010. Google Scholar
  43. Dror Weitz. Counting independent sets up to the tree threshold. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 140-149, 2006. Google Scholar
  44. Jinshan Zhang, Heng Liang, and Fengshan Bai. Approximating partition functions of two-state spin systems. arXiv preprint, 2009. URL: http://arxiv.org/abs/0911.5486.
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
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact