Vertex and edge expansion properties for rapid mixing

Random Structures and Algorithms

Volumn 26, Issue 1-2, 2005, Pages 52-68

  Montenegro, Ravi ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Conductance; Isoperimetry; Markov chains; Mixing time; Spectral gap

Indexed keywords

EID: 22144462788     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20045     Document Type: Conference Paper

References (15)

1. D. Aldous and J. Fill, Reversible markov chains and random walks on graphs (book to appear). URL for draft, http://www.stat.Berkeley.edu/users/ aldous.
2. N. Alon, Eigenvalues and expanders. Combinatorica 6(2) (1986), 83-96.
3. S. Bobkov and F. Götze, Discrete isoperimetric and poincaré-type inequalities, Probab Theory Related Fields, 114(2) (1999), 245-277.
4. S. G. Bobkov, An isoperimetric inequality on the discrete cube, and an elemetary proof of the isoperimetric inequality in Gauss space, Ann Probab, 25(1) (1997), 206-214.
5. C. Houndré and P. Tetali, Isoperimetric invariants for product markov chains and graph products. Combinatorica 24(3) (2004), 359-380.
6. M. Jerrum and A. Sinclair, Conductance and the rapid mixing property for markov chains: the approximation of the permanent resolved, Proc 20th Annu ACM Symp Theory of Computing, 1988, pp. 235-243.
7. R. Kannan, L. Lovász, and R. Montenegro, Blocking conductance and mixing in random walks, Preprint, 2003.
8. L. Lovász and R. Kannan, Faster mixing via average conductance, Proc 31st Annu ACM Symp Theory of Computing, 1999, pp. 282-287.
9. M. Mihail, Conductance and convergence of markov chains - a combinatorial treatment of expanders, 30th Annu Symp Foundations of Computer Science, 1989, pp. 526-531.
10. R. Montenegro, Faster mixing by isoperimetric inequalities. Ph.D. thesis, Department of Mathematics, Yale University, New Haven, CT, 2002.
11. R. Montenegro, Faster mixing for conductance methods, Preprint, 2003.
12. B. Morris and Y. Peres, Evolving sets and mixing, Proc 35th Annu ACM Symp Theory of Computing, 2003, pp. 279-286.
13. S. Murali, Curvature, isoperimetry, and discrete spin systems, Ph.D. thesis, Department of Mathematics, Georgia Institute of Technology, Atlanta, 2001.
14. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin Probab Comput 1(4) (1992), 351-370.
15. M. Talagrand, Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem, Geom Funct Anal 3(3) (1993), 295-314.