Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
暂无分享,去创建一个
[1] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.
[2] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[3] Reinhard Diestel,et al. Graph Theory , 1997 .
[4] Béla Bollobás,et al. Random Graphs , 1985 .
[5] S. Zachary,et al. Loss networks , 2009, 0903.0640.
[6] Victor K.-W. Wei,et al. Odd and even hamming spheres also have minimum boundary , 1984, Discret. Math..
[7] Eric Vigoda,et al. A Note on the Glauber Dynamics for Sampling Independent Sets , 2001, Electron. J. Comb..
[8] J. Berg,et al. Percolation and the hard-core lattice gas model , 1994 .
[9] R. Dobrushin. The problem of uniqueness of a gibbsian random field and the problem of phase transitions , 1968 .
[10] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[11] S. K Stein,et al. Two Combinatorial Covering Theorems , 1974, J. Comb. Theory, Ser. A.
[12] Martin E. Dyer,et al. On Counting Independent Sets in Sparse Graphs , 2002, SIAM J. Comput..
[13] Jeff Kahn,et al. On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$ , 2004, Combinatorics, Probability and Computing.
[14] M. Luby,et al. Fast convergence of the Glauber dynamics for sampling independent sets , 1999, Random Struct. Algorithms.
[15] Alan M. Frieze,et al. Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[16] David J. Galvin,et al. On homomorphisms from the Hamming cube to Z , 2003 .
[17] Sergei L. Bezrukov. Minimization of Surrounding of Subsets in Hamming Space , 2002 .