Approximate counting and sampling via local central limit theorems

08/02/2021
by   Vishesh Jain, et al.
0

We give an FPTAS for computing the number of matchings of size k in a graph G of maximum degree Δ on n vertices, for all k ≤ (1-δ)m^*(G), where δ>0 is fixed and m^*(G) is the matching number of G, and an FPTAS for the number of independent sets of size k ≤ (1-δ) α_c(Δ) n, where α_c(Δ) is the NP-hardness threshold for this problem. We also provide quasi-linear time randomized algorithms to approximately sample from the uniform distribution on matchings of size k ≤ (1-δ)m^*(G) and independent sets of size k ≤ (1-δ)α_c(Δ)n. Our results are based on a new framework for exploiting local central limit theorems as an algorithmic tool. We use a combination of Fourier inversion, probabilistic estimates, and the deterministic approximation of partition functions at complex activities to extract approximations of the coefficients of the partition function. For our results for independent sets, we prove a new local central limit theorem for the hard-core model that applies to all fugacities below λ_c(Δ), the uniqueness threshold on the infinite Δ-regular tree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/09/2021

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

We determine the computational complexity of approximately counting and ...
research
04/20/2020

The complexity of approximating averages on bounded-degree graphs

We prove that, unless P=NP, there is no polynomial-time algorithm to app...
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
05/04/2021

Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region

For spin systems, such as the q-colorings and independent-set models, ap...
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...
research
05/10/2023

Optimal mixing of the down-up walk on independent sets of a given size

Let G be a graph on n vertices of maximum degree Δ. We show that, for an...
research
03/17/2021

Locality of Random Digraphs on Expanders

We study random digraphs on sequences of expanders with bounded average ...

Please sign up or login with your details

Forgot password? Click here to reset