Glauber dynamics on trees and hyperbolic graphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 568-578

  Kenyon, Claire ^a   Mossel, Elchanan ^b   Peres, Yuval ^c  

^a CNRS   (France)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CONSTRAINT THEORY; CORRELATION METHODS; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; RANDOM PROCESSES;

HYPERBOLIC GRAPHS;

TREES (MATHEMATICS);

EID: 0035176101     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2001.959933     Document Type: Article

References (28)

1. A uniqueness condition for Gibbs measures, with application to the 2-dimensional Ising antiferromagnet
2. On the purity of limiting Gibbs state for the Ising model on the Bethe lattice
3. Path coupling: A technique for proving rapid mixing in Markov chains
4. Trilogy of couplings and general formulas for lower bound of spectral gap
5. On Markov chains for independent sets
6. Broadcasting on trees and the Ising Model
7. A note on the extremality of the disordered state for the Ising model on the Bethe lattice
8. A very simple algorithm for estimating the number of k-colorings of a low-degree graph
9. Approximating the permanent
10. Polynomial time approximation algorithms for the Ising model
11. A Polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
12. The vertex seperation number of a graph equals its path-width
13. Approximately counting up to four
14. Fast convergence of the glauber dynamics for sampling independent sets, statistical physics methods in discrete probability, combinatorics and theoretical computer science
15. Lectures on Glauber dynamics for discrete spin models
16. Reconstruction on trees: Beating the second eigenvalue
17. Recursive reconstruction on periodic trees
18. Exact sampling with coupled Markov chains and applications to statistical mechanics
19. Analyzing glauber dynamics by comparison of Markov chains
20. Graph minors. I. Excluding a forest
21. Lectures on finite Markov chains
22. Improved bounds for sampling colorings. Probabilistic techniques in equilibrium and nonequilibrium statistical physics