Improved mixing condition on the grid for counting and sampling independent sets

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 140-149

  Restrepo, Ricardo ^a,b   Shin, Jinwoo ^c   Tetali, Prasad ^a   Vigoda, Eric ^c   Yang, Linji ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSIDAD DE ANTIOQUIA   (Colombia)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORICS; CRITICAL VALUE; DETERMINISTIC APPROXIMATION; FINITE GRAPHS; GLAUBER DYNAMICS; GRAPH G; HARD CONSTRAINTS; INDEPENDENT SET; LATTICE GAS MODEL; LOWER BOUNDS; MAXIMUM DEGREE; MIXING CONDITIONS; MULTICAST MODEL; NORMALIZING CONSTANTS; PARTITION FUNCTIONS; POSITIVE REAL PARAMETERS; RAPID MIXING; REGULAR TREE; SELF AVOIDING WALK; SPATIAL MIXING; SQUARE LATTICES; STATISTICAL PHYSICS; SUFFICIENT CRITERION; THEORETICAL COMPUTER SCIENCE; WEIGHTED INDEPENDENT SET PROBLEM;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE; CRYSTAL LATTICES; DELTA FUNCTIONS; FORESTRY; PROBABILITY DISTRIBUTIONS;

MIXING;

ALGORITHMS; COMPUTERS; LATTICES; MIXING; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; SAMPLING;

EID: 84863313807     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.45     Document Type: Conference Paper

References (36)

1. S. E. Alm. Upper bounds for the connective constant of self-avoiding walks. Combinatorics, Probability and Computing, 4(2):115-136, 1993.
2. D. S. Arnon, G. E. Collins, S. McCallum. Cylindrical Algebraic Decomposition I: The Basic Algorithm. SIAM Journal on Computing, 865-877, 1984. (Pubitemid 15510667)
3. R. J. Baxter, I. G. Enting and S. K. Tsang. Hard-square lattice gas. Journal of Statistical Physics, 22(4):465-489, 1980.
4. V. Beffara and H. Duminil-Copin. The self-dual point of the two-dimensional random cluster model is critical for q ≥ 1. To appear in Probability Theory and Related Fields. Preprint available from the arXiv at: http://arxiv.org/abs/1006.5073
5. J. van den Berg and A. Ermakov. A new lower bound for the critical probability of site percolation on the square lattice. Random Structures and Algorithms, 8(3):199-212, 1996.
6. J. van den Berg and J. E. Steif. Percolation and the hardcore lattice gas model. Stochastic Processes and their Applications, 49(2):179-197, 1994.
7. G. R. Brightwell, O. Häggström, and P. Winkler. Non-monotonic behavior in hard-core and Widom-Rowlinson models. Journal of Statistical Physics, 94(3):415-435, 1999.
8. F. Cesi. Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields. Probability Theory and Related Fields, 120(4):569-584, 2001.
9. R. L. Dobrushin. The problem of uniqueness of a Gibbsian random field and the problem of phase transitions. Functional Analysis and its Applications, 2(4):302-312. 1968.
10. R. L. Dobrushin and S. B. Shlosman. Constructive unicity criterion. In Statistical Mechanics and Dynamical Systems, J. Fritz, A. Jaffe, and D. Szasz, eds., Birkhäuser, New York, pp. 347-370, 1985.
11. M. E. Dyer, A. Sinclair, E. Vigoda, and D. Weitz. Mixing in time and space for lattice spin systems: A combinatorial view. Random Structures and Algorithms, 24(4):461-479, 2004. (Pubitemid 40031427)
12. A. Galanis, Q. Ge, D. Štefankovič, E. Vigoda, and L. Yang. Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. Preprint, 2011. Preprint available from the arXiv at: http://arxiv.org/abs/1105.5131
13. D. S. Gaunt and M. E. Fisher. Hard-Sphere Lattice Gases. I. Plane-Square Lattice. Journal of Chemical Physics, 43(8):2840-2863, 1965.
14. H.-O. Georgii. Gibbs Measures and Phase Transitions, de Gruyter, Berlin, 1988.
15. L. Goldberg, R. Martin and M. Paterson. Strong Spatial Mixing for Lattice Graphs with Fewer Colours. SIAM Journal on Computing, 35(2):486-517, 2005.
16. C. Greenhill. The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity, 9(1):52-72, 2000.
17. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution distribution. Theoretical Computer Science, 43(2-3):169-186, 1986.
18. F. P. Kelly. Loss Networks. Annals of Applied Probability, 1(3):319-378, 1991.
19. D. A. Levin, Y. Peres, and E. L. Wilmer. Markov Chains and Mixing Times. American Mathematical Society, 2008.
20. F. Martinelli. Lectures on Glauber dynamics for discrete spin models. Lectures on Probability Theory and Statistics (Saint-Flour, 1997), Lecture Notes in Mathematics, 1717:93-191, 1998.
21. F. Martinelli and E. Olivieri. Approach to equilibrium of Glauber dynamics in the one phase region. I. The attractive case. Communications in Mathematical Physics, 161(3):447- 486, 1994.
22. F. Martinelli and E. Olivieri. Approach to equilibrium of Glauber dynamics in the one phase region. II. The general case. Communications in Mathematical Physics, 161(3):487-514, 1994.
23. L. Onsager. Crystal statistics. I. A two-dimensional model with an order-disorder transition. Physics Review Letters, 65(3-4):117-149, 1944.
24. A. Pönitz and P. Tittman. Improved upper bounds for self-avoiding walks in Zd. Electronic Journal of Combinatorics, 7(1):R21, 2000.
25. Z. Rácz. Phase boundary of Ising antiferromagnets near H = Hc and T = 0: Results from hard-core lattice gas calculations. Physical Review B, 21(9):4012-4016, 1980.
26. D. C. Radulescu. A computer-assisted proof of uniqueness of phase for the hard-square lattice gas model in two dimensions. Ph.D. dissertation, Rutgers University, New Brunswick, NJ, USA,1997.
27. D. C. Radulescu and D. F. Styer. The Dobrushin-Shlosman phase uniqueness criterion and applications to hard squares. Journal of Statistical Physics, 49(1-2):281-295, 1987.
28. D. Randall. Slow mixing of Glauber dynamics via topological obstructions. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 870-879, 2006.
29. A. Sly. Computational Transition at the Uniqueness Threshold. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 287-296, 2010.
30. D. Štefankovič, S. Vempala, and E. Vigoda. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. Journal of the ACM, 56(3):1-36, 2009.
31. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, second edition, 1951.
32. L. G. Valiant. The Complexity of Enumeration and Reliability Problems. SIAM J. Computing, 8(3):410-421, 1979.
33. D. Weitz. Counting independent sets up to the tree threshold. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 140-149, 2006.
34. Data is available from: http://www.cc.gatech.edu/~vigoda/hardcore.html
35. See: http://reference.wolfram.com/mathematica/tutorial/ RealPolynomialSystems.html
36. The full version is available from the arXiv at: http://arxiv.org/abs/ 1105.0914