Abstract
We prove a new bound on the mixing time of a Markov chain by considering the conductance of its connected subsets.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aldous D.J. (1982). Some inequalities for reversible Markov chains. J Lond Math Soc 25:564–576
Aldous D.J., Lovász L., Winkler P. (1997). Mixing times for uniformly ergodic Markov chains. Stochastic Processes Appl 71:165–185
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
Bollobás B., Janson S., Grimmett G.R. (1996). The random-cluster model on the complete graph. Prob Theory Related Fields 104:283–317
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)
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
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)
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)
Jerrum M., Sinclair A. (1993). Polynomial-time approximation algorithms for the Ising model. SIAM J Comput 22:1087–1116
Kannan, R., Lovász, L., Montenegro, R.: Blocking conductance and mixing in random walks. Combinatorics Prob Comput (to appear)
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)
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
Lovász L., Simonovits M. (1993). Random walks in a convex body and an improved volume algorithm. Random Struct Algorithms 4:359–412
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)
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
Molloy M., Reed B. (1995). A critical point for random graphs with given degree sequence. Random Struct Algorithms 6: 161–179
Montenegro, R.: Faster mixing by isoperimetric inequalities. PhD Thesis, Department of Mathematics, Yale University 2002
Randall, D.: Mixing, proceedings the 44th annual IEEE symposium on foundations of computer science, pp. 4–17 (2003)
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)
Author information
Authors and Affiliations
Corresponding author
Rights 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
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-006-0003-8