Random walks on generating sets for finite groups
The electronic journal of combinatorics, The Wilf Festschrift volume, Tome 4 (1997) no. 2
We analyze a certain random walk on the cartesian product $G^n$ of a finite group $G$ which is often used for generating random elements from $G$. In particular, we show that the mixing time of the walk is at most $c_r n^2 \log n$ where the constant $c_r$ depends only on the order $r$ of $G$.
@article{10_37236_1322,
author = {F. R. K. Chung and R. L. Graham},
title = {Random walks on generating sets for finite groups},
journal = {The electronic journal of combinatorics},
year = {1997},
volume = {4},
number = {2},
doi = {10.37236/1322},
zbl = {0883.60065},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1322/}
}
F. R. K. Chung; R. L. Graham. Random walks on generating sets for finite groups. The electronic journal of combinatorics, The Wilf Festschrift volume, Tome 4 (1997) no. 2. doi: 10.37236/1322
Cité par Sources :