2006/07/18 by Fulman, Jason · 1 citation
#FOS: Mathematics #Probability (math.PR) #Representation Theory (math.RT)
paper · doi:10.48550/arxiv.math/0607399
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an asymptotic description of Plancherel measure of the finite general linear groups is given, and a connection of these random walks with quantum computing is noted.