Document Open Access Logo

Two-State Spin Systems with Negative Interactions

Authors Yumou Fei , Leslie Ann Goldberg, Pinyan Lu

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITCS.2024.45.pdf
  • Filesize: 0.78 MB
  • 13 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Approximate Counting
  • Spin Systems
  • #P-Hardness
  • Randomized Algorithms

Metrics

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

Abstract

We study the approximability of computing the partition functions of two-state spin systems. The problem is parameterized by a 2×2 symmetric matrix. Previous results on this problem were restricted either to the case where the matrix has non-negative entries, or to the case where the diagonal entries are equal, i.e. Ising models. In this paper, we study the generalization to arbitrary 2×2 interaction matrices with real entries. We show that in some regions of the parameter space, it’s #P-hard to even determine the sign of the partition function, while in other regions there are fully polynomial approximation schemes for the partition function. Our results reveal several new computational phase transitions.

Cite As Get BibTex

Yumou Fei, Leslie Ann Goldberg, and Pinyan Lu. Two-State Spin Systems with Negative Interactions. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 45:1-45:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ITCS.2024.45

Author Details

Yumou Fei
  • School of Mathematical Sciences, Peking University, China
Leslie Ann Goldberg
  • Department of Computer Science, University of Oxford, UK
Pinyan Lu
  • Laboratory of Interdisciplinary Research of Computation and Economics (SUFE), Ministry of Education, Shanghai University of Finance and Economics, China

Acknowledgements

We thank Mingji Xia for many very helpful conversations about this work.

References

  1. Taro Asano. Theorems on the partition functions of the Heisenberg ferromagnets. Journal of the Physical Society of Japan, 29(2):350-359, 1970. Google Scholar
  2. Alexander Barvinok. Combinatorics and complexity of partition functions, volume 30. Springer, 2016. Google Scholar
  3. Ferenc Bencs, Pjotr Buys, and Han Peters. The limit of the zero locus of the independence polynomial for bounded degree graphs. arXiv preprint, 2021. URL: https://arxiv.org/abs/2111.06451.
  4. Ferenc Bencs, Péter Csikvári, Piyush Srivastava, and Jan Vondrák. On complex roots of the independence polynomial. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 675-699. SIAM, 2023. Google Scholar
  5. Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, and Daniel Štefankovič. Inapproximability of the independent set polynomial in the complex plane. SIAM Journal on Computing, 49(5):STOC18-395, 2019. Google Scholar
  6. Andrei Bulatov and Martin Grohe. The complexity of partition functions. Theoretical Computer Science, 348(2-3):148-186, 2005. Google Scholar
  7. 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
  8. Xiaoyu Chen, Weiming Feng, Yitong Yin, and Xinyuan Zhang. Rapid mixing of glauber dynamics via spectral independence for all degrees. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 137-148. IEEE, 2022. Google Scholar
  9. David de Boer, Pjotr Buys, Lorenzo Guerini, Han Peters, and Guus Regts. Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial. arXiv preprint, 2021. URL: https://arxiv.org/abs/2104.11615.
  10. Martin Dyer and Catherine Greenhill. The complexity of counting graph homomorphisms. Random Structures & Algorithms, 17(3-4):260-289, 2000. Google Scholar
  11. Andreas Galanis, Leslie Ann Goldberg, and Daniel Stefankovic. Inapproximability of the independent set polynomial below the shearer threshold. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. Google Scholar
  12. 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
  13. 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
  14. Leslie Ann Goldberg and Heng Guo. The complexity of approximating complex-valued ising and tutte partition functions. computational complexity, 26:765-833, 2017. Google Scholar
  15. Leslie Ann Goldberg and Mark Jerrum. Inapproximability of the Tutte polynomial. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 459-468, 2007. Google Scholar
  16. Leslie Ann Goldberg and Mark Jerrum. The complexity of computing the sign of the Tutte polynomial. SIAM Journal on Computing, 43(6):1921-1952, 2014. Google Scholar
  17. 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
  18. Heng Guo, Chao Liao, Pinyan Lu, and Chihao Zhang. Zeros of holant problems: Locations and algorithms. ACM Trans. Algorithms, 17(1):4:1-4:25, 2021. URL: https://doi.org/10.1145/3418056.
  19. Heng Guo and Tyson Williams. The complexity of planar boolean #CSP with complex weights. In International Colloquium on Automata, Languages, and Programming, pages 516-527. Springer, 2013. Google Scholar
  20. 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
  21. Mark Jerrum and Alistair Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM Journal on computing, 22(5):1087-1116, 1993. Google Scholar
  22. Tsung-Dao Lee and Chen-Ning Yang. Statistical theory of equations of state and phase transitions. II. Lattice gas and Ising model. Physical Review, 87(3):410, 1952. 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. Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava. Correlation decay and partition function zeros: Algorithms and phase transitions. SIAM Journal on Computing, pages FOCS19-200, 2022. Google Scholar
  25. Colin McQuillan. Approximating Holant problems by winding. arXiv preprint, 2013. URL: https://arxiv.org/abs/1301.2880.
  26. 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
  27. Han Peters and Guus Regts. On a conjecture of sokal concerning roots of the independence polynomial. Michigan Mathematical Journal, 68(1):33-55, 2019. Google Scholar
  28. David Ruelle. Extension of the Lee-Yang circle theorem. Physical Review Letters, 26(6):303, 1971. Google Scholar
  29. Alistair Sinclair and Piyush Srivastava. Lee-yang theorems and the complexity of computing averages. In Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pages 625-634. ACM, 2013. URL: https://doi.org/10.1145/2488608.2488686.
  30. 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
  31. Allan Sly. Computational transition at the uniqueness threshold. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pages 287-296. IEEE, 2010. Google Scholar
  32. Allan Sly and Nike Sun. The computational hardness of counting in two-spin models on d-regular graphs. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pages 361-369. IEEE, 2012. Google Scholar
  33. 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
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact