no. 17 · Wednesday 18 November 2026
Cutoff on abelian groups
Abstract
We prove the long-predicted equivalence between the cutoff phenomenon and the product condition along any sequence of abelian random walks whose inverse transition probabilities grow at most logarithmically with the size of the group. Our result does not require reversibility, and comes with a sharp quantitative estimate on the mixing window. Moreover, we show that our sparsity restriction is optimal by constructing abelian Cayley graphs which satisfy the product condition but fail to exhibit cutoff, and whose degrees are arbitrarily close to being logarithmic in the volume.
- comments
- 21 human-written pages, comments welcome!
- fields
- Probability