A very simple algorithm for estimating the number of k-colorings of a low-degree graph
Random Structures & Algorithms
Randomly Coloring Constant Degree Graphs
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
SIAM Journal on Computing
Counting without sampling: new algorithms for enumeration problems using statistical physics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Loopy belief propagation and Gibbs measures
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Simple deterministic approximation algorithms for counting matchings
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Sequential cavity method for computing limits of the log-partition function for lattice models
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
A deterministic approximation algorithm for computing the permanent of a 0,1 matrix
Journal of Computer and System Sciences
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Correlation decay and deterministic FPTAS for counting colorings of a graph
Journal of Discrete Algorithms
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
Hi-index | 0.00 |
We propose a deterministic algorithm for approximately counting the number of list colorings of a graph. Under the assumption that the graph is triangle free, the size of every list is at least αΔ, where α is an arbitrary constant bigger than α = 2.8432 ..., the solution of αe-1/α = 2, and α is the maximum degree of the graph, we obtain the following results. For the case when the size of the each list is a large constant, we show the existence of a deterministic FPTAS for computing the total number of list colorings. The same deterministic algorithm has complexity 2O(log2 n) without any assumptions on the sizes of the lists, where n is the size of the instance. Our results are not based on the most powerful existing counting technique - rapidly mixing Markov chain method. Rather we build upon concepts from statistical physics, in particular, the decay of correlation phenomena and its implication for the uniqueness of Gibbs measures in infinite graphs. This approach was proposed in two recent papers [BG06] and [Wei05]. The principle insight of the present work is that the correlation decay property can be established with respect to certain computation tree, as opposed to the conventional correlation decay property which is typically established with respect to graph theoretic neighborhoods of a given node. This allows truncation of computation at a logarithmic depth in order to obtain polynomial accuracy in polynomial time. While the analysis conducted in this paper is limited to the problem of counting list colorings, the proposed algorithm can be extended to an arbitrary constraint satisfaction problem in a straightforward way.