Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 941-953

  Sinclair, Alistair ^a   Srivastava, Piyush ^a   Thurley, Marc ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CENTRE DE RECERCA MATEMÀTICA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FERROMAGNETIC MATERIALS; FERROMAGNETISM; FORESTRY; GRAPHIC METHODS; ISING MODEL; MIXING; POLYNOMIAL APPROXIMATION; SPIN DYNAMICS; STATISTICAL PHYSICS;

BOUNDED DEGREE GRAPHS; CRITICAL ACTIVITIES; FERROMAGNETIC ISING MODELS; FERROMAGNETIC SPIN SYSTEMS; MAXIMUM DEGREE; PARTITION FUNCTIONS; SOFT CONSTRAINT; WEIGHTED INDEPENDENT SETS;

TREES (MATHEMATICS);

ALGORITHMS; FORESTRY; MODELS;

EID: 84860134811     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.75     Document Type: Conference Paper

References (15)

1. M. E. Dyer, A. M. Frieze, and M. Jerrum. On counting independent sets in sparse graphs. SIAM J. Comput., 31(5):1527-1541, 2002. (Pubitemid 35298410)
2. A. Galanis, Q. Ge, D. Stefankovic, E. Vigoda, and L. Yang. Improved inapproximability results for counting independent sets in the hard-core model. In L. A. Goldberg, K. Jansen, R. Ravi, and J. D. P. Rolim, editors, APPROX-RANDOM, volume 6845 of Lecture Notes in Computer Science, pages 567-578. Springer, 2011.
3. H.-O. Georgii. Gibbs Measures and Phase Transitions. De Gruyter Studies in Mathematics. Walter de Gruyter Inc., October 1988.
4. A. Gerschenfeld and A. Montanari. Reconstruction for models on random graphs. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pages 194-204, Washington, DC, USA, 2007. IEEE Computer Society.
5. L. A. Goldberg, M. Jerrum, and M. Paterson. The computational complexity of two-state spin systems. Random Structures and Algorithms, 23:133-154, 2003.
6. M. Jerrum and A. Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput, 22(5):1087-1116, 1993.
7. L. Li, P. Lu, and Y. Yin. Approximate counting via correlation decay in spin systems. CoRR, abs/1109.0604, 2011.
8. To appear in the Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, 2012.
9. E. Mossel, D. Weitz, and N. Wormald. On the hardness of sampling independent sets beyond the tree threshold. Probab. Theory Related Fields, 143(3-4):401-439, 2009.
10. R. Restrepo, J. Shin, P. Tetali, E. Vigoda, and L. Yang. Improved mixing condition on the grid for counting and sampling independent sets. CoRR, abs/1105.0914, 2011.
11. To appear in the Proceedings of the 52nd Annual IEEE Symposium on the Foundations of Computer Science, 2011.
12. A. Sly. Computational transition at the uniqueness threshold. In Proceedings of the 51st Annual Symposium on Foundations of Computer Science, pages 287-296. IEEE Computer Society, 2010.
13. D. Weitz. Private communication. 2011.
14. D. Weitz. Counting independent sets up to the tree threshold. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 140-149, New York, NY, USA, 2006. ACM.
15. J. Zhang, H. Liang, and F. Bai. Approximating partition functions of two-state spin systems. CoRR, abs/0911.5486, 2009.