% Plain TeX -> abstract for V4(2) R7 
\magnification=1440\hsize = 6 true in \noindent
{\bf  F. R. K. Chung and R. L. Graham}\bigskip\noindent
{\bf Random walks on generating sets for finite groups}
\vskip.5cm\noindent
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$.
\end