Cutoff for random walks on graphs with bottlenecks
arXiv:1606.06723
Abstract
We examine the mixing time for random walks on graphs. In particular we are interested on investigating graphs with bottlenecks. Furthermore, the cutoff phenomenon is examined.