Random walks on generating sets for finite groups (Q1378540): Difference between revisions

Summary: 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\).