Mixing

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 4-15

  Randall, Dana ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; MATRIX ALGEBRA; PHYSICS; PROBABILITY DISTRIBUTIONS; RESPONSE TIME (COMPUTER SYSTEMS); SAMPLING; STATISTICAL MECHANICS;

RUNNING TIME; STATIONARY DISTRIBUTION; STATISTICAL PHYSICS;

MARKOV PROCESSES;

EID: 0345412715     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. D. Aldous. Random walks on finite groups and rapidly mixing Markov chains. Séminaire de Probabilités XVII, Springer Lecture Notes in Mathematics 986:243-297, 1981/82.
2. D. Aldous and J. Fill. Reversible Markov chains and Random Walks on Graphs. In preparation, 2003.
3. I. Beichl and F. Sullivan. The Metropolis Algorithm. Computing in Science and Eng., 2: 65-69, 2000.
4. A. Broder. Generating random spanning trees. em Proc. 30th IEEE Symp. on Foundations of Computer Science, 442-447, 1989.
5. R. Bubley and M. Dyer. Faster random generation of linear extensions. Discrete Math., 201:81-88, 1999.
6. B.A. Cipra. An introduction to the Ising model. American Mathematical Monthly 94, pp. 937-959, 1987.
7. C. Cooper, M.E. Dyer, A.M. Frieze and R. Rue. Mixing Properties of the Swendsen-Wang Process on the Complete Graph and Narrow Grids. J. Math. Phys. 41, 1499-1527, 2000.
8. P. Diaconis and L. Saloff-Coste. Comparison theorems for reversible Markov chains. Annals of Applied Probability, 3:696-730, 1993.
9. M.E. Dyer and A. Frieze. Randomly colouring graphs with lower bounds on girth and maximum degree. Proc. 42nd Symp. on Foundations of Computer Science, 579-587, 2001.
10. M.E. Dyer, A. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of a convex body. Proc. 24th ACM Symp. on Theory of Computing, 26-38, 1992.
11. M.E. Dyer, L.A. Goldberg, C. Greenhill, M.R. Jerum, and M. Mitzenmacher. An extension of path coupling and its application to the Glauber dynamics for graph colorings. SIAM J. on Computing, 30: 1962-1975, 2001.
12. M. Dyer and C. Greenhill. A more rapidly mixing Markov chain for graph colorings. Random Structures and Algorithms, 13:285-317, 1998.
13. T.P. Hayes and E. Vigoda. A non-Markovian coupling for randomly sampling colorings. Proc. 44th Symp. on Foundations of Computing, 2003.
14. M.R. Jerrum. A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structures and Algorithms, 7: 157-165, 1995.
15. M.R. Jerrum and A.J. Sinclair. Approximating the permanent. SIAM J. on Comp., 18, 1149-1178, 1989.
16. M.R. Jerrum and A.J. Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting and integration. In Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum, ed., PwS Pulishing, Boston: 482-520, 1997.
17. M.R. Jerrm and A.J. Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM J. on Computing, 22: 1087-1116, 1993.
18. M.R. Jerrum, A.J. Sinclair and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. Proc. 33rd ACM Symp. on Theory of Comp., 712-721, 2001.
19. M.R. Jerrum, L.G. Valiant, and V.V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43: 169-188, 1986.
20. R. Kannan. Markov chains and polynomial time algorithms. Proc. 35th IEEE Symp. on Foundations of Computer Science, 656-671, 1994.
21. L. Lovász and P. Winkler. Mixing times. Microsurveys in Discrete Probability, D. Aldous and J. Propp, eds., DIMACS Series in Discrete Math. and Theoretical Computer Science, 41:85-134, 1998.
22. M. Luby, D. Randall, and A.J. Sinclair. Markov Chains for Planar Lattice Structures. SIAM Journal on Computing, 31: 167-192, 2001.
23. M. Luby and E. Vigoda. Fast convergence of the Glauber dynamics for sampling independent sets. Random Structures and Algorithms, 229-241, 1999.
24. N. Madras and D. Randall. Markov chain decomposition for convergence rate analysis. Annals of Applied Probability, 12: 581-606, 2002.
25. R.A. Martin and D. Randall. Sampling adsorbing staircase walks using a new Markov chain decomposition method. Proceedings of the 41st IEEE Symp. on Foundations of Computer Science, 492-502, 2000.
26. R.A. Martin and D. Randall. Disjoint decomposition with applications to sampling circuits in some Cayley graphs. Preprint, 2003.
27. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21: 1087-1092, 1953.
28. M. Molloy. The Glauber dynamics on colorings of a graph with high girth and maximum degree. Proc. 34th ACM Symp. on Theory of Computing, 91-98, 2002.
29. B. Morris and A. Sinclair. Random walks on truncated cubes and sampling 0/1 knapsack solutions. Proc. 40th IEEE Symp. on Foundations of computer Science, 230-240, 1999.
30. D. Randall. Decomposition Methods and Sampling Circuits in the Cartesian Lattice. Proc. 5th Symposium on Mathematical Foundations of Computer Science, J. Sgall, A. Pultr, and P. Kolman, eds., in Lecture Notes in Computer Science, 1256: 72-84, 2001.
31. D. Randall and P. Tetali. Analyzing Glauber dynamics by comparison of Markov chains. Journal of Mathematical Physics, 41: 1598-1615, 2000.
32. D. Randall and D.B. Wilson. Sampling Spin Configurations of an Ising System. Proc. 10th ACM/SIAM Symposium on Discrete Algorithms, S959-960, 1999.
33. J. Salas and A. Sokal. Absence of phase transitions for antiferromagnetic Potts models via the Dobrushin uniqueness theorem. Journal of Statistical Physics, 86: 551-579, 1997.
34. A.J. Sinclair. Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing, 1: 351-370, 1992.
35. A.J. Sinclair. Convergence rates for Monte Carlo experiments. Numerical Methods for Polymeric Systems, S.G. Whittington, ed., IMA Volumes in Mathematics and its Applications, 1-18, 1997.
36. A.J. Sinclair. Algorithms for random generation & counting: a Markov chain approach. Birkhäuser, Boston, 1993.
37. A.J. Sinclair and M.R. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Comput., 82: 93-133, 1989.
38. L.G. Valiant. The complexity of computing the permanent. Theoretical Computer Sci., 8: 189-201, 1979.