Random walks on generating sets for finite groups
Abstract
We analyze a certain random walk on the cartesian product Gn 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 crn2logn where the constant cr depends only on the order r of G.
Published
1996-11-12
Article Number
R7