Georgia Institute of Technology College of Sciences

When studying the mixing of random walks on groups, information about the relative likelihoods of the elements under the walk can serve to help understand the mixing and reveal some internal structure. Starting with some elementary arguments of Diaconis and Isaacs and moving into arguments using representation theory of the symmetric group, I'll demonstrate some total and partial orders on finite groups that describe the relative likeliness under random walks. No prior knowledge is assumed.