Skip to main content
×
Home
    • Aa
    • Aa

Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models

  • ANDREAS GALANIS (a1), DANIEL ŠTEFANKOVIČ (a2) and ERIC VIGODA (a1)
Abstract

Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006), establish a beautiful picture of the computational complexity of approximating the partition function of the hard-core model. Let λ c ( $\mathbb{T}_{\Delta}$ ) denote the critical activity for the hard-model on the infinite Δ-regular tree. Weitz presented an FPTAS for the partition function when λ < λ c ( $\mathbb{T}_{\Delta}$ ) for graphs with constant maximum degree Δ. In contrast, Sly showed that for all Δ ⩾ 3, there exists εΔ > 0 such that (unless RP = NP) there is no FPRAS for approximating the partition function on graphs of maximum degree Δ for activities λ satisfying λ c ( $\mathbb{T}_{\Delta}$ ) < λ < λ c ( $\mathbb{T}_{\Delta}$ ) + εΔ.

We prove that a similar phenomenon holds for the antiferromagnetic Ising model. Sinclair, Srivastava and Thurley (2014) extended Weitz's approach to the antiferromagnetic Ising model, yielding an FPTAS for the partition function for all graphs of constant maximum degree Δ when the parameters of the model lie in the uniqueness region of the infinite Δ-regular tree. We prove the complementary result for the antiferromagnetic Ising model without external field, namely, that unless RP = NP, for all Δ ⩾ 3, there is no FPRAS for approximating the partition function on graphs of maximum degree Δ when the inverse temperature lies in the non-uniqueness region of the infinite tree $\mathbb{T}_{\Delta}$ . Our proof works by relating certain second moment calculations for random Δ-regular bipartite graphs to the tree recursions used to establish the critical points on the infinite tree.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[1] D. Achlioptas and A. Naor (2005) The two possible values of the chromatic number of a random graph. Ann. of Math. 162 13331349.

[2] D. Achlioptas and Y. Peres (2004) The threshold for random k-SAT is 2 k log 2 - O(k). J. Amer. Math. Soc. 17 947973.

[3] V. Beffara and H. Duminil-Copin (2012) The self-dual point of the two-dimensional random cluster model is critical for q ⩾ 1. Probab. Theory Rel. Fields 153 511542.

[6] A. Dembo , A. Montanari and N. Sun (2013) Factor models on locally tree-like graphs. Ann. Probab. 41 41624213.

[7] M. Dyer , A. M. Frieze and M. Jerrum (2002) On counting independent sets in sparse graphs. SIAM J. Comput. 31 15271541.

[8] A. Galanis , Q. Ge , D. Štefankovič , E. Vigoda and L. Yang (2014) Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Alg. 45 78110.

[12] L. A. Goldberg , M. Jerrum and M. Paterson (2003) The computational complexity of two-state spin systems. Random Struct. Alg. 23 133154.

[13] C. Greenhill (2000) The complexity of counting colorings and independent sets in sparse graphs and hypergraphs. Comput. Complexity 9 5272.

[15] S. Janson , T. Łuczak and A. Rucinski (2000) Random Graphs, Wiley-Interscience.

[16] M. Jerrum and A. Sinclair (1993) Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput. 22 10871116.

[19] F. Martinelli , A. Sinclair and D. Weitz (2004) Glauber dynamics on trees: Boundary conditions and mixing time. Comm. Math. Phys. 250 301334.

[20] F. Martinelli , A. Sinclair and D. Weitz (2007) Fast mixing for independent sets, colorings, and other models on trees. Random Struct. Alg. 31 134172.

[21] M. Mezard and A. Montanari (2009) Information, Physics, and Computation, Oxford University Press.

[22] M. Molloy , H. Robalewska , R. W. Robinson and N. C. Wormald (1997) 1-factorizations of random regular graphs. Random Struct. Alg. 10 305321.

[24] E. Mossel , D. Weitz and N. Wormald (2009) On the hardness of sampling independent sets beyond the tree threshold. Probab. Theory Rel. Fields 143 401439.

[25] R. Restrepo , J. Shin , P. Tetali , E. Vigoda and L. Yang (2013) Improved mixing condition on the grid for counting and sampling independent sets. Probab. Theory Rel. Fields 156 7599.

[26] A. Sinclair , P. Srivastava and M. Thurley (2014) Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. J. Statist. Phys. 155 666686.

[28] A. Sly and N. Sun (2014) The computational hardness of counting in two-spin models on d-regular graphs. Ann. Probab. 42 23832416.

[30] L. G. Valiant (1979) The complexity of enumeration and reliability problems. SIAM J. Comput. 8 410421.

[32] N. C. Wormald (1999) Models of random regular graphs. In Surveys in Combinatorics 1999 ( J. D. Lamb and D. A. Preece , eds), Cambridge University Press, pp. 239298.

[33] J. Zhang , H. Liang and F. Bai (2011) Approximating partition functions of two-state spin systems. Inform. Process. Lett. 111 702710.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 23 *
Loading metrics...

Abstract views

Total abstract views: 243 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 21st September 2017. This data will be updated every 24 hours.