Speeding up random walk mixing by starting from a uniform vertex
Speeding up random walk mixing by starting from a uniform vertex
The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of bottlenecks in a graph hampers mixing and, in particular, starting inside …