Improved inapproximability results for counting independent sets in the hard-core model
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Approximating the partition function of the ferromagnetic Potts model
Journal of the ACM (JACM)
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Lee-Yang theorems and the complexity of computing averages
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The hardcore model is a model of lattice gas systems which has received much attention in statistical physics, probability theory and theoretical computer science. It is the probability distribution over independent sets $I$ of a graph weighted proportionally to $\lambda^{|I|}$ with fugacity parameter $\lambda$. We prove that at the uniqueness threshold of the hardcore model on the $d$-regular tree, approximating the partition function becomes computationally hard on graphs of maximum degree $d$. Specifically, we show that unless NP$=$RP there is no polynomial time approximation scheme for the partition function (the sum of such weighted independent sets) on graphs of maximum degree $d$ for fugacity $\lambda_c(d) 0$. Weitz produced an FPTAS for approximating the partition function when $0