Skip to main content
×
×
Home

Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

  • Alistair Sinclair (a1)
Abstract

The paper is concerned with tools for the quantitative analysis of finite Markov chains whose states are combinatorial structures. Chains of this kind have algorithmic applications in many areas, including random sampling, approximate counting, statistical physics and combinatorial optimisation. The efficiency of the resulting algorithms depends crucially on the mixing rate of the chain, i.e., the time taken for it to reach its stationary or equilibrium distribution.

The paper presents a new upper bound on the mixing rate, based on the solution to a multicommodity flow problem in the Markov chain viewed as a graph. The bound gives sharper estimates for the mixing rate of several important complex Markov chains. As a result, improved bounds are obtained for the runtimes of randomised approximation algorithms for various problems, including computing the permanent of a 0–1 matrix, counting matchings in graphs, and computing the partition function of a ferromagnetic Ising system. Moreover, solutions to the multicommodity flow problem are shown to capture the mixing rate quite closely: thus, under fairly general conditions, a Markov chain is rapidly mixing if and only if it supports a flow of low cost.

Copyright
References
Hide All
[1]Aldous, D. (1982) Some inequalities for reversible Markov chains. Journal of the London Mathematical Society (2) 25 564576.
[2]Aldous, D. (1987) On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing. Probability in the Engineering and Informational Sciences 1 3346.
[3]Alon, N. (1986) Eigenvalues and expanders. Combinatorica 6 8396.
[4]Alon, N. and Milman, V. D. (1985) λ1, isoperimetric inequalities for graphs and superconcentrators. Journal of Combinatorial Theory Series B 38 7388.
[5]Broder, A. Z. (1986) How hard is it to marry at random? (On the approximation of the permanent). Proceedings of the 18th ACM Symposium on Theory of Computing, 5058. Erratum in Proceedings of the 20th ACM Symposium on Theory of Computing (1988) 551.
[6]Dagum, P., Luby, M., Mihail, M. and Vazirani, U. V. (1988) Polytopes, permanents and graphs with large factors. Proceedings of the 29th IEEE Symposium on Foundations of Computer Science 412421.
[7]Diaconis, P. (1988) Group representations in probability and statistics, Lecture Notes Monograph Series Vol. 11, Institute of Mathematical Statistics, Hayward, California.
[8]Diaconis, P., and Stroock, D. (1991) Geometric bounds for eigenvalues of Markov chains. Annals of Applied Probability 1 3661.
[9]Dyer, M., Frieze, A. and Kannan, R. (1989) A random polynomial time algorithm for approximating the volume of convex bodies. Proceedings of the 21st ACM Symposium on Theory of Computing 375381.
[10]Fill, J. Unpublished manuscript.
[11]Jerrum, M. R. and Sinclair, A. J. (1989) Approximating the permanent. SIAM Journal on Computing 18 11491178.
[12]Jerrum, M. R. and Sinclair, A. J. (1990) Fast Uniform Generation of Regular Graphs. Theoretical Computer Science 73 91100.
[13]Jerrum, M. R. and Sinclair, A. J. (1993) Polynomial-time approximation algorithms for the Ising model, Technical Report CSR-1–90, Dept. of Computer Science, University of Edinburgh. (To appear in SIAM Journal on Computing, August 1993; Extended Abstract in Proceedings of the 17th International Colloquium on Automata, Languages and Programming (1990). Springer LNCS 443 462475.)
[14]Karzanov, A. and Khachiyan, L. (1990) On the conductance of order Markov chains, Technical Report DCS 268, Rutgers University.
[15]Keilson, J. (1979) Markov chain models – rarity and exponentiality, Springer-Verlag, New York.
[16]Lawler, G. F. and Sokal, A. D. (1988) Bounds on the L 2 spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality. Transactions of the American Mathematical Society 309 557580.
[17]Leighton, T. and Rao, S. (1988) 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 422431.
[18]Matula, D. W. and Shahrokhi, F. (1990) Sparsest cuts and bottlenecks in graphs. Discrete Applied Mathematics 27 113123.
[19]Mihail, M. (1989) Conductance and convergence of Markov chains: a combinatorial treatment of expanders. Proceedings of the 30th IEEE Symposium on Foundations of Computer Science 526531.
[20]Mihail, M. and Winkler, P. (1992) On the number of Eulerian orientations of a graph. Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms 138145.
[21]Mohar, B. (1989) Isoperimetric numbers of graphs. Journal of Combinatorial Theory, Series B 47 274291.
[22]Shahrokhi, F. and Matula, D. W. (1990) The maximum concurrent flow problem. Journal of the ACM 37 318334.
[23]Sinclair, A. J. (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]Sinclair, A. J. and Jerrum, M. R. (1989) Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation 82 93133.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 78 *
Loading metrics...

Abstract views

Total abstract views: 497 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 20th June 2018. This data will be updated every 24 hours.