Abstract
We study the rate of convergence of symmetric random walks on finite groups to the uniform distribution. A notion of moderate growth is introduced that combines with eigenvalue techniques to give sharp results. Roughly, for finite groups of moderate growth, a random walk supported on a set of generators such that the diameter of the group is γ requires order γ2 steps to get close to the uniform distribution. This result holds for nilpotent groups with constants depending only on the number of generators and the class. Using Gromov's theorem we show that groups with polynomial growth have moderate growth.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
