Mathematical aspects of mixing times in Markov Chains

Foundations and Trends in Theoretical Computer Science

Volumn 1, Issue 3, 2006, Pages 237-354

  Montenegro, Ravi ^a   Tetali, Prasad ^b  

^a UNIVERSITY OF MASSACHUSETTS LOWELL   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; PROBABILITY;

ANALYTICAL METHODS; DISCRETE LOGARITHM; LOWER BOUNDS; MIXING TIMES; POLLARD RHO RANDOM WALK;

MARKOV PROCESSES;

EID: 33746329613     PISSN: 1551305X     EISSN: 15513068     Source Type: Journal    
DOI: 10.1561/0400000003     Document Type: Review

References (74)

1. D. J. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, (book to appear). URL for draft at http://stat-www.berkeley.edu/ users/aldous/RWG/book.html.
2. N. Alon, R. Boppana, and J. Spencer, "An asymptotic isoperimetric inequality," Geom. and Funct. Anal., vol. 8, pp. 411-436, 1998.
3. D. Bakry and M. Emery, "Diffusions hypercontractives," Séminaire de Probabilités XIX, Lecture Notes in Math. 1123, pp. 177-206, Springer-Verlag, 1985.
4. M. Barlow, T. Coulhon, and A. Grigor'yan, "Manifolds and graphs with slow heat kernel decay," Invent. Math., vol. 144, pp. 609-649, 2001.
5. S. Bochner, "Vector fields and Ricci Curvature," Bull. Amer. Math. Soc., vol. 52, pp. 776-797, 1946.
6. C. Borgs, Statistical Physics Expansion Methods in Combinatorics and Computer Science. CBMS-SIAM Lecture Notes, in preparation.
7. C. Borgs, J. Chayes, A. Frieze, J. H. Kim, P. Tetali, E. Vigoda, and V. Vu, "Torpid mixing of some MCMC algorithms in statistical physics," Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 218-229, 1999.
8. A.-S. Boudou, P. Caputo, P. D. Pra, and G. Posta, "Spectral gap estimates for interacting particle systems via a Bochner type identity," Journal of Functional Analysis, vol. 232, pp. 222-258, 2005.
9. S. Boyd, P. Diaconis, J. Sun, and L. Xiao, "Fastest mixing Markov chain on a path," The American Mathematical Monthly, vol. 113, no. 1, pp. 70-74, 2006.
10. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing Markov chain on a graph," SIAM Review, vol. 46, no. 4, pp. 667-689, 2004.
11. P. Caputo and P. Tetali, Walks, Transpositions, and Exclusion. Preprint (July 2004).
12. F. Chung, "Laplacians and the Cheeger inequality for directed graphs," Annals of Combinatorics, vol. 9, no. 1, pp. 1-19, 2005.
13. T. Coulhon, "Ultracontractivity and Nash-type inequalities," J. Funct. Anal., vol. 141, pp. 510-539, 1996.
14. T. Coulhon, A. Grigor'yan, and C. Pittet, "A geometric approach to ondiagonal heat kernel lower bound on groups," Ann. Inst. Fourier, vol. 51, pp. 1763-1827, 2001.
15. T. M. Cover and J. A. Thomas, Elements of Information Theory. John Wiley & Sons: New York, 1991.
16. M. Cryan, M. Dyer, and D. Randall, "Approximately Counting Integral Flows and Cell-Bounded Contingency Tables," Proc. of the 37th Annual ACM Symp. on Theory of Computing (STOC), pp. 413-422, 2005.
17. J.-D. Deuschel and D. W. Stroock, Large Deviations. Academic Press, 1989.
18. P. Diaconis and J. Fill, "Strong stationary times via a new form of duality," The Annals of Probability, vol. 18, no. 4, pp. 1483-1522, 1990.
19. P. Diaconis, S. Holmes, and R. Neal, "Analysis of a Non-reversible Markov Chain Sampler," Annals of Applied Probability, vol. 10, no. 3, pp. 726-752, 2000.
20. P. Diaconis and L. Saloff-Coste, "Comparison Theorems for Reversible Markov Chains," The Annals of Applied Probability, vol. 3, no. 3, pp. 696-730, 1993.
21. P. Diaconis and L. Saloff-Coste, "Logarithmic Sobolev inequalities for finite Markov chains," The Annals of Applied Probability, vol. 6, no. 3, pp. 695-750, 1996.
22. P. Diaconis and L. Saloff-Coste, "Nash Inequalities for Finite Markov Chains," Journal of Theoretical Probability, vol. 9, pp. 459-510, 1996.
23. P. Diaconis and M. Shahshahani, "Time to reach," SIAM J. Math. Anal., vol. 18, no. 1, pp. 208-218, 1987.
24. P. Diaconis and D. Stroock, "Geometric bounds for eigenvalues of Markov chains," The Annals of Applied Probability, vol. 1, pp. 36-61, 1991.
25. M. Dyer, L. Goldberg, M. Jerrum, and R. Martin, Markov chain comparison. 2005. Preprint (arXiv:mAth.PR/0410331).
26. J. Fill, "Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process," The Annals of Applied Probability, vol. 1, no. 1, pp. 62-87, 1991.
27. N. Fountoulakis and B. A. Reed, "The evolution of the conductance of a random graph," in preparation.
28. A. Frieze and E. Vigoda, "Survey of Markov Chains for Randomly Sampling Colorings," To appear in Festschrift for Dominic Welsh, (2006).
29. S. Goel, "Analysis of top to bottom-k shuffles," The Annals of Applied Probability, vol. 16, no. 1, pp. 30-55, 2006.
30. S. Goel, R. Montenegro, and P. Tetali, "Mixing time bounds and the spectral profile," Electronic Journal of Probability, vol. 11, pp. 1-26, 2006.
31. A. Grigor'yan, "Heat kernel upper bounds on a complete non-compact manifold," Revista Matemá,tica Iberoamericaná, vol. 10, pp. 395-452, 1994.
32. M. Jerrum, "Mathematical Foundations of the Markov Chain Monte Carlo Method," in Probabilistic Methods for Algorithmic Discrete Mathematics, (Habib et al., ed.), pp. 116-165, Springer-Verlag, Germany, 1998.
33. M. Jerrum, Counting, Sampling and Integrating: Algorithms & Complexity. Birkhäuser Verlag, Basel, 2003.
34. M. Jerrum and A. Sinclair, "Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved," Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 235-243, 1988.
35. M. Jerrum and A. Sinclair, "The Markov chain Monte Carlo method: An approach to approximate counting and integration," in Approximation Algorithms for NP-hard Problems, (D. Hochbaum, ed.), ch. 12, PWS Publishing, Boston, 1996.
36. M. Jerrum, A. Sinclair, and E. Vigoda, "A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries," Journal of the ACM, vol. 51, pp. 671-697, 2004.
37. M. Jerrum and J.-B. Son, "Spectral Gap and log-Sobolev constant for balanced matroids," Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 721-729, 2002.
38. M. Jerrum, L. Valiant, and V. Vazirani, "Random generation of combinatorial structures from a uniform distribution," Theoretical Computer Science, vol. 43, pp. 169-188, 1998.
39. W. Johnson and J. Lindenstrauss, "Extensions of Lipschitz maps into a Hilbert space," Contemp. Math., vol. 26, pp. 189-206, 1984.
40. R. Kannan, "Markov chains and polynomial time algorithms," Plenary Talk at Proc. of 35th Annual IEEE Symp. on the Foundations of Computer Science, pp. 656-671, 1994.
41. R. Kannan, L. Lovász, and R. Montenegro, "Blocking conductance and mixing in random walks," Combinatorics, Probability and Computing, to appear, 2006.
42. H. J. Landau and A. M. Odlyzko, "Bounds for eigenvalues of certain stochastic matrices," Linear Algebra Appl., vol. 38, pp. 5-15, 1981.
43. 2 spectrum for Markov chains and Markov processes: A generalization of Cheeger's inequality," Transactions of the American Mathematical Society, vol. 309, pp. 557-580, 1988.
44. T.-Y. Lee and H.-T. Yau, "Logarithmic Sobolev inequalities for some models of random walks," The Annals of Probability, vol. 26, no. 4, pp. 1855-1873, 1998.
45. A. Lichnérowicz, Géométrie des groupes de transformations. Dunod, Paris, 1958.
46. L. Lovász and R. Kannan, "Faster mixing via average conductance," Proc. of the 31st Annual ACM Symp. on Theory of Computing, pp. 282-287, 1999.
47. 4) volume algorithm," Proc. of the 44th IEEE Found. of Computer Science, Boston, To appear in Jour. Comp. Sys. Sci.(FOCS '03 special issue), 2003.
48. L. Lovász and S. Vempala, "Hit-and-run from a corner," Proc. of the 36th ACM Symp. on the Theory of Computing, Chicago, SIAM J. Computing (STOC '04 special issue), vol. 35, no. 4, pp. 985-1005, 2006.
49. L. Miclo, "Remarques sur l'hypercontractivité et l'évolution de l'entropie pour des chaînes de Markov finies," Séminaire de probabilités de Strasbourg, vol. 31, pp. 136-167, 1997.
50. M. Mihail, "Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders," Proc. of the 30th Annual Symposium on Foundations of Computer Science, pp. 526-531, 1989.
51. S. Miller and R. Venkatesan, "Spectral Analysis of Pollard Rho Collisions," Proc. of the 7th Algorithmic Number Theory Symposium (ANTS VII) in series Lecture Notes in Computer Science (LNCS), Springer, to appear, 2006.
52. A. Mitrophanov, "Stability and exponential convergence of continuous-time Markov chains," J. Appl. Probab., vol. 40, pp. 970-979, 2003.
53. A. Mitrophanov, "Sensitivity and convergence of uniformly ergodic Markov chains," J. Appl. Probab., vol. 42, pp. 1003-1014, 2005.
54. A. Mitrophanov, A. Lomsadze, and M. Borodovsky, "Sensitivity of hidden Markov models," J. Appl. Probab., vol. 42, pp. 632-642, 2005.
55. R. Montenegro, "Vertex and edge expansion properties for rapid mixing," Random Structures & Algorithms, vol. 26, no. 1-2, pp. 52-68, 2005.
56. R. Montenegro, Duality and evolving set bounds on mixing times. 2006. Preprint.
57. R. Montenegro, Eigenvalues of non-reversible Markov chains: Their connection to mixing times, reversible Markov chains, and Cheeger inequalities. 2006. Preprint (axXiv:mAth.PR/0604362).
58. R. Montenegro, On the mixing time of the simple random walk and max-degree walk on a directed graph. 2006. In preparation.
59. B. Morris, "The mixing time for simple exclusion," Annals of Applied Probability, to appear, 2006.
60. B. Morris, "The mixing time of the Thorp shuffle," SIAM Journal on Computing (SICOMP), to appear, 2006.
61. B. Morris and Y. Peres, "Evolving sets, mixing and heat kernel bounds," Probability Theory and Related Fields, vol. 133, no. 2, pp. 245-266, 2005.
62. A. Naor, M. Sammer, and P. Tetali, The Fastest Mixing Markov Process and the Subgaussian Constant. 2005. Preprint.
63. J. R. Norris, Markov Chains. Cambridge University Press, 1997.
64. Y. Peres and D. Revelle, "Mixing times for random walks on finite lamplighter groups," Electronic J. on Probab., vol. 9, pp. 825-845, 2004.
65. D. Randall, "Rapidly mixing Markov chains with applications in computer science and physics," Computing in Science & Engineering, vol. 8, no. 2, pp. 30-41, March 2006.
66. D. Randall and P. Tetali, "Analyzing Glauber dynamics using comparison of Markov chains," J. Math. Physics, vol. 41, pp. 1598-1615, 2000.
67. M. Reed and B. Simon, Methods of Modern Mathematical Physics II: Fourier Analysis, Self-Adjointness. Academic Press Inc, New York, 1975.
68. L. Saloff-Coste, "Total variation lower bounds for finite Markov chains: Wilson's lemma," in Random walks and geometry, pp. 515-532, Walter de Gruyter GmbH & Co. KG, Berlin, 2004.
69. E. Seneta, "Coefficients of ergodicity: Structure and applications," Adv. Appl. Prob., vol. 11, pp. 576-590, 1979.
70. A. Sinclair, "Improved bounds for mixing rates of Markov chains and multicommodity flow," Combinatorics, Probability and Computing, vol. 1, no. 4, pp. 351-370, 1992.
71. E. Stein, "Interpolation of Linear Operators," Trans. Amer. Math. Soc., vol. 83, pp. 482-492, 1956.
72. J. Sun, S. Boyd, L. Xiao, and P. Diaconis, "The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem," SIAM Review, to appear, 2006.
73. D. Wilson, "Mixing Time of the Rudvalis Shuffle," Electronic Communications in Probability, vol. 8, no. 77-85, 2003.
74. D. Wilson, "Mixing times of lozenge tiling and card shuffling Markov chains," The Annals of Applied Probability, vol. 14, no. 1, pp. 274-325, 2004.