Fast convergence of the Glauber dynamics for sampling independent sets

We consider the problem of sampling independent sets of a graph with maximum degree δ. The weight of each independent set is expressed in terms of a fixed positive parameter λ≤2/(δ−2), where the weight of an independent set σ is λ|σ|. The Glauber dynamics is a simple Markov chain Monte Carlo method for sampling from this distribution. We show fast convergence (in O(n log n) time) of this dynamics. This paper gives the more interesting proof for triangle-free graphs. The proof for arbitrary graphs is given in a companion paper (E. Vigoda, Technical Report TR-99-003, International Computer Institute, Berkeley, CA, 1998). We also prove complementary hardness of approximation results, which show that it is hard to sample from this distribution when λ>c/δ for a constant c≤0. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 229–241, 1999

[1]  R. Dobrushin.  The problem of uniqueness of a gibbsian random field and the problem of phase transitions , 1968 .

[2]  S. K. Tsang,et al.  Hard-square lattice gas , 1980 .

[3]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4]  R. Dobrushin,et al.  Constructive Criterion for the Uniqueness of Gibbs Field , 1985 .

[5]  R. L. Dobrushin,et al.  Phase diagram of the two-dimensional Ising antiferromagnet (computer-assisted proof) , 1985 .

[6]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[7]  R. Holley,et al.  Rapid Convergence to Equilibrium of Stochastic Ising Models in the Dobrushin Shlosman Regime , 1987 .

[8]  Dan Constantin Radulescu,et al.  The Dobrushin-Shlosman phase uniqueness criterion and applications to hard squares , 1987 .

[9]  Daniel F. Styer,et al.  Vasserstein distances in two-state systems , 1989 .

[10]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[11]  F. Martinelli,et al.  Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .

[12]  J. Berg,et al.  Percolation and the hard-core lattice gas model , 1994 .

[13]  F. Martinelli,et al.  Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .

[14]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[15]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

[16]  Eric Vigoda,et al.  Approximately counting up to four (extended abstract) , 1997, STOC '97.

[17]  P. Berman,et al.  On Some Tighter Inapproximability Results , 1998, Electron. Colloquium Comput. Complex..

[18]  P. Tetali,et al.  Analyzing Glauber dynamics by comparison of Markov chains , 2000 .