Cutoff for product replacement on finite groups

PROBABILITY THEORY AND RELATED FIELDS(2020)

引用 1|浏览74
暂无评分
摘要
We analyze a Markov chain, known as the product replacement chain , on the set of generating n -tuples of a fixed finite group G . We show that as n →∞ , the total-variation mixing time of the chain has a cutoff at time 3/2 n log n with window of order n . This generalizes a result of Ben-Hamou and Peres (who established the result for G = ℤ/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(n log n) .
更多
查看译文
关键词
Markov chain,Mixing time,Cutoff phenomenon,Product replacement algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要