Diagonalizing Transition Matrices of Card shuffles

In their seminal work, Diaconis and Shahshahani used representation theory of the symmetric group to diagonalize the transition matrix of random transpositions. More recently, Dieker and Saliola introduced another technique to diagonalize the random-to-random card shuffle. In this talk we will discuss connections between these techniques as well as application to card shuffling.