Fastest mixing Markov chain on a graph

SIAM Review

Volumn 46, Issue 4, 2004, Pages 667-689

  Boyd, Stephen ^a   Diaconis, Persi ^b   Xiao, Lin ^a  

^a Stanford University ^*  (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Fast mixing; Markov chains; Second largest eigenvalue modulus; Semidefinite programming; Subgradient method

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; GRADIENT METHODS; GRAPH THEORY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; NUMERICAL METHODS; OPTIMIZATION; POLYNOMIALS; PROBABILITY DISTRIBUTIONS;

FAST MIXING MARKOV CHAINS; SECOND LARGEST EIGENVALUE MODULUS; SEMIDEFINITE PROGRAMMING; SUBGRADIENT METHOD;

MARKOV PROCESSES;

EID: 11344275321     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144503423264     Document Type: Article

References (57)

1. D. Aldous, Random walk on finite groups and rapidly mixing Markov chains, in Séminaire de Probabilités XVII, Lecture Notes in Math. 986, Springer-Verlag, New York, 1983, pp. 243-297.
2. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, Siam J. Optim., 5 (1995), pp. 13-51.
3. F. Alizadeh, J.-P. A. Haeberly, M. V. Nayakkankuppam, M. L. Overton, and S. Schmieta, SDPpack: A Package for Semidefinite-Quadratic-Linear Programming, 1997.
4. E. Behrends, Introduction to Markov Chains, with Special Emphasis on Rapid Mixing, Adv. Lectures Math., Vieweg, Weisbaden, Germany, 2000.
5. A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, MPS/SIAM Ser. Optim. 2, SIAM, Philadelphia, 2001.
6. S. J. Benson, Y. Ye, and X. Zhang, Solving large-scale sparse semidefinite programs for combinatorial optimization, Siam J. Optim., 10 (2000), pp. 443-461.
7. D. P. Bertsekas, Nonlinear Programming, 2nd ed., Athena Scientific, Nashua, NH, 1999.
8. L. Billera and P. Diaconis, A geometric interpretation of the Metropolis-Hastings algorithm, Statist. Sci., 16 (2001), pp. 335-339.
9. J. M. Borwein and A. S. Lewis, Convex Analysis and Nonlinear Optimization. Theory and Examples, CMS Books Math./Ouvrages Math. SMC, Springer-Verlag, New York, 2000.
10. S. Boyd, P. Diaconis, P. A. Parrilo, and L. Xiao, Symmetry analysis of reversible Markov chains, Internet Math., to appear; available online from http://www.stanford.edu/~boyd/symmetry.html.
11. S. Boyd, P. Diaconis, J. Sun, and L. Xiao, Fastest mixing Markov chain on a path, Amer. Math. Monthly, to appear; available online from http://www.stanford.edu/~boyd/fmmc_path.html.
12. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004; available online from http:// www.stanford.edu/~boyd/cvxbook.html.
13. P. Brémaud, Markov Chains, Gibbs Fields, Monte Carlo Simulation and Queues, Texts Appl. Math., Springer-Verlag, Berlin, Heidelberg, 1999.
14. F. H. Clarke, Optimization and Nonsmooth Analysis, SIAM, Philadelphia, 1990.
15. J. Cullum, W. E. Donath, and P. Wolfe, The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices, Math. Programming Stud., 3 (1975), pp. 35-55.
16. P. Diaconis, Group Representations in Probability and Statistics, Institute of Mathematical Statistics, Hayward, CA, 1988.
17. P. Diaconis and A. Gangolli, Rectangular arrays with fixed margins in Discrete Probability and Algorithms, D. Aldous et al., eds., Springer-Verlag, New York, 1995, pp. 15-42.
18. P. Diaconis and L. Saloff-Coste, Logarithmic Sobolev inequalities for finite Markov chains, Ann. Appl. Probab., 6 (1996), pp. 695-750.
19. P. Diaconis and L. Saloff-Coste, What do we know about the Metropolis algorithms?, J. Comput. System Sci., 57 (1998), pp. 20-36.
20. P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab., 1 (1991), pp. 36-61.
21. P. Diaconis and B. Sturmfels, Algebraic algorithms for sampling from conditional distributions, Ann. Statist., 26 (1998), pp. 363-397.
22. R. Diekmann, S. Muthukrishnan, and M. V. Nayakkankuppam, Engineering diffusive load balancing algorithms using experiments, in Solving Irregularly Structured Problems in Parallel, Lecture Notes in Comput. Sci. 1253, Springer-Verlag, Berlin, 1997, pp. 111-122.
23. L. Gross, Logarithmic Sobolev inequalities and contractivity properties of semigroups, in Dirichlet Forms (Varenna, 1992), Lecture Notes in Math. 1563, Springer-Verlag, Berlin, 1993, pp. 54-88.
24. W. Hastings, Monte Carlo sampling methods using Markov chains and their applications, Biometrika, 57 (1970), pp. 97-109.
25. C. Helmberg and F. Rendl, A spectral bundle method for semidefinite programming, Siam J. Optim., 10 (2000), pp. 673-696.
26. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, 1993.
27. R. A. Horn and C. A. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
28. M. Jerrum, Private communication, 2003.
29. M. Jerrum and A. Sinclair, Approximating the permanent, Siam J. Comput., 18 (1989), pp. 1149-1178.
30. N. Kahale, A semidefinite bound for mixing tares of Markov chains, in Proceedings of the 5th Integer Programming and Combinatorial Optimization Conference, Lecture Notes in Comput. Sci. 1084, Springer-Verlag, Berlin, 1996, pp. 190-203.
31. R. Kannan, Markov chains and polynomial time algorithms, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 656-671.
32. A. S. Lewis, Convex analysis on the Hermitian matrices, Siam J. Optim., 6 (1996), pp. 164-177.
33. A. S. Lewis, Nonsmooth analysis of eigenvalues, Math. Programming, 84 (1999), pp. 1-24.
34. A. S. Lewis and M. L. Overton, Eigenvalue optimization, Acta Numer., 5 (1996), pp. 149-190.
35. J. Liu, Monte Carlo Strategies in Scientific Computing, Springer Ser. Statist., Springer-Verlag, New York, 2001.
36. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, Ande. Teller, Equations of state calculations by fast computing machines, J. Chem. Phys., 21 (1953), pp. 1087-1092.
37. S. A. Miller and R. S. Smith, A bundle method for efficiently solving large structured linear matrix inequalities, in Proceedings of the American Control Conference, Chicago, IL, 2000, pp. 1405-1409.
38. Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, Siam Stud. Appl. Math., Siam, Philadelphia, 1994.
39. M. L. Overton, Large-scale optimization of eigenvalues, Siam J. Optim., 2 (1992), pp. 88-120.
40. M. L. Overton and R. S. Womersley, Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices, Math. Programming, 62 (1993), pp. 321-357.
41. B. N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
42. P. A. Parrilo, L. Xiao, S. Boyd, and P. Diaconis, Fastest Mixing Markov Chain on Graphs with Symmetries, manuscript in preparation, 2004.
43. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
44. J. S. Rosenthal, Convergence rates for Markov chains, Siam Rev., 37 (1995), pp. 387-405.
45. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, UK, 1992.
46. Semidefinite programming page, http://www-user.tu-chemnitz.de/ ~helmberg/semidef.html. Website maintained by C. Helmberg.
47. N. Z. Shor, Minimization Methods for Non-differentiable Functions, Springer Ser. Comput. Math., Springer-Verlag, Berlin, 1985.
48. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput., 1 (1992), pp. 351-370.
49. A. Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach, Birkhäuser Boston, Boston, 1993.
50. D. Stroock, Logarithmic Sobolev inequalities for Gibbs states, in Dirichlet Forms (Varenna, 1992), Lecture Notes in Math. 1563, Springer-Verlag, Berlin, 1993, pp. 194-228.
51. J. F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw., 11-12 (1999), pp. 625-653; special issue on Interior Point Methods (CD supplement with software).
52. M. Todd, Semidefinite optimization, Acta Numer., 10 (2001), pp. 515-560.
53. K. C. Toh, M. J. Todd, and R. H. Tutuncu, SDPT3: A Matlab software package for semidefinite programming, version 2.1, Optim. Methods Softw., 11 (1999), pp. 545-581.
54. L. Vandenberghe and S. Boyd, Semidefinite programming, Siam Rev., 38 (1996), pp. 49-95.
55. H. Wolkowicz, R. Saigal, and L. Vandenberghe, eds., Handbook of Semidefinite Programming, Theory, Algorithms, and Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.
56. S.-P. Wu and S. Boyd, SDPSOL: A Parser/Solver for Semidefinite Programming and Determinant Maximization Problems with Matrix Structure. User's Guide, Version Beta, Stanford University, Stanford, CA, 1996.
57. Y. Ye, Interior Point Algorithms: Theory and Analysis, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, 1997.