Mixing time bounds via bottleneck sequences
  We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees. 
Louigi Addario-Berry and Matthew I. Roberts
math.PR