Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More

02/04/2021
by   Yeganeh Alimohammadi, et al.
0

We show fully polynomial time randomized approximation schemes (FPRAS) for counting matchings of a given size, or more generally sampling/counting monomer-dimer systems in planar, not-necessarily-bipartite, graphs. While perfect matchings on planar graphs can be counted exactly in polynomial time, counting non-perfect matchings was shown by [Jer87] to be #P-hard, who also raised the question of whether efficient approximate counting is possible. We answer this affirmatively by showing that the multi-site Glauber dynamics on the set of monomers in a monomer-dimer system always mixes rapidly, and that this dynamics can be implemented efficiently on downward-closed families of graphs where counting perfect matchings is tractable. As further applications of our results, we show how to sample efficiently using multi-site Glauber dynamics from partition-constrained strongly Rayleigh distributions, and nonsymmetric determinantal point processes. In order to analyze mixing properties of the multi-site Glauber dynamics, we establish two notions for generating polynomials of discrete set-valued distributions: sector-stability and fractional log-concavity. These notions generalize well-studied properties like real-stability and log-concavity, but unlike them robustly degrade under useful transformations applied to the distribution. We relate these notions to pairwise correlations in the underlying distribution and the notion of spectral independence introduced by [ALO20], providing a new tool for establishing spectral independence based on geometry of polynomials. As a byproduct of our techniques, we show that polynomials avoiding roots in a sector of the complex plane must satisfy what we call fractional log-concavity; this generalizes a classic result established by [Gar59] who showed homogeneous polynomials that have no roots in a half-plane must be log-concave over the positive orthant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2020

Counting Maximum Matchings in Planar Graphs Is Hard

Here we prove that counting maximum matchings in planar, bipartite graph...
research
09/14/2021

Domain Sparsification of Discrete Distributions using Entropic Independence

We present a framework for speeding up the time it takes to sample from ...
research
12/20/2017

On Counting Perfect Matchings in General Graphs

Counting perfect matchings has played a central role in the theory of co...
research
12/22/2018

Inference and Sampling of K_33-free Ising Models

We call an Ising model tractable when it is possible to compute its part...
research
04/20/2020

Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases

We define a notion of isotropy for discrete set distributions. If μ is a...
research
02/27/2018

Mirrored Langevin Dynamics

We generalize the Langevin Dynamics through the mirror descent framework...

Please sign up or login with your details

Forgot password? Click here to reset