Improved bound on the phase transition for independent sets in the square lattice

Eric Vigoda

College of Computing, Georgia Institute of Technology, Atlanta, USA

College of Computing, Georgia Institute of Technology, Atlanta, USA

2011/7/14 Thu 4PM-5PM (Room 3433, Bldg. E6-1)

The hard-core model has received much attention in the past couple of decades as a lattice gas model with hard constraints in statistical physics, a multicast model of calls in communication networks, and as a weighted independent set problem in combinatorics, probability and theoretical computer science.

In this model, each independent set I in a graph G is weighted proportionally to λ

We focus on the well-studied particular case of the square lattice Z

This is joint work with Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, and Linji Yang. A preprint is available from the arXiv at: arxiv:1105.0914

In this model, each independent set I in a graph G is weighted proportionally to λ

^{|I|}, for a positive real parameter λ. For large λ, computing the partition function (namely, the normalizing constant which makes the weighting a probability distribution on a finite graph) on graphs of maximum degree Δ≥3, is a well known computationally challenging problem. More concretely, let λ_{c}(T_{Δ}) denote the critical value for the so-called uniqueness threshold of the hard-core model on the infinite Δ-regular tree; recent breakthrough results of Dror Weitz (2006) and Allan Sly (2010) have identified λ_{c}(T_{Δ}) as a threshold where the hardness of estimating the above partition function undergoes a computational transition.We focus on the well-studied particular case of the square lattice Z

^{2}, and provide a new lower bound for the uniqueness threshold, in particular taking it well above λ_{c}(T_{4}). Our technique refines and builds on the tree of self-avoiding walks approach of Weitz, resulting in a new technical sufficient criterion (of wider applicability) for establishing strong spatial mixing (and hence uniqueness) for the hard-core model. Our new criterion achieves better bounds on strong spatial mixing when the graph has extra structure, improving upon what can be achieved by just using the maximum degree. Applying our technique to Z^{2}we prove that strong spatial mixing holds for all λ<2.3882, improving upon the work of Weitz that held for λ<27/16=1.6875. Our results imply a fully-polynomial*deterministic*approximation algorithm for estimating the partition function, as well as rapid mixing of the associated Glauber dynamics to sample from the hard-core distribution.This is joint work with Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, and Linji Yang. A preprint is available from the arXiv at: arxiv:1105.0914

Tags: EricVigoda