No cutoff for circulants: an elementary proof

DOI10.37190/0208-4147.00032zbMath1498.60024OpenAlexW4292882399MaRDI QIDQ5043618

No author found.

Publication date: 6 October 2022

Published in: Probability and Mathematical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37190/0208-4147.00032

zbMATH Keywords

cutoffabelian groupsrandom walkmixing time

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Finite abelian groups (20K01) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Cutoff phenomena for random walks on random regular graphs
• The cutoff phenomenon for ergodic Markov processes
• Strong uniform times and finite random walks
• Comparison techniques for random walk on finite groups
• Moderate growth and random walk on finite groups
• Mixing and cut-off in cycle walks
• Shuffling Cards and Stopping Times
• The cutoff phenomenon in finite Markov chains.
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures