Approximately counting independent sets of a given size in bounded-degree graphs

02/09/2021
by   Ewan Davies, et al.
0

We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density α_c(Δ) and provide (i) for α < α_c(Δ) randomized polynomial-time algorithms for approximately sampling and counting independent sets of given size at most α n in n-vertex graphs of maximum degree Δ; and (ii) a proof that unless NP=RP, no such algorithms exist for α>α_c(Δ). The critical density is the occupancy fraction of hard core model on the clique K_Δ+1 at the uniqueness threshold on the infinite Δ-regular tree, giving α_c(Δ)∼e/1+e1/Δ as Δ→∞.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2021

Counting independent sets in strongly orderable graphs

We consider the problem of devising algorithms to count exactly the numb...
research
08/02/2021

Approximate counting and sampling via local central limit theorems

We give an FPTAS for computing the number of matchings of size k in a gr...
research
08/29/2018

Counting Independent Sets in Cocomparability Graphs

We show that the number of independent sets in cocomparability graphs ca...
research
11/04/2021

Computational thresholds for the fixed-magnetization Ising model

The ferromagnetic Ising model is a model of a magnetic material and a ce...
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/04/2019

The Complexity of Approximately Counting Retractions to Square-Free Graphs

A retraction is a homomorphism from a graph G to an induced subgraph H o...
research
12/06/2022

Inapproximability of counting independent sets in linear hypergraphs

It is shown in this note that approximating the number of independent se...

Please sign up or login with your details

Forgot password? Click here to reset