Skip to main content
×
Home

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
References
Hide All
[1] Achlioptas D. and Naor A. (2005) The two possible values of the chromatic number of a random graph. Ann. of Math. 162 13331349.
[2] Achlioptas D. and Peres Y. (2004) The threshold for random k-SAT is 2 k log 2 - O(k). J. Amer. Math. Soc. 17 947973.
[3] Beffara V. and Duminil-Copin H. (2012) The self-dual point of the two-dimensional random cluster model is critical for q ⩾ 1. Probab. Theory Rel. Fields 153 511542.
[4] de Bruijn N. G. (1981) Asymptotic Methods in Analysis, Dover.
[5] Cai J.-Y., Galanis A., Goldberg L. A., Guo H., Jerrum M., Štefankovič D. and Vigoda E. (2014) #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. In Proc. 18th International Workshop on Randomization and Computation (RANDOM), pp. 582–595.
[6] Dembo A., Montanari A. and Sun N. (2013) Factor models on locally tree-like graphs. Ann. Probab. 41 41624213.
[7] Dyer M., Frieze A. M. and Jerrum M. (2002) On counting independent sets in sparse graphs. SIAM J. Comput. 31 15271541.
[8] Galanis A., Ge Q., Štefankovič D., Vigoda E. and Yang L. (2014) Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Alg. 45 78110.
[9] Galanis A., Štefankovič D. and Vigoda E. (2012) Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models. arXiv.org:1203.2226
[10] Galanis A., Štefankovič D. and Vigoda E. (2014) Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. In Proc. 46th Annual ACM Symposium on Theory of Computing (STOC). 62 pp. 823–831. http://dl.acm.org/citation.cfm?doid=2785964
[11] Georgii H.-O. (1988) Gibbs Measures and Phase Transitions , Vol. 9 of De Gruyter Studies in Mathematics, Walter de Gruyter.
[12] Goldberg L. A., Jerrum M. and Paterson M. (2003) The computational complexity of two-state spin systems. Random Struct. Alg. 23 133154.
[13] Greenhill C. (2000) The complexity of counting colorings and independent sets in sparse graphs and hypergraphs. Comput. Complexity 9 5272.
[14] Janson S. (1995) Random regular graphs: Asymptotic distributions and contiguity. Combin. Probab. Comput. 4 369405.
[15] Janson S., Łuczak T. and Rucinski A. (2000) Random Graphs, Wiley-Interscience.
[16] Jerrum M. and Sinclair A. (1993) Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput. 22 10871116.
[17] Kelly F. P. (1985) Stochastic models of computer communication systems. J. Royal Statist. Soc. Ser. B 47 379395.
[18] Li L., Lu P. and Yin Y. (2013) Correlation decay up to uniqueness in spin systems. In Proc. 24th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 47–66.
[19] Martinelli F., Sinclair A. and Weitz D. (2004) Glauber dynamics on trees: Boundary conditions and mixing time. Comm. Math. Phys. 250 301334.
[20] Martinelli F., Sinclair A. and Weitz D. (2007) Fast mixing for independent sets, colorings, and other models on trees. Random Struct. Alg. 31 134172.
[21] Mezard M. and Montanari A. (2009) Information, Physics, and Computation, Oxford University Press.
[22] Molloy M., Robalewska H., Robinson R. W. and Wormald N. C. (1997) 1-factorizations of random regular graphs. Random Struct. Alg. 10 305321.
[23] Mossel E. (2004) Survey: Information flow on trees. In Graphs, Morphisms, and Statistical Physics, Vol. 63 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 155–170.
[24] Mossel E., Weitz D. and Wormald N. (2009) On the hardness of sampling independent sets beyond the tree threshold. Probab. Theory Rel. Fields 143 401439.
[25] Restrepo R., Shin J., Tetali P., Vigoda E. and Yang L. (2013) Improved mixing condition on the grid for counting and sampling independent sets. Probab. Theory Rel. Fields 156 7599.
[26] Sinclair A., Srivastava P. and Thurley M. (2014) Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. J. Statist. Phys. 155 666686.
[27] Sly A. (2010) Computational transition at the uniqueness threshold. In Proc. 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 287–296.
[28] Sly A. and Sun N. (2014) The computational hardness of counting in two-spin models on d-regular graphs. Ann. Probab. 42 23832416.
[29] Talagrand M. (2003) Spin Glasses: A Challenge for Mathematicians, Springer.
[30] Valiant L. G. (1979) The complexity of enumeration and reliability problems. SIAM J. Comput. 8 410421.
[31] Weitz D. (2006) Counting independent sets up to the tree threshold. In Proc. 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 140–149.
[32] Wormald N. C. (1999) Models of random regular graphs. In Surveys in Combinatorics 1999 (Lamb J. D. and Preece D. A., eds), Cambridge University Press, pp. 239298.
[33] Zhang J., Liang H. and Bai F. (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: 26 *
Loading metrics...

Abstract views

Total abstract views: 287 *
Loading metrics...

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