Abstract
We estimate the expected mixing time of a random walk on a finite group supported by a random polylogarithmic set of elements. Following the spectral approach of Broder and Shamir, we present an alternative proof of the Dou-Hildebrand estimate and show that it holds almost surely. Good bounds on diameters follow from these results.
Original language | English |
---|---|
Pages (from-to) | 1001-1011 |
Number of pages | 11 |
Journal | Annals of Probability |
Volume | 24 |
Issue number | 2 |
DOIs | |
State | Published - Apr 1996 |
Externally published | Yes |
Keywords
- Cayley graphs
- Diameters
- Finite groups
- Random walk