Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?

Annals of Applied Probability

Volumn 9, Issue 1, 1999, Pages 1-13

  Fulman, Jason ^a   Wilmer, Elizabeth L ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Cheeger inequalitites; Eigenvalues; Groups; Markov chains; Poincar inequalities; Random walk; Trees

Indexed keywords

EID: 0033449690     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1029962594     Document Type: Article

References (23)

1. ALDOUS, D. (1987). On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing. Probab. Engrg. Inform. Sci. 1 33-46.
2. ALON, N. (1986). Eigenvalues and expanders. Combinatorica 6 83-96.
3. 1, isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Ser. B 38 73-88.
4. CHEEGER, J. (1970). A lower bound for the smallest eigenvalue of the Laplacian. In Problems in Analysis (Papers dedicated to Salomon Bochner, 1969) 195-199. Princeton Univ. Press.
5. CHUNG, F. (1997). Spectral Graph Theory. Amer. Math. Soc., Providence, RI.
6. DIACONIS, P. (1988). Group Representations in Probability and Statistics. IMS, Hayward, CA.
7. DIACONIS, P. and SALOFF-COSTE, L. (1993a). Comparison techniques for random walk on finite groups. Ann. Probab. 21 2131-2156.
8. DIACONIS, P. and SALOFF-COSTE, L. (1993b). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696-730.
9. DIACONIS, P. and SALOFF-COSTE, L. (1994). Moderate growth and random walk on finite groups. Geom. Funct. Anal. 4 1-36.
10. DIACONIS, P. and SALOFF-COSTE, L. (1996a). Logarithmic Sobolev inequalities for finite Markov chains. Ann. Appl. Probab. 6 695-750.
11. DIACONIS, P. and SALOFF-COSTE, L. (1996b). Nash inequalities for finite Markov chains. J. Theoret. Probab. 9 459-510.
12. DIACONIS, P. and SHAHSHAHANI, M. (1981). Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Gebiete. 57 159-179.
13. DIACONIS, P. and STROOCK, D. (1991). Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 36-61.
14. HUMPHREYS, J. (1990). Reflection Groups and Coxeter Groups. Cambridge Univ. Press.
15. JERRUM, M. and SINCLAIR, A. (1989). Approximating the permanent. SIAM J. Comput. 18 1149-1178.
16. KAHALE, N. (1997). A semidefinite bound for mixing rates of Markov chains. Random Structures Algorithms. To appear. (Preliminary version appears in Lecture Notes in Comput. Sci. 1084 190-203. Springer, Berlin.)
17. KAHALE, N. (1997). A semidefinite bound for mixing rates of Markov chains. Random Structures Algorithms. To appear. (Preliminary version appears in Lecture Notes in Comput. Sci. 1084 190-203. Springer, Berlin.)
18. KANNAN, R. (1994). Markov chains and polynomial time algorithms. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science 656-671. IEEE, New York.
19. LUBOTZKY, A., PHILLIPS, R. and SARNAK, P. (1988). Ramanujan graphs. Combinatorica 8 261-278.
20. MOON, J. W. (1968). On the maximum degree in a random tree. Michigan Math. J. 15 429-432.
21. POLYÁ, G. and SZEGÖ, S. (1951). Isoperimetric Inequalities in Mathematical Physics. Princeton Univ. Press.
22. SINCLAIR, A. (1992). Improved bounds for mixing rates of Markov chains and multicommodity flow. Combin. Probab. Comput. 1 351-370.
23. SZEKERES, G. (1983). Distribution of labeled trees by diameter. Combinatorial Mathematics X. Lecture Notes in Math. 1036 392-397. Springer, Berlin.