Document Open Access Logo

The Complexity of Ferromagnetic Two-spin Systems with External Fields

Authors Jingcheng Liu, Pinyan Lu, Chihao Zhang

PDF

File

Thumbnail PDF
PDF
LIPIcs.APPROX-RANDOM.2014.843.pdf
  • Filesize: 0.56 MB
  • 14 pages

Document Identifiers

Subject Classification

Keywords
  • Spin System
  • #BIS-hard
  • FPRAS

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 function for ferromagnetic two-state spin systems. The remarkable algorithm by Jerrum and Sinclair showed that there is a fully polynomial-time randomized approximation scheme (FPRAS) for the special ferromagnetic Ising model with any given uniform external field. Later, Goldberg and Jerrum proved that it is #BIS-hard for Ising model if we allow inconsistent external fields on different nodes. In contrast to these two results, we prove that for any ferromagnetic two-state spin systems except the Ising model, there exists a threshold for external fields beyond which the problem is #BIS-hard, even if the external field is uniform.

Cite As Get BibTex

Jingcheng Liu, Pinyan Lu, and Chihao Zhang. The Complexity of Ferromagnetic Two-spin Systems with External Fields. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 843-856, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014) https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.843

Author Details

Jingcheng Liu
Pinyan Lu
Chihao Zhang

References

  1. Antar Bandyopadhyay and David Gamarnik. Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models. Random Structures & Algorithms, 33(4):452-479, 2008. Google Scholar
  2. Andrei Bulatov and Martin Grohe. The complexity of partition functions. Theoretical Computer Science, 348(2):148-186, 2005. Google Scholar
  3. Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Štefankovic, and Eric Vigoda. #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree nonuniqueness region. To Appear in RANDOM 2014, 2014. Google Scholar
  4. Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill, and Mark Jerrum. The relative complexity of approximate counting problems. Algorithmica, 38(3):471-500, 2004. Google Scholar
  5. Martin Dyer, Leslie Ann Goldberg, and Mark Jerrum. An approximation trichotomy for boolean #CSP. Journal of Computer and System Sciences, 76(3):267-277, 2010. Google Scholar
  6. Andreas Galanis, Daniel Štefankovic, and Eric Vigoda. Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models. arXiv preprint arXiv:1203.2226, 2012. Google Scholar
  7. Leslie Ann Goldberg and Mark Jerrum. The complexity of ferromagnetic Ising with local fields. Combinatorics, Probability and Computing, 16(01):43-61, 2007. Google Scholar
  8. Leslie Ann Goldberg and Mark Jerrum. Approximating the partition function of the ferromagnetic Potts model. Journal of the ACM (JACM), 59(5):25, 2012. Google Scholar
  9. 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
  10. Mark Jerrum and Alistair Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM Journal on computing, 22(5):1087-1116, 1993. Google Scholar
  11. Mark Jerrum, Alistair Sinclair, and Eric 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
  12. Liang Li, Pinyan Lu, and Yitong Yin. Approximate counting via correlation decay in spin systems. In Proceedings of the 23th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'12), pages 922-940. SIAM, 2012. Google Scholar
  13. Liang Li, Pinyan Lu, and Yitong Yin. Correlation decay up to uniqueness in spin systems. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13), pages 67-84, 2013. Google Scholar
  14. Chengyu Lin, Jingcheng Liu, and Pinyan Lu. A simple FPTAS for counting edge covers. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'14), pages 341-348, 2014. Google Scholar
  15. Pinyan Lu, Menghui Wang, and Chihao Zhang. FPTAS for weighted Fibonacci gates and its applications. In Proceedings of the 41th International Colloquium on Automata, Languages and Programming (ICALP'14, Track A), pages 787-799, 2014. Google Scholar
  16. Alistair Sinclair, Piyush Srivastava, and Marc Thurley. Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. In Proceedings of the 23th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'12), pages 941-953. SIAM, 2012. Google Scholar
  17. Allan Sly. Computational transition at the uniqueness threshold. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS'10), pages 287-296. IEEE, 2010. Google Scholar
  18. Allan Sly and Nike 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'12), pages 361-369. IEEE, 2012. Google Scholar
  19. Eric Vigoda. Improved bounds for sampling colorings. Journal of Mathematical Physics, 41(3):1555-1569, 2000. Google Scholar
  20. Dror Weitz. Counting independent sets up to the tree threshold. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC'06), pages 140-149. ACM, 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
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact