Cutoff for random walks on graphs with bottlenecks
2016-06-22·via math.PR updates on arXiv.org
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.