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

A refinement of the product replacement algorithm aims to draw nearly uniform elements from a finite group. This talk studies how many steps are needed for the output distribution to approach uniformity, using spectral-gap estimates and computer-assisted calculations in joint work with Michał Marcinkowski.