Cutoff for random walks on graphs with bottlenecks
Probability
2019-07-02 v3
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.
Cite
@article{arxiv.1606.06723,
title = {Cutoff for random walks on graphs with bottlenecks},
author = {Ioannis Papageorgiou},
journal= {arXiv preprint arXiv:1606.06723},
year = {2019}
}