Sensitivity of mixing times

  title={Sensitivity of mixing times},
  author={Jian Ding and Yuval Peres Microsoft},
  • Jian Ding, Yuval Peres Microsoft
  • Published 2013
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. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.

Similar Papers

Loading similar papers…