Edge isoperimetry and rapid mixing on matroids and geometric Markov chains

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 704-711

  Montenegro, Ravi ^a   Son, Jung Bae ^b  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MATRIX ALGEBRA; PROBABILITY;

EDGE ISOPERIMETRY;

MARKOV PROCESSES;

EID: 0034825327     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380876     Document Type: Conference Paper

References (17)

1. Edge isoperimetric problems on graphs
2. Logarithmic Sobolev inequalities for finite Markov chains
3. Computing the volume of convex bodies: A case where randomness provably helps
4. A random polynomial-time algorithm for approximating the volume of convex bodies
5. Balanced matroids
6. On linear systems with integral valued solutions
7. Mathematical foundations of the Markov chain Monte Carlo method
8. On the conductance of order Markov chains
9. Isoperimetric problems for convex bodies and a localization lemma
10. Faster mixing via average conductance
11. Improved bounds for mixing rates of Markov chains and multicommodity flow
12. Approximate counting, uniform generation, and rapidly mixing Markov chains