Sampling elements of a finite group: efficiency of the product replacement algorithm with an accumulator

Michał Marcinkowski, Piotr Mizerka

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refin…