How to uniformly, or at least almost uniformly, choose an element from a finite group G? When G is too large to enumerate all its elements, direct (pseudo)random selection is impossible. However, if we have an explicit set of generators of G (e.g., as in the Rubik's cube group), several methods are available. This talk will focus on one such method based on the well-known product replacement algorithm. I will discuss how recent results on property (T) by Kaluba, Kielak, Nowak and Ozawa partially explain the surprisingly good performance of this algorithm.