Cutoff for random walks on graphs with bottlenecks

2016/06/21 by Papageorgiou, Ioannis
#60J10 #FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/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.

Related

• Speeding up random walk mixing by starting from a uniform vertex
• Cutoff for activated random walk
• A threshold for cutoff in two-community random graphs
• Random walks on the random graph
• Comparing mixing times on sparse random graphs