Mixing time bounds via bottleneck sequences

Louigi Addario-Berry, Matthew Roberts

Research output: Contribution to journalArticlepeer-review

2 Citations (SciVal)
36 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)845-871
Number of pages27
JournalJournal of Statistical Physics
Issue number3-4
Early online date11 Nov 2017
Publication statusPublished - 1 Nov 2018


  • Isoperimetric profile
  • Mixing times
  • Rough isometry

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Mathematical Physics


Dive into the research topics of 'Mixing time bounds via bottleneck sequences'. Together they form a unique fingerprint.

Cite this