论文信息 - Sensitivity of mixing times

Sensitivity of mixing times

In this note, we demonstrate an instance of bounded-degree graphs of size $n$, for which the total variation mixing time for the random walk is decreased by a factor of $\log n/ \log\log n$ if we multiply the edge-conductances by bounded factors in a certain way.

Jian Ding | Yuval Peres

[1] V. Climenhaga. Markov chains and mixing times , 2013 .

[2] Bruce A. Reed,et al. The evolution of the mixing rate of a simple random walk on the giant component of a random graph , 2008, Random Struct. Algorithms.

[3] P. Diaconis,et al. LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .

[4] B. Reed,et al. Faster Mixing and Small Bottlenecks , 2006 .

[5] Instability of the Liouville property for quasi-isometric graphs and manifolds of polynomial volume growth , 1991 .

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

[7] Y. Peres,et al. Critical random graphs: Diameter and mixing time , 2007, math/0701316.

[8] R. Holley,et al. Rapid Convergence to Equilibrium of Stochastic Ising Models in the Dobrushin Shlosman Regime , 1987 .

[9] David J. Aldous,et al. Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[10] Y. Peres,et al. Evolving sets, mixing and heat kernel bounds , 2003, math/0305349.

[11] Nicholas C. Wormald,et al. The mixing time of the giant component of a random graph , 2006, Random Struct. Algorithms.

[12] . Markov Chains and Random Walks on Graphs , .

[13] P. Tetali,et al. Mixing Time Bounds via the Spectral Profile , 2005, math/0505690.

[14] G. Kozma. On the precision of the spectral prole , 2007 .

[15] G. Kozma. On the precision of the spectral profile , 2007, 0709.0112.