Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

Combinatorics, Probability and Computing

Volumn 1, Issue 4, 1992, Pages 351-370

  Sinclair, Alistair ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84971804758     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548300000390     Document Type: Article

References (24)

1. Some inequalities for reversible Markov chains, D. Aldous, Journal of the London Mathematical Society, 1982, 25-2, 564-576
2. On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing, D. Aldous, Probability in the Engineering and Informational Sciences, 1987, 1, 33-46
3. Eigenvalues and expanders, N. Alon, Combinatorica, 1986, 6, 83-96
4. λ1isoperimetric inequalities for graphs and superconcentrators, N. Alon, V.D. Milman, Journal of Combinatorial Theory, 1985, 38, 73-88, Series B and
5. A.Z. Broder, 1986, 50-58, How hard is it to marry at random? (On the approximation of the permanent). Proceedings of the 18th ACM Symposium on Theory of Computing Erratum in Proceedings of the 20th ACM Symposium on Theory of Computing (1988) 551.
6. P. Dagum, M. Luby, M. Mihail, U.V. Vazirani, 1988, 412-421, Polytopes, permanents and graphs with large factors. Proceedings of the 29th IEEE Symposium on Foundations of Computer Science and
7. P. Diaconis, Group representations in probability and statistics, 1988, 11, Lecture Notes Monograph Series Vol. Institute of Mathematical Statistics Hayward, California
8. Geometric bounds for eigenvalues of Markov chains, P. Diaconis, D. Stroock, Annals of Applied Probability, 1991, 1, 36-61, and
9. M. Dyer, A. Frieze, R. Kannan, 1989, 375-381, A random polynomial time algorithm for approximating the volume of convex bodies. Proceedings of the 21st ACM Symposium on Theory of Computing and
10. J. Fill, Unpublished manuscript.
11. Approximating the permanent, M.R. Jerrum, A.J. Sinclair, SIAM Journal on Computing, 1989, 18, 1149-1178, and
12. Fast Uniform Generation of Regular Graphs, M.R. Jerrum, A.J. Sinclair, Theoretical Computer Science, 1990, 73, 91-100, and
13. M.R. Jerrum, A.J. Sinclair, SIAM Journal on Computing, 1993, 443, 462-475, Polynomial-time approximation algorithms for the Ising model Technical Report CSR-1-90, Dept. of Computer Science, University of Edinburgh. (To appear in August 1993; Extended Abstract in Proceedings of the 17th International Colloquium on Automata, Languages and Programming (1990). Springer LNCS and
14. A. Karzanov, L. Khachiyan, 1990, On the conductance of order Markov chains Technical Report DCS 268, Rutgers University. and
15. J. Keilson, Markov chain models - rarity and exponentiality, 1979, Springer-Verlag New York
16. Bounds on the L 2spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality, G.F. Lawler, A.D. Sokal, Transactions of the American Mathematical Society, 1988, 309, 557-580, and
17. T. Leighton, S. Rao, 1988, 422-431, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. Proceedings of the 29th IEEE Symposium on Foundations of Computer Science and
18. Sparsest cuts and bottlenecks in graphs, D.W. Matula, F. Shahrokhi, Discrete Applied Mathematics, 1990, 27, 113-123, and
19. M. Mihail, 1989, 526-531, Conductance and convergence of Markov chains: a combinatorial treatment of expanders. Proceedings of the 30th IEEE Symposium on Foundations of Computer Science
20. M. Mihail, P. Winkler, 1992, 138-145, On the number of Eulerian orientations of a graph. Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms and
21. Isoperimetric numbers of graphs, B. Mohar, Journal of Combinatorial Theory, 1989, 47, 274-291, Series B
22. The maximum concurrent flow problem, F. Shahrokhi, D.W. Matula, Journal of the ACM, 1990, 37, 318-334, and
23. A.J. Sinclair, 1988, Algorithms for random generation and counting: a Markov chain approach, PhD Thesis University of Edinburgh (Revised version appeared as a monograph in the series Progress in Theoretical Computer Science Birkhäuser, Boston, 1992.)
24. Approximate counting, uniform generation and rapidly mixing Markov chains, A.J. Sinclair, M.R. Jerrum, Information and Computation, 1989, 82, 93-133, and