The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this paper to mix for $\frac{1} {2} \leq p \leq 1$ fixed, $n$ sufficiently large in between $\log _{1/p}(n)$ steps and $\log _{2/(1+p)}(n)$ steps. The paper introduces a new technique for finding eigenvalues of random walks on the symmetric group generated by many conjugacy classes using the character polynomial for the characters of the representations of the symmetric group. Monotonicity relations used in the bound also give after sufficient time the likelihood order, the asymptotic order from most likely to least likely permutation. The walk was introduced to study a conjecture about a random walk on the unitary group from the information theory of black holes.
Electron. J. Probab.
23:
1-28
(2018).
DOI: 10.1214/18-EJP140
[2] Persi Diaconis. Group representations in probability and statistics. Institute of Mathematical Statistics Lecture Notes—Monograph Series, 11. Institute of Mathematical Statistics, Hayward, CA, 1988.[2] Persi Diaconis. Group representations in probability and statistics. Institute of Mathematical Statistics Lecture Notes—Monograph Series, 11. Institute of Mathematical Statistics, Hayward, CA, 1988.
[4] Persi Diaconis and Mehrdad Shahshahani. Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Gebiete, 57(2):159–179, 1981. MR626813 0485.60006 10.1007/BF00535487[4] Persi Diaconis and Mehrdad Shahshahani. Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Gebiete, 57(2):159–179, 1981. MR626813 0485.60006 10.1007/BF00535487
[5] A. M. Garsia and A. Goupil. Character polynomials, their $q$-analogs and the Kronecker product. Electron. J. Combin., 16(2, Special volume in honor of Anders Bjorner):Research Paper 19, 40, 2009.[5] A. M. Garsia and A. Goupil. Character polynomials, their $q$-analogs and the Kronecker product. Electron. J. Combin., 16(2, Special volume in honor of Anders Bjorner):Research Paper 19, 40, 2009.
[7] David A. Levin, Yuval Peres, and Elizabeth L. Wilmer. Markov chains and mixing times. American Mathematical Society, Providence, RI, 2009. With a chapter by James G. Propp and David B. Wilson.[7] David A. Levin, Yuval Peres, and Elizabeth L. Wilmer. Markov chains and mixing times. American Mathematical Society, Providence, RI, 2009. With a chapter by James G. Propp and David B. Wilson.
[8] Dudley E. Littlewood. The theory of group characters and matrix representations of groups. AMS Chelsea Publishing, Providence, RI, 2006. Reprint of the second (1950) edition. 0038.16504[8] Dudley E. Littlewood. The theory of group characters and matrix representations of groups. AMS Chelsea Publishing, Providence, RI, 2006. Reprint of the second (1950) edition. 0038.16504
[10] I. G. Macdonald. Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York, second edition, 1995. With contributions by A. Zelevinsky, Oxford Science Publications.[10] I. G. Macdonald. Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York, second edition, 1995. With contributions by A. Zelevinsky, Oxford Science Publications.
[12] Richard P. Stanley. Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin.[12] Richard P. Stanley. Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin.
