Cutoff for random walks on graphs with bottlenecks
  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. 
Ioannis Papageorgiou (USP)
math.PR