Evolving sets, mixing and heat kernel bounds

We show that a new probabilistic technique, recently introduced by the first author, yields the sharpest bounds obtained to date on mixing times of Markov chains 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 Lovász 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 π. We then extend our results to Markov chains on infinite state spaces and to continuous-time chains. Our approach yields a direct link between isoperimetric inequalities and heat kernel bounds; previously, this link rested on analytic estimates known as Nash inequalities.

[1]  N. Varopoulos.  Isoperimetric inequalities and Markov chains , 1985 .

[2]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[3]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[4]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[5]  A. Sokal,et al.  Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality , 1988 .

[6]  Milena Mihail,et al.  Conductance and convergence of Markov chains-a combinatorial treatment of expanders , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[8]  P. Diaconis,et al.  Strong Stationary Times Via a New Form of Duality , 1990 .

[9]  J. A. Fill.  Eigenvalue bounds on convergence to stationarity for nonreversible markov chains , 1991 .

[10]  F. Chung.  Laplacians of graphs and Cheeger inequalities , 1993 .

[11]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[12]  Shing-Tung Yau,et al.  Eigenvalues of Graphs and Sobolev Inequalities , 1995, Combinatorics, Probability and Computing.

[13]  Thierry Coulhon,et al.  Ultracontractivity and Nash Type Inequalities , 1996 .

[14]  P. Diaconis,et al.  Nash inequalities for finite Markov chains , 1996 .

[15]  Johan Jonasson,et al.  Rates of convergence for lamplighter processes , 1997 .

[16]  L. Saloff-Coste,et al.  Lectures on finite Markov chains , 1997 .

[17]  László Lovász,et al.  Faster mixing via average conductance , 1999, STOC '99.

[18]  Elchanan Mossel,et al.  On the mixing time of a simple random walk on the super critical percolation cluster , 2000 .

[19]  W. Woess.  Random walks on infinite graphs and groups, by Wolfgang Woess, Cambridge Tracts , 2001 .

[20]  Ravi Montenegro,et al.  Edge isoperimetry and rapid mixing on matroids and geometric Markov chains , 2001, STOC '01.

[21]  L. Saloff‐Coste.  RANDOM WALKS ON INFINITE GRAPHS AND GROUPS (Cambridge Tracts in Mathematics 138) , 2001 .

[22]  Thierry Coulhon,et al.  A geometric approach to on-diagonal heat kernel lower bounds on groups , 2001 .

[23]  Peter Winkler.  Rapid mixing , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[24]  É. Remy,et al.  Isoperimetry and heat kernel decay on percolation clusters , 2003, math/0301213.

[25]  Ravi Kannan.  Rapid mixing in Markov chains , 2003 .

[26]  Prasad Tetali,et al.  Isoperimetric Invariants For Product Markov Chains and Graph Products , 2004, Comb..