Cutoff for random walks on graphs with bottlenecks
Ioannis Papageorgiou (USP)
TL;DR
This paper investigates the mixing times of random walks on graphs with bottlenecks, focusing on the cutoff phenomenon to understand how bottlenecks affect convergence rates.
Contribution
It provides new insights into how bottlenecks influence the cutoff phenomenon in the mixing times of random walks on graphs.
Findings
Bottlenecks significantly delay mixing times.
Cutoff phenomenon is affected by graph bottlenecks.
New bounds on mixing times for graphs with bottlenecks.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Stochastic processes and statistical mechanics · Complexity and Algorithms in Graphs