Fastest mixing Markov chain on graphs with symmetries

SIAM Journal on Optimization

Volumn 20, Issue 2, 2009, Pages 792-819

  Boyd, Stephen ^a   Diaconis, Persi ^b   Parrilo, Pablo ^c   Xiao, Lin ^d  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

^c USA   (United States)

^d MICROSOFT RESEARCH   (United States)

Author keywords

Eigenvalue optimization; Fast mixing; Graph automorphism; Group representation; Markov chains; Semidefinite programming

Indexed keywords

DIAGONALIZATIONS; EIGENVALUE OPTIMIZATION; GENERAL APPROACH; GRAPH AUTOMORPHISMS; LARGEST EIGENVALUES; MARKOV CHAIN; NUMERICAL SOLUTION; ON ORBIT; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS; TRANSITION PROBABILITIES; TRANSITION PROBABILITY MATRIX;

EIGENVALUES AND EIGENFUNCTIONS; FLUORINE CONTAINING POLYMERS; MARKOV PROCESSES; MATHEMATICAL PROGRAMMING; MIXING; PROBABILITY;

GRAPH THEORY;

EID: 70450197165     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/070689413     Document Type: Article

References (59)

1. N. BIGGS, Algebraic Graph Theory, Cambridge University Press, Cambridge, UK, 1974.
2. S. BOYD AND L. VANDENBERGHE, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004.
3. S. BOYD, P. DIACONIS, AND L. XIAO, Fastest mixing Markov chain on a graph, SIAM Rev., 46 (2004), pp. 667-689.
4. S. BOYD, P. DIACONIS, P. A. PARRILO, AND L. XIAO, Symmetry analysis of reversible Markov chains, Internet Math., 2 (2005), pp. 31-71.
5. S. BOYD, P. DIACONIS, P. A. PARRILO, AND L. XIAO, Fastest Mixing Markov Chain on Graphs with Symmetries, Tech. Report MSR-TR-2007-52, Microsoft Research, Redmond, VA, 2007.
6. S. BOYD, P. DIACONIS, J. SUN, AND L. XIAO, Fastest mixing Markov chain on a path, Amer. Math. Monthly, 113 (2006), pp. 70-74.
7. S. BOYD, A. GHOSH, B. PRABHAKAR, AND D. SHAH, Randomized gossip algorithms, IEEE Trans. Inform. Theory, 52 (2006), pp. 2508-2530.
8. P. BRÉMAUD, Markov Chains, Gibbs Fields, Monte Carlo Simulation and Queues, Texts Appl. Math. 31, Springer-Verlag, Berlin, Heidelberg, 1999.
9. A. E. BROUWER, A. M. COHEN, AND A. NEUMAIER, Distance-Regular Graphs, Springer-Verlag, Berlin, 1989.
10. S. BURER AND R. D. C. MONTEIRO, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Math. Program., 95 (2003), pp. 329-357.
11. F. CHEN, L. LOVÁSZ, AND I. PAK, Lifting Markov chains to speed up mixing, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 275-281.
12. F. R. K. CHUNG, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 92, AMS, Providence, RI, 1997.
13. R. COGILL, S. LALL, AND P. A. PARRILO, Structured semidefinite programs for the control of symmetric systems, Automatica, 44 (2008), pp. 1411-1417.
14. E. DE KLERK, D. V. PASECHNIK, AND A. SCHRIJVER, Reduction of symmetric semidefinite programs using the regular *-representation, Math. Program., 109 (2007), pp. 613-624.
15. P. DIACONIS, Group Representations in Probability and Statistics, IMS, Hayward, CA, 1988.
16. P. DIACONIS AND L. SALOFF-COSTE, Comparison theorems for reversible Markov chains, Ann. Appl. Probab., 3 (1993), pp. 696-730.
17. P. DIACONIS AND L. SALOFF-COSTE, Logarithmic Sobolev inequalities for finite Markov chains, Ann. Appl. Probab., 6 (1996), pp. 695-750.
18. P. DIACONIS AND L. SALOFF-COSTE, Separation cut-offs for birth and death chains, Ann. Appl. Probab., 16 (2006), pp. 2098-2122.
19. P. DIACONIS AND D. STROOCK, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab., 1 (1991), pp. 36-61.
20. I. DUKANOVIC AND F. RENDL, Semidefinite programming relaxations for graph coloring and maximal clique problems, Math. Program., 109 (2007), pp. 345-365.
21. P. ERDÖS AND A. RÉNYI, Asymmetric graphs, Acta Math. Acad. Sci. Hungar., 14 (1963), pp. 295-315.
22. A. FÄSSLER AND E. STIEFEL, Group Theoretical Methods and Their Applications, Birkhäuser, Boston, 1992.
23. K. K. GADE AND M. L. OVERTON, Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler, Adv. in Appl. Math., 38 (2007), pp. 382-403.
24. THE GAP GROUP, GAP: Groups, Algorithms, Programming. A System for Computational Discrete Algebra, version 4.4.6, 2005. http://www.gap-system.org.
25. K. GATERMANN, Computer Algebra Methods for Equivariant Dynamical Systems, Lecture Notes in Math. 1728, Springer-Verlag, Berlin, 2000.
26. K. GATERMANN AND P. A. PARRILO, Symmetry groups, semidefinite programs, and sums of squares, J. Pure Appl. Algebra, 192 (2004), pp. 95-128.
27. A. GEORGE AND J. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
28. C. GODSIL AND G. ROYLE, Algebraic Graph Theory, Grad. Texts in Math. 207, Springer-Verlag, New York, 2001.
29. M. X. GOEMANS, Semidefinite programming in combinatorial optimization, Math. Programming, 79 (1997), pp. 143-161.
30. G. H. GOLUB AND C. F. V. LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
31. M. GOLUBITSKY, I. STEWART, AND D. G. SCHAEFFER, Singularities and Groups in Bifurcation Theory II, Appl. Math. Sci. 69, Springer-Verlag, New York, 1988.
32. A. GRAHAM, Kronecker Products and Matrix Calculus with Applications, Ellis Horwoods Ltd., Chichester, UK, 1981.
33. L. GROSS, Logarithmic Sobolev inequalities and contractivity properties of semigroups, in Dirichlet Forms, Lecture Notes in Math. 1563, Springer-Verlag, Berlin, 1993, pp. 54-88.
34. B. HAN, M. L. OVERTON, AND T. P.-Y. YU, Design of Hermite subdivision schemes aided by spectral radius optimization, SIAM J. Sci. Comput, 25 (2003), pp. 643-656.
35. C. HELMBERG AND F. RENDL, A spectral bundle method for semidefinite programming, SIAM J. Optim., 10 (2000), pp. 673-696.
36. Y. KANNO, M. OHSAKI, K. MUROTA, AND N. KATOH, Group symmetry in interior-point methods for semidefinite programming, Optim. Eng., 2 (2001), pp. 293-320.
37. M. LAURENT, Strengthened semidefinite programming bounds for codes, Math. Program., 109 (2007), pp. 239-261.
38. Z. LU, A. NEMIROVSKI, AND R. D. C. MONTEIRO, Large-scale semidefinite programming via saddle point mirror-prox algorithm, Math. Program., 109 (2007), pp. 211-237.
39. F. MARGOT, Exploiting orbits in symmetric ILP, Math. Program., 98 (2003), pp. 3-21.
40. J. E. MARSDEN AND T. RATIU, Introduction to Mechanics and Symmetry, 2nd ed., Texts Appl. Math. 17, Springer-Verlag, New York, 1999.
41. B. MCKAY, nauty User's guide (Version 2.2), Australian National University, 2003. Available online from http://cs.anu.edu.au/~bdm/nauty/.
42. R. MERRIS, Laplacian matrices of graphs: A survey, Linear Algebra Appl., 197 (1994), pp. 143-176.
43. B. MOHAR, Some applications of Laplace eigenvalues of graphs, in Graph Symmetry: Algebraic Methods and Applications, G. Hahn and G. Sabidussi, eds., NATO Sci. Ser. C Math. Phys. Sci. 1497, Kluwer Academic, Dordrecht, The Netherlands, 1997, pp. 225-275.
44. B. MOHAR AND S. POLJAK, Eigenvalues in combinatorial optimization, in Combinatorial and Graph-Theoretical Problems in Linear Algebra, R. A. Brualdi, S. Friedland, and V. Klee, eds., IMA Vol. Math. Appl. 50, Springer-Verlag, New York, 1993, pp. 107-151.
45. A. NEMIROVSKI, Prox-method with rate of convergence O (1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems, SIAM J. Optim., 15 (2004), pp. 229-251.
46. Y. NESTEROV, Smooth minimization of non-smooth functions, Math. Program., 103 (2005), pp. 127-152.
47. M. L. OVERTON, Large-scale optimization of eigenvalues, SIAM J. Optim., 2 (1992), pp. 88-120.
48. P. A. PARRILO, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, Ph. D. thesis, California Institute of Technology, Pasadena, CA, 2000.
49. P. A. PARRILO, Semidefinite programming relaxations for semialgebraic problems, Math. Program., 96 (2003), pp. 293-320.
50. P. A. PARRILO AND B. STURMFELS, Minimizing polynomial functions, in Algorithmic and Quantitative Real Algebraic Geometry, S. Basu and L. Gonzalez-Vega, eds., DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 60, AMS, Providence, RI, 2003, pp. 83-99.
51. S. ROCH, Bounding fastest mixing, Electron. Comm. Probab., 10 (2005), pp. 282-296.
52. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, UK, 1992.
53. J. SALTZMAN, A Generalization of Spectral Analysis for Discrete Data Using Markov Chains, Ph. D. thesis, Department of Statistics, Stanford University, Stanford, CA, 2006.
54. J.-P. SERRE, Linear Representations of Finite Groups, Springer-Verlag, New York, 1977.
55. D. STROOCK, Logarithmic Sobolev inequalities for Gibbs states, in Dirichlet Forms, Lecture Notes in Math. 1563, Springer-Verlag, Berlin, 1993, pp. 194-228.
56. R. SUBRAMANIAN AND I. D. SCHERSON, An analysis of diffusive load-balancing, in Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 220-225.
57. P. WORFOLK, Zeros of equivariant vector fields: Algorithms for an invariant approach, J. Symbolic Comput., 17 (1994), pp. 487-511.
58. L. XIAO AND S. BOYD, Fast linear iterations for distributed averaging, Systems Control Lett., 53 (2004), pp. 65-78.
59. L. XIAO, S. BOYD, AND S.-J. KIM, Distributed average consensus with least-mean-square deviation, J. Parallel Distrib. Comput., 67 (2007), pp. 33-46.