Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
Faster Mixing and Small Bottlenecks
Download PDF
Download PDF
  • Original Article
  • Published: 27 April 2006

Faster Mixing and Small Bottlenecks

  • N. Fountoulakis1 &
  • B. A. Reed1 

Probability Theory and Related Fields volume 137, pages 475–486 (2007)Cite this article

  • 200 Accesses

  • 14 Citations

  • Metrics details

Abstract

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

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  1. Aldous D.J. (1982). Some inequalities for reversible Markov chains. J Lond Math Soc 25:564–576

    MathSciNet  MATH  Google Scholar 

  2. Aldous D.J., Lovász L., Winkler P. (1997). Mixing times for uniformly ergodic Markov chains. Stochastic Processes Appl 71:165–185

    Article  MATH  Google Scholar 

  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–420

    Article  MathSciNet  MATH  Google Scholar 

  4. Bollobás B., Janson S., Grimmett G.R. (1996). The random-cluster model on the complete graph. Prob Theory Related Fields 104:283–317

    Article  MATH  Google Scholar 

  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)

  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–114

    Article  MathSciNet  MATH  Google Scholar 

  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)

  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)

  9. Jerrum M., Sinclair A. (1993). Polynomial-time approximation algorithms for the Ising model. SIAM J Comput 22:1087–1116

    Article  MathSciNet  MATH  Google Scholar 

  10. Kannan, R., Lovász, L., Montenegro, R.: Blocking conductance and mixing in random walks. Combinatorics Prob Comput (to appear)

  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)

  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–50

    Article  MATH  Google Scholar 

  13. Lovász L., Simonovits M. (1993). Random walks in a convex body and an improved volume algorithm. Random Struct Algorithms 4:359–412

    MATH  Google Scholar 

  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)

  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–1092

    Article  Google Scholar 

  16. Molloy M., Reed B. (1995). A critical point for random graphs with given degree sequence. Random Struct Algorithms 6: 161–179

    Article  MathSciNet  MATH  Google Scholar 

  17. Montenegro, R.: Faster mixing by isoperimetric inequalities. PhD Thesis, Department of Mathematics, Yale University 2002

  18. Randall, D.: Mixing, proceedings the 44th annual IEEE symposium on foundations of computer science, pp. 4–17 (2003)

  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)

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, 3480 University Street, Montreal, PQ, H3A 2A7, Canada

    N. Fountoulakis & B. A. Reed

Authors
  1. N. Fountoulakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. A. Reed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. A. Reed.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Fountoulakis, N., Reed, B.A. Faster Mixing and Small Bottlenecks. Probab. Theory Relat. Fields 137, 475–486 (2007). https://doi.org/10.1007/s00440-006-0003-8

Download citation

  • Received: 26 October 2005

  • Revised: 17 February 2006

  • Published: 27 April 2006

  • Issue Date: March 2007

  • DOI: https://doi.org/10.1007/s00440-006-0003-8

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Markov Chain
  • Convex Body
  • Random Graph
  • Degree Sequence
  • Giant Component
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature