A new lower bound for the critical probability of site percolation on the square lattice
Random Structures & Algorithms
Approximately counting up to four (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On Markov chains for independent sets
Journal of Algorithms
On Counting Independent Sets in Sparse Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A computer-assisted proof of uniqueness of phase for the hard-square lattice gas model in two dimensions
Fast mixing for independent sets, colorings and other models on trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Strong Spatial Mixing for Lattice Graphs with Fewer Colours
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Mixing in time and space for discrete spin systems
Mixing in time and space for discrete spin systems
Coupling with the stationary distribution and improved sampling for colorings and independent sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Mixing in time and space for lattice spin systems: A combinatorial view
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
Simple deterministic approximation algorithms for counting matchings
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Counting good truth assignments of random k-SAT formulae
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Random sampling of colourings of sparse random graphs with a constant number of colours
Theoretical Computer Science
Random Structures & 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
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM (JACM)
Mathematics of Operations Research
A spectral approach to analysing belief propagation for 3-colouring
Combinatorics, Probability and Computing
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
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
Approximating partition functions of the two-state spin system
Information Processing Letters
Improved inapproximability results for counting independent sets in the hard-core model
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Phase transition for Glauber dynamics for independent sets on regular trees
Proceedings of the twenty-second 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
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Left and right convergence of graphs with bounded degree
Random Structures & Algorithms
Lee-Yang theorems and the complexity of computing averages
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
Consider the problem of approximately counting weighted independent sets of a graph G with activity λ, i.e., where the weight of an independent set I is λ|I|. We present a novel analysis yielding a deterministic approximation scheme which runs in polynomial time for any graph of maximum degree Δ and λc=(Δ-1)Δ-1/(Δ-2)Δ. This improves on the previously known general bound of λ ≤ (2 ‾ Δ-2). The new regime includes the interesting case of λ=1 (uniform weights) and Δ ≤ 5. The previous bound required Δ ≤ 4 for uniform approximate counting and there is evidence that for Δ ≥ 6 the problem is hard. Note that λc is the critical activity for uniqueness of the Gibbs measure on the regular tree of degree Δ, i.e., for λ ≤ λc the probability that the root is in the independent set is asymptotically independent of the configuration on the leaves far below. Indeed, our analysis is focused on establishing decay of correlations with distance in the above weighted distribution. We show that on any graph of maximum degree Δ correlations decay with distance at least as fast as they do on the regular tree of the same degree. This resolves an open conjecture in statistical physics. Our comparison of a general graph with the tree uses an algorithmic argument yielding the approximation scheme mentioned above. Also, by existing arguments, establishing decay of correlations for all graphs and λc gives that the Glauber dynamics is rapidly mixing in this regime. However, the implication from decay of correlations to rapid mixing of the dynamics is only known to hold for graphs of subexponential growth, and hence, our result regarding the Glauber dynamics is limited to this class of graphs.