Improved inapproximability results for counting independent sets in the hard-core model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6845 LNCS, Issue , 2011, Pages 567-578

  Galanis, Andreas ^a   Ge, Qi ^b   Štefankovič, Daniel ^b   Vigoda, Eric ^a   Yang, Linji ^a  

^a Georgia Institute of Technology   (United States)

^b University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COUNTING INDEPENDENT SETS; CRITICAL POINTS; GIBBS DISTRIBUTION; GLAUBER DYNAMICS; IDEALIZED MODELS; INAPPROXIMABILITY; INDEPENDENT SET; INPUT GRAPHS; MAXIMUM DEGREE; PARTITION FUNCTIONS; RANDOM REGULAR GRAPH; RANDOMIZED APPROXIMATION; REGULAR GRAPHS; REGULAR TREE; STATISTICAL PHYSICS; TECHNICAL WORK; TORPID MIXING; UPPER BOUND;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 80052369492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22935-0_48     Document Type: Conference Paper

References (16)

1. van den Berg, J., Steif, J.E.: Percolation and the hard-core lattice gas model. Stochastic Processes and their Applications 49(2), 179-197 (1994)
2. Dyer, M., Frieze, A.M., Jerrum, M.: On counting independent sets in sparse graphs. SIAM J. Comput. 31(5), 1527-1541 (2002)
3. Galanis, A., Ge, Q., Štefankovič, D., Vigoda, E., Yang, L.: Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model (2011) Preprint available from the arXiv at, http://arxiv.org/abs/1105.5131
4. Gaunt, D.S., Fisher, M.E.: Hard-Sphere Lattice Gases. I. Plane-Square Lattice. Journal of Chemical Physics 43(8), 2840-2863 (1965)
5. Greenhill, C.: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity 9(1), 52-72 (2000)
6. Jerrum, M.R., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution distribution. Theoretical Computer Science 43(2-3), 169-186 (1986)
7. Kelly, F.P.: Loss Networks. Annals of Applied Probability 1(3), 319-378 (1991)
8. Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Society, Providence (2009)
9. Molloy, M., Robalewska, H., Robinson, R.W., Wormald, N.C.: 1-factorizations of random regular graphs. Random Structures and Algorithms 10(3), 305-321 (1997)
10. Mossel, E., Weitz, D., Wormald, N.: On the hardness of sampling independent sets beyond the tree threshold. Probability Theory and Related Fields 143(3-4), 401-439 (2009)
11. Sly, A.: Computational Transition at the Uniqueness Threshold. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 287-296 (2010), Full version available from the arXiv at, http://arxiv.org/abs/1005.5584
12. Štefankovič, D., Vempala, S., Vigoda, E.: Adaptive Simulated Annealing: A Nearoptimal Connection between Sampling and Counting. Journal of the ACM 56(3), 1-36 (2009)
13. Strzebonski, A.W.: Cylindrical algebraic decomposition using validated numerics. J. Symb. Comput. 41(9), 1021-1038 (2006)
14. Tarski, A.: RAND Corporation, Santa Monica, Calif. RAND Corporation, Santa Monica (1948)
15. Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM J. Computing 8(3), 410-421 (1979)
16. Weitz, D.: Counting independent sets up to the tree threshold. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 140-149 (2006)