Ben Morris
ABSTRACT
We show that a new probabilistic technique, recently introduced by the first author, yields the sharpest bounds obtained to date on mixing times in terms of isoperimetric properties of the state space (also known as conductance bounds or Cheeger inequalities). We prove that the bounds for mixing time in total variation obtained by Lovasz and Kannan, can be refined to apply to the maximum relative deviation |pn(x,y)/π(y)-1| of the distribution at time n from the stationary distribution π. Our approach also yields a direct link between isoperimetric inequalities and heat kernel bounds; previously, this link rested on analytic estimates known as Nash inequalities.
- Alon, N. (1986) Eigenvalues and expanders. Combinatorica 6, 83--96. Google Scholar
Digital Library
- Alon, N. and Milman, V. D. (1985). Λ, Isoperimetric inequalities for graphs and superconcentrators, J. Combinatorial Theory Ser. B 38, 73--88.Google ScholarCross Ref
- Benjamini, I. and Mossel, E. (2002) On the mixing time of a simple random walk on the super critical percolation cluster. Probab. Th. Rel. Fields, to appear.Google Scholar
- Chung, F. R. K. (1996) Laplacians of graphs and Cheeger's inequalities. In Combinatorics, Paul Erdos is eighty, Vol. 2 157--172, J. Bolyai Soc. Math. Stud., Budapest.Google Scholar
- Chung, F. R. K. and Yau, S. T. (1995) Eigenvalues of graphs and Sobolev inequalities, Combinatorics, Probability and Computing 4, 11--26.Google ScholarCross Ref
- Coulhon, T. (1996). Ultracontractivity and Nash type inequalities. J. Funct. Anal. 141, 510--539.Google ScholarCross Ref
- Coulhon, T., Grigoryan, A. and Pittet, C. (2001). A geometric approach to on-diagonal heat kernel lower bounds on groups. Ann. Inst. Fourier (Grenoble) 51, 1763--1827.Google ScholarCross Ref
- Diaconis, P. and Saloff-Coste, L. (1996). Nash inequalities for finite Markov chains. J. Theoret. Probab. 9, 459--510.Google ScholarCross Ref
- Fill, J. A. (1991). Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1, 62--87.Google ScholarCross Ref
- Haggstrom, O. and Jonasson, J. (1997). Rates of convergence for lamplighter processes. Stochastic Process. Appl. 67, 227--249.Google ScholarCross Ref
- Houdre, C. and Tetali, P. (2001). Isoperimetric Invariants for Product Markov Chains and Graph Products Combinatorica, to appear. Google ScholarDigital Library
- Jerrum, M. R. and Sinclair, A. J. (1989). Approximating the permanent. SIAM Journal on Computing 18, 1149--1178. Google ScholarDigital Library
- Kannan, R. (2002). Rapid Mixing in Markov Chains Proceedings of International Congress of Math. 2002, Vol. III, 673--683.Google Scholar
- Lawler, G. and Sokal, A. (1988). Bounds on the L2 spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality. Trans. Amer. Math. Soc. 309, 557--580.Google Scholar
- Lovasz, L. and R. Kannan, R. (1995). Faster mixing via average conductance Proceedings of the 27th Annual ACM Symposium on theory of computing. Google ScholarDigital Library
- Mathieu, P. and Remy, E. (2003) Isoperimetry and heat kernel decay on percolation clusters. Ann. Probab., to appear.Google Scholar
- Mihail, M. (1989). Conductance and convergence of Markov chains - A combinatorial treatment of expanders. Proceedings of the 30th Annual Conference on Foundations of Computer Science, 526--531.Google ScholarDigital Library
- Montenegro, R. and Son, J.-B. (2001) Edge Isoperimetry and Rapid Mixing on Matroids and Geometric Markov Chains, Proceedings of the 33rd Annual ACM Symposium on theory of computing. Google ScholarDigital Library
- Morris, B. (2002). A new, probabilistic approach to heat kernel bounds. Lecture at Sectional AMS meeting, Atlanta, GA, March 2002.Google Scholar
- Pittet, C. and Saloff-Coste, L. (2002) A survey on the relationships between volume growth, isoperimetry, and the behavior of simple random walk on Cayley graphs, with examples. Unpublished manuscript, available at: http://www.math.cornell.edu/~lsc/lau.htmlGoogle Scholar
- Saloff-Coste, L. (1997). Lectures on finite Markov chains. Lecture Notes in Math. 1665, Springer, Berlin, 301--413.Google Scholar
- Sinclair, A. (1993) Algorithms for Random Generation and Counting: A Markov Chain Approach, Birkhauser, Boston. Google ScholarDigital Library
- Woess, W. (2000). Random walks on infinite graphs and groups. Cambridge Tracts in Mathematics, 138. Cambridge University Press.Google Scholar
Index Terms
- Evolving sets and mixing
Recommendations
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
SFCS '90: Proceedings of the 31st Annual Symposium on Foundations of Computer ScienceA. Sinclair and M. Jerrum (1988) derived a bound on the mixing rate of time-reversible Markov chains in terms of their conductance. The authors generalize this result by not assuming time reversibility and using a weaker notion of conductance. They ...
The mixing time of the thorp shuffle
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computingThe Thorp shuffle is defined as follows. Cut the deck into two equal piles. Drop the first card from the left pile or the right pile according to the outcome of a fair coin flip; then drop from the other pile. Continue this way until both piles are ...
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs
Let ∑ = (V,E) be a finite, d-regular bipartite graph. For any λ > 0 let πλ be the probability measure on the independent sets of ∑ in which the set I is chosen with probability proportional to λ|I| (πλ is the hard-core measure with activity λ on ∑). We ...
Comments