English

Cutoff for product replacement on finite groups

Probability 2018-05-15 v1

Abstract

We analyze a Markov chain, known as the product replacement chain, on the set of generating nn-tuples of a fixed finite group GG. We show that as nn \rightarrow \infty, the total-variation mixing time of the chain has a cutoff at time 32nlogn\frac{3}{2} n \log n with window of order nn. This generalizes a result of Ben-Hamou and Peres (who established the result for G=Z/2G = \mathbb{Z}/2) and confirms a conjecture of Diaconis and Saloff-Coste that for an arbitrary but fixed finite group, the mixing time of the product replacement chain is O(nlogn)O(n \log n).

Keywords

Cite

@article{arxiv.1805.05025,
  title  = {Cutoff for product replacement on finite groups},
  author = {Yuval Peres and Ryokichi Tanaka and Alex Zhai},
  journal= {arXiv preprint arXiv:1805.05025},
  year   = {2018}
}

Comments

26 pages, 1 figure

R2 v1 2026-06-23T01:53:40.181Z