Random walks on generating sets for finite groups
The electronic journal of combinatorics, The Wilf Festschrift volume, Tome 4 (1997) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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$.
DOI : 10.37236/1322
Classification : 60G50, 60B15
Mots-clés : random walk
@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/}
}
TY  - JOUR
AU  - F. R. K. Chung
AU  - R. L. Graham
TI  - Random walks on generating sets for finite groups
JO  - The electronic journal of combinatorics
PY  - 1997
VL  - 4
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1322/
DO  - 10.37236/1322
ID  - 10_37236_1322
ER  - 
%0 Journal Article
%A F. R. K. Chung
%A R. L. Graham
%T Random walks on generating sets for finite groups
%J The electronic journal of combinatorics
%D 1997
%V 4
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1322/
%R 10.37236/1322
%F 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 :