Probability Theory and Related Fields

, Volume 137, Issue 3–4, pp 475–486 | Cite as

Faster Mixing and Small Bottlenecks

Original Article

Abstract

We prove a new bound on the mixing time of a Markov chain by considering the conductance of its connected subsets.

Keywords

Markov Chain Convex Body Random Graph Degree Sequence Giant Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aldous D.J. (1982). Some inequalities for reversible Markov chains. J Lond Math Soc 25:564–576MathSciNetMATHGoogle Scholar
  2. 2.
    Aldous D.J., Lovász L., Winkler P. (1997). Mixing times for uniformly ergodic Markov chains. Stochastic Processes Appl 71:165–185CrossRefMATHGoogle Scholar
  3. 3.
    Benjamini I., Mossel E. (2003). On the mixing time of a simple random walk on the super critical percolation cluster. Prob Theory Related Fields 125:408–420CrossRefMathSciNetMATHGoogle Scholar
  4. 4.
    Bollobás B., Janson S., Grimmett G.R. (1996). The random-cluster model on the complete graph. Prob Theory Related Fields 104:283–317CrossRefMATHGoogle Scholar
  5. 5.
    Dyer, M., Frieze, A.M., Kannan, R.: A random polynomial time algorithm for estimating volumes of convex bodie. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 375–381 (1989)Google Scholar
  6. 6.
    Dyer M., Greenhill C., Molloy M. (2002). Very rapid mixing of the Glauber dynamics for proper colourings on bounded-degree graphs. Random Struct Algorithms 20:98–114CrossRefMathSciNetMATHGoogle Scholar
  7. 7.
    Gantzidis, C., Mihail, M., Saberi, A.: Conductance and congestion in power law graphs. In: Proceedings of the 2003 ACM SIGMETRICS international conference on measurement and modeling of computer systems, pp. 148–159 (2003)Google Scholar
  8. 8.
    Jerrum, M., Sinclair, A.: Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved. In: Proceedings of the 20th annual ACM symposium on theory of computing, pp. 235–244 (1988)Google Scholar
  9. 9.
    Jerrum M., Sinclair A. (1993). Polynomial-time approximation algorithms for the Ising model. SIAM J Comput 22:1087–1116CrossRefMathSciNetMATHGoogle Scholar
  10. 10.
    Kannan, R., Lovász, L., Montenegro, R.: Blocking conductance and mixing in random walks. Combinatorics Prob Comput (to appear)Google Scholar
  11. 11.
    Lovász, L., Kannan, R.: Faster mixing via average conductance. In: Proceedings of the 31st annual ACM symposium on theory of computing, pp. 282–287 (1999)Google Scholar
  12. 12.
    Lovász L., Kannan R., Simonovits M. (1997). Random walks and an O * (n 5) volume algorithm for convex bodies. Random Struct Algorithms 11:1–50CrossRefMATHGoogle Scholar
  13. 13.
    Lovász L., Simonovits M. (1993). Random walks in a convex body and an improved volume algorithm. Random Struct Algorithms 4:359–412MATHGoogle Scholar
  14. 14.
    Lovász, L., Winkler, P.: Efficient stopping rules for Markov chains. In: Proceedings of the 31st annual ACM symposium on theory of computing, pp. 76–82 (1995)Google Scholar
  15. 15.
    Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., Teller E. (1953). Equation of state calculations by fast computing machines. J Chem Phys 21:1087–1092CrossRefGoogle Scholar
  16. 16.
    Molloy M., Reed B. (1995). A critical point for random graphs with given degree sequence. Random Struct Algorithms 6: 161–179MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Montenegro, R.: Faster mixing by isoperimetric inequalities. PhD Thesis, Department of Mathematics, Yale University 2002Google Scholar
  18. 18.
    Randall, D.: Mixing, proceedings the 44th annual IEEE symposium on foundations of computer science, pp. 4–17 (2003)Google Scholar
  19. 19.
    Randall, D., Wilson, D.B.: Sampling spin configurations of an Ising system. In: Proceedings of the 10th ACM/SIAM symposium on discrete algorithms, pp. 959–960 (1999)Google Scholar

Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  1. 1.School of Computer ScienceMcGill UniversityMontrealCanada

Personalised recommendations