A deterministic algorithm for counting colorings with 2Δ colors

06/04/2019
by   Alistair Sinclair, et al.
0

We give a polynomial time deterministic approximation algorithm (an FPTAS) for counting the number of q-colorings of a graph of maximum degree Δ, provided only that q> 2Δ. This substantially improves on previous deterministic algorithms for this problem, the best of which requires q> 2.58Δ, and matches the natural bound for randomized algorithms obtained by a straightforward application of Markov chain Monte Carlo. In the special case when the graph is also triangle-free, we show that our algorithm applies under the condition q ≥αΔ + β, where α≈ 1.764 and β = β(α) are absolute constants. Our result applies more generally to list colorings, and to the partition function of the anti-ferromagnetic Potts model. Our algorithm exploits the so-called "polynomial interpolation" method of Barvinok, identifying a suitable region of the complex plane in which the Potts model partition function has no zeros. Interestingly, our method for identifying this zero-free region leverages probabilistic and combinatorial ideas that have been used in the analysis of Markov chains.

READ FULL TEXT
research
05/16/2020

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

We present a polynomial-time Markov chain Monte Carlo algorithm for esti...
research
07/14/2019

Zeros of ferromagnetic 2-spin systems

We study zeros of the partition functions of ferromagnetic 2-state spin ...
research
09/21/2022

Quasipolynomial-time algorithms for repulsive Gibbs point processes

We demonstrate a quasipolynomial-time deterministic approximation algori...
research
12/18/2018

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs

For a graph G=(V,E), k∈N, and a complex number w the partition function ...
research
01/30/2022

Polynomial-Time Approximation of Zero-Free Partition Functions

Zero-free based algorithm is a major technique for deterministic approxi...
research
01/20/2019

Markov chains for the hard-core model via polymer models

Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling alg...
research
12/15/2017

Counting Solutions of a Polynomial System Locally and Exactly

We propose a symbolic-numeric algorithm to count the number of solutions...

Please sign up or login with your details

Forgot password? Click here to reset