Complex contraction on trees without proof of correlation decay

by   Liang Li, et al.

We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's algorithmic paradigm<cit.>. Relying on the computation tree expansion, our approach does not need proof of correlation decay in the real axis. We directly look in the complex plane for a region that contracts into its interior as the tree recursion procedure goes from leaves to the root. For the class of problems under the framework of weighted set covers, we are able to give a general approach for describing the contraction regions and draw a unified algorithmic conclusion. Several previous results, including counting (weighted-)edge covers, counting bipartite independent sets and counting monotone CNFs can be completely or partially covered by our main theorem. In contrast to the correlation decay method which also depends on tree expansions and needs different potential functions for different problems, our approach is more generic in the sense that our contraction region for different problems shares a common shape in the complex plane.


page 1

page 2

page 3

page 4


Contraction: a Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems

We study complex zeros of the partition function of 2-spin systems, view...

Improved Strong Spatial Mixing for Colorings on Trees

Strong spatial mixing (SSM) is a form of correlation decay that has play...

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction

For general antiferromagnetic 2-spin systems, including the hardcore mod...

Zeros of ferromagnetic 2-spin systems

We study zeros of the partition functions of ferromagnetic 2-state spin ...

Parallel Weighted Model Counting with Tensor Networks

A promising new algebraic approach to weighted model counting makes use ...

Counting Roots of a Polynomial in a Convex Compact Region by Means of Winding Number Calculation via Sampling

In this paper, we propose a novel efficient algorithm for calculating wi...

The complexity of approximating the matching polynomial in the complex plane

We study the problem of approximating the value of the matching polynomi...

Please sign up or login with your details

Forgot password? Click here to reset