Convergence rates of random walk on irreducible representations of finite groups

Journal of Theoretical Probability

Volumn 21, Issue 1, 2008, Pages 193-211

  Fulman, Jason ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Cutoff phenomenon; Finite group; Hidden subgroup problem; Markov chain; Plancherel measure; Quantum computing

Indexed keywords

EID: 38549162657     PISSN: 08949840     EISSN: 15729230     Source Type: Journal    
DOI: 10.1007/s10959-007-0102-1     Document Type: Article

References (42)

1. Aldous, D.: Random walks on finite groups and rapidly mixing Markov chains. In: Séminaire de Probabilités, XVII. LNM, vol. 989, pp. 243-297. Springer, Berlin (1983)
2. Andrews, G.: The Theory of Partitions. Cambridge University Press, Cambridge (1984)
3. Biane, P.: Representations of symmetric groups and free probability. Adv. Math. 175, 126-181 (1997)
4. Biane, P.: Estimation asymptotique des multiplicités dans les puissances tensorielles d'un g-module. C.R. Acad. Sci. Paris. Sér. I Math. 316, 849-852 (1993)
5. Biane, P., Bougerol, P., O'Connell, N.: Littelmann paths and Brownian paths. Duke Math. J. 130, 127-167 (2005)
6. Borodin, A., Okounkov, A., Olshanski, G.: Asymptotics of Plancherel measure for symmetric groups. J. Am. Math. Soc. 13, 481-515 (2000)
7. Chatterjee, S.: Concentration inequalities with exchangeable pairs. Stanford University Ph.D. Thesis (2005)
8. Diaconis, P.: Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward (1988)
9. Diaconis, P.: The cutoff phenomenon in finite Markov chains. Proc. Nat. Acad. Sci. U.S.A. 93, 1659-1664 (1996)
10. Diaconis, P., Hanlon, P.: Eigen-analysis for some examples of the Metropolis algorithm. In: Hypergeometric Functions on Domains of Positivity, Jack Polynomials, and Applications. Contemp. Math., vol. 138, pp. 99-117 (1992)
11. Diaconis, P., Saloff-Coste, L.: Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3, 696-730 (1993)
12. Diaconis, P., Shahshahani, M.: Generating a random permutation with random transpositions. Z. Wahr. Verw. Gebiete 57, 159-179 (1981)
13. Eymard, P., Roynette, B.: Marches aléatoires sur le dual de SU(2). In: Analyse Harmonique sur les Groupes de Lie. LNM, vol. 497, pp. 108-152. Springer, Berlin (1975)
14. Fulman, J.: GL(n,q) and increasing subsequences in non-uniform random permutations. Ann. Comb. 6, 19-32 (2002)
15. Fulman, J.: Applications of symmetric functions to cycle and increasing subsequence structure after shuffles. J. Algebraic Comb. 16, 165-194 (2002)
16. Fulman, J.: Stein's method and Plancherel measure of the symmetric group. Trans. Am. Math. Soc. 357, 555-570 (2004)
17. Fulman, J.: Stein's method, Jack measure, and the Metropolis algorithm. J. Comb. Theory Ser. A 108, 275-296 (2004)
18. Fulman, J.: Card shuffling and the decomposition of tensor products. Pac. J. Math. 217, 247-262 (2004)
19. Fulman, J.: Separation cutoffs for random walk on irreducible representations. arXiv.org preprint math.PR/0703291 (2007)
20. Fulman, J.: Stein's method and random character ratios. Trans. Am. Math. Soc. (to appear)
21. Gnedin, A., Kerov, S.: Derangement characters of the finite general linear group. Algebr. Represent. Theory 8, 255-274 (2005)
22. n. Sém. Lothar. Comb. 54 (2005/2006), Art. B54j, 13 pp. (electronic)
23. Grabiner, D., Magyar, P.: Random walks in Weyl chambers and the decomposition of tensor powers. J. Algebraic Comb. 2, 239-260 (1993)
24. Hallgren, S., Russell, A., Ta-Shma, A.: Normal subgroup reconstruction and quantum computation using group representations. In: Proc. 32nd STOC, pp. 627-635 (2000)
25. q ) by random transvections. J. Algebraic Comb. 1, 133-150 (1992)
26. Johansson, K.: Discrete orthogonal polynomial ensembles and the Plancherel measure. Ann. Math. 153, 259-296 (2001)
27. Kempe, J., Shalev, A.: The hidden subgroup problem and permutation group theory. In: Proc. 16th ACM-SIAM SODA, pp. 1118-1125 (2005)
28. Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35, 170-188 (2005)
29. Lomont, C.: The hidden subgroup problem-review and open problems. arXiv.org preprint quant-ph/0411037 (2004)
30. Macdonald, I.G.: Symmetric Functions and Hall Polynomials, 2nd edn. Clarendon Press, Oxford (1995)
31. McKay, J.: Graphs, singularities, and finite groups. The Santa Cruz Conference on Finite Groups (1979). Proc. Sympos. Pure Math. 37, 183-186 (1980)
32. Moore, C., Russell, A.: On the impossibility of a quantum sieve algorithm for graph isomorphism. arXiv.org preprint quant-ph/0609138 (2006)
33. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
34. Okounkov, A.: Random matrices and random permutations. Int. Math. Res. Notices 20, 1043-1095 (2000)
35. Rudvalis, A., Shinoda, K.: An enumeration in finite classical groups. Technical report, U-Mass. Amherst Department of Mathematics (1988)
36. Sagan, B.: The Symmetric Group. Representations, Combinatorial Algorithms, and Symmetric Functions. Springer, New York (1991)
37. Saloff-Coste, L.: Random walk on finite groups. In: Probability on Discrete Structures. Encyclopedia Math. Sci., vol. 110, pp. 263-346. Springer, Berlin (2004)
38. Stanley, R.: Enumerative Combinatorics, vol. 1. Wadsworth and Brooks/Cole, Monterey (1986)
39. Stanley, R.: Enumerative Combinatorics, vol. 2. Cambridge Studies in Advanced Mathematics, vol. 62. Cambridge University Press, Cambridge (1999)
40. Tate, T., Zelditch, S.: Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers. J. Funct. Anal. 217, 402-447 (2004)
41. Vershik, A., Kerov, S.: On an infinite dimensional group over a finite field. Funct. Anal. Appl. 32, 147-152 (1999)
42. Zelevinsky, A.: Representations of Finite Classical Groups: a Hopf Algebra Approach. LNM, vol. 869. Springer, Berlin (1981)