Yuval Peres, Perla Sousi
Published 2013-07-10Version 1
We construct a family of trees on which a lazy simple random walk exhibits total variation cutoff. The main idea behind the construction is that hitting times of large sets should be concentrated around their means. For this sequence of trees we compute the mixing time, the relaxation time and the cutoff window.
Total variation cutoff for the flip-transpose top with random shuffle
Relaxation times are stationary hitting times of large sets
Total variation cutoff for the transpose top-$2$ with random shuffle
![QR code for arXiv:1307.2887 [math.PR]](http://oss.arxitics.com/images/favicon.svg)