Abstract

AbstractWe study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Δ. More generally, for an input graph and an activity , we are interested in the quantity defined as the sum over independent sets I weighted as . In statistical physics, is the partition function for the hard‐core model, which is an idealized model of a gas where the particles have non‐negligible size. Recently, an interesting phase transition was shown to occur for the complexity of approximating the partition function. Weitz showed an FPAS for the partition function for any graph of maximum degree Δ when Δ is constant and . The quantity is the critical point for the so‐called uniqueness threshold on the infinite, regular tree of degree Δ. On the other side, Sly proved that there does not exist efficient (randomized) approximation algorithms for , unless , for some function . We remove the upper bound in the assumptions of Sly's result for , that is, we show that there does not exist efficient randomized approximation algorithms for all for and . Sly's inapproximability result uses a clever reduction, combined with a second‐moment analysis of Mossel, Weitz and Wormald which prove torpid mixing of the Glauber dynamics for sampling from the associated Gibbs distribution on almost every regular graph of degree Δ for the same range of λ as in Sly's result. We extend Sly's result by improving upon the technical work of Mossel et al., via a more detailed analysis of independent sets in random regular graphs. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 45, 78–110, 2014

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.