Approximately counting independent sets in bipartite graphs via graph containers

09/08/2021
by   Matthew Jenssen, et al.
0

By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first algorithm applies to d-regular, bipartite graphs satisfying a weak expansion condition: when d is constant, and the graph is a bipartite Ω( log^2 d/d)-expander, we obtain an FPTAS for the number of independent sets. Previously such a result for d>5 was known only for graphs satisfying the much stronger expansion conditions of random bipartite graphs. The algorithm also applies to weighted independent sets: for a d-regular, bipartite α-expander, with α>0 fixed, we give an FPTAS for the hard-core model partition function at fugacity λ=Ω(log d / d^1/4). Finally we present an algorithm that applies to all d-regular, bipartite graphs, runs in time exp( O( n ·log^3 d /d ) ), and outputs a (1 + o(1))-approximation to the number of independent sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2019

Counting independent sets and colorings on random regular bipartite graphs

We give a fully polynomial-time approximation scheme (FPTAS) to count th...
research
06/04/2019

Counting independent sets in unbalanced bipartite graphs

We give an FPTAS for approximating the partition function of the hard-co...
research
05/11/2020

Faster Exponential-time Algorithms for Approximately Counting Independent Sets

Counting the independent sets of a graph is a classical #P-complete prob...
research
07/18/2023

Approximately counting independent sets in dense bipartite graphs via subspace enumeration

We give a randomized algorithm that approximates the number of independe...
research
07/26/2023

On the hardness of finding balanced independent sets in random bipartite graphs

We consider the algorithmic problem of finding large balanced independen...
research
01/12/2018

A fast new algorithm for weak graph regularity

We provide a deterministic algorithm that finds, in ϵ^-O(1) n^2 time, an...
research
08/13/2020

On the Bipartiteness Constant and Expansion of Cayley Graphs

Let G be a finite, undirected d-regular graph and A(G) its normalized ad...

Please sign up or login with your details

Forgot password? Click here to reset