Analyzing glauber dynamics by comparison of markov chains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1380, Issue , 1998, Pages 292-304

  Randall, Dana ^a   Tetali, Prasad ^b  

^a Georgia Institute of Technology   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; MONTE CARLO METHODS;

COMBINATORIAL PROBLEM; COMPARISON TECHNIQUES; GLAUBER DYNAMICS; INDEPENDENT SET; MARKOV CHAIN MONTE CARLO ALGORITHMS; POLYNOMIAL BOUNDS; RANDOM PROPERTIES; UPDATE ALGORITHMS;

MARKOV PROCESSES;

EID: 84949224014     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054330     Document Type: Conference Paper

References (23)

1. Aldons, D. Random walks on finite groups and rapidly mixing Markov chains. SJminaire de Probabilités 17, 1981/82, Springer Lecture Notes in Mathematics 986, pp. 243-297.
2. Baxter, R.J. Exactly solved models in statistical mechanics. Academic Press, London, 1982.
3. van den Berg, J. and Steif, J.E. Percolation and the hard-core lattice gas model. Stochastic Processes and their Applications 49, 1994, pp. 179-197.
4. Diaconis, P. and Stroock, D. Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probability 1, 1991, pp. 36-61.
5. Diaconis, P. and Saloff-Coste, L. Comparison theorems for reversible Markov chains. Ann. Appl. Probability 3, 1993, pp. 696-730.
6. Diaconis, P. and Saloff-Coste, L. Logarithmic Sobolev Inequalities for Finite Markov Chains. Ann. of Appl. Probab. 6 (1996), pp. 695-750.
7. Jerrum, M. A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structures and Algorithms 7, 1995, pp. 157-165.
8. Jerrum, M.R. and Sinclair, A.J. Approximating the permanent. SIAM Journal on Computing 18 (1989), pp. 1149-1178.
9. Jerrum, M., Valiant, L. and Vazirani, V. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science 43 (1986), pp. 169-188.
10. Kannan R, Tetali P, and Vempala S. Simple Markov chain algorithms for generating bipartite graphs and tournaments. Proc. Of the 8th A CM-SIAM Syrup. On Discrete Algorithms January 1997.
11. Lieb, E.H. Residual entropy of square ice. Physical Review 162, 1967, pp. 162-172.
12. Lubin, M. and Sokal A.D. Comment on "Antiferromagnetic Potts Model. Phys. Rev. Left. 71, 1993, pp. 1778.
13. Luby, M., Randall, D. and Sinclair, A. Markov Chain Algorithms for Planar Lattice Structures. Proc. 36th IEEE Symposium on Foundations of Computing (1995), pp. 150-159.
14. Luby, M., Vigoda, E. Approximately counting up to four. Proc. 29th ACM Symposium on Theory of Computing (1997), pp. 150-159.
15. Madras, N. and Randall, D. Factoring Graphs to Bound Mixing Time. Proc. 37th IBBB Symposium on Foundations of Computing (1996).
16. Sinclair, A.J. and Jerrum, M.R. Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation 82 (1989), pp. 93-133.
17. Sinclair, A.J. Algorithms for random generation & counting : a Markov chain approach. Birkhäinser, Boston, 1993, pp. 47-48.
18. Sinclair, A.J. Improved bounds for mixing rates of Markov chains and multieommodify flow. Combinatorics, Probability, & Computing. 1 (1992), pp. 351-370.
19. Thurston, W. Conway's tiling groups. American Mathematical Monthly 97, 1990, pp. 757-773.
20. Vigoda, E. personal communication.
21. Welsh, D.J.A. The computational complexity of some classical problems from statistical physics. In Disorder in Physical Systems, (G. Grimmett and D. Welsh eds.). Claredon Press, Oxford, 1990, pp. 323-335.
22. Welsh, D.J.A. Approximate counting. In Surveys in Combinatorics, (R.A. Bailey, ed.). Cambridge University Press, London Math Society Lecture Notes 241, 1997, pp. 287-317.
23. Wilson, D.B. Mixing times of lozenge tiling and card shuffling Markov chains, draft of manuscript.