Skip to main content
Article thumbnail
Location of Repository

Counting independent sets using the Bethe approximation

By Venkat Chandrasekaran, Misha Chertkov, David Gamarnik and Devavrat Shah

Abstract

Abstract. We consider the #P-complete problem of counting the number of independent sets in a given graph. Our interest is in understanding the effectiveness of the popular belief propagation (BP) heuristic. BP is a simple iterative algorithm that is known to have at least one fixed point, where each fixed point corresponds to a stationary point of the Bethe free energy (introduced by Yedidia, Freeman, and Weiss [IEEE Trans. Inform. Theory, 51 (2004), pp. 2282–2312] in recognition of Bethe’s earlier work in 1935). The evaluation of the Bethe free energy at such a stationary point (or BP fixed point) leads to the Bethe approximation for the number of independent sets of the given graph. BP is not known to converge in general, nor is an efficient, convergent procedure for finding stationary points of the Bethe free energy known. Furthermore, the effectiveness of the Bethe approximation is not well understood. As the first result of this paper we propose a BP-like algorithm that always converges to a stationary point of the Bethe free energy for any graph for the independent set problem. This procedure finds an ε-approximate stationary point in Oðn 2 d 4 2 d ε −4 log 3 ðnε −1 ÞÞ iterations for a graph of n nodes with max-degree d. We study the quality of the resulting Bethe approximation using the recently developed “loop series ” framework of Chertkov and Chernyak [J. Stat. Mech. Theory Exp.,6 (2006), P06009]. As this characterization is applicable only for exact stationary points of the Bethe free energy, we provide a slightly modified characterization that holds for ε-approximate stationary points. We establish that for any graph on n nodes with max-degree d and girth larger than 8d log 2 n, the multiplicative error between the number of independent sets and the Bethe approximation decays as 1 þ Oðn −γ Þ for some γ> 0. This provides a deterministic counting algorithm that leads to strictly different results compared t

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.7014
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://users.cms.caltech.edu/~... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.