No cutoff for circulants: an elementary proof

DOI10.37190/0208-4147.00032zbMATH Open1498.60024OpenAlexW4292882399MaRDI QIDQ5043618FDOQ5043618

Author name not available (Why is that?)

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

random walkcutoffmixing timeabelian groups

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• NONEXISTENCE OF A CIRCULANT EXPANDER FAMILY

This page was built for publication: No cutoff for circulants: an elementary proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043618)