Convergence rates of random walk on irreducible representations of finite groups

DOI10.1007/s10959-007-0102-1zbMath1138.60010arXivmath/0607399OpenAlexW2155048110MaRDI QIDQ2481391

Jason Fulman

Publication date: 9 April 2008

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0607399

zbMATH Keywords

Plancherel measureMarkov chainQuantum computingFinite groupCutoff phenomenonHidden subgroup problem

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Probabilistic methods in group theory (20P05)

Related Items

Block characters of the symmetric groups., Partial isomorphisms over finite fields, Tensor product Markov chains, Separation cutoffs for random walk on irreducible representations, Step Size in Stein's Method of Exchangeable Pairs, On the modular McKay graph of \(\mathrm{SL}_n(p)\) with respect to its standard representation, Commutation relations and Markov chains, On fixed points of permutations., Representations of SO(3) and angular polyspectra, Tensor quasi-random groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks in Weyl chambers and the decomposition of tensor powers
• Stein's method, Jack measure, and the Metropolis algorithm
• Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers
• Littelmann paths and Brownian paths
• Derangement characters of the finite general linear group.
• Representations of finite classical groups. A Hopf algebra approach
• Generating random elements in \(SL_ n(F_ q)\) by random transvections
• Representations of symmetric groups and free probability
• On an infinite-dimensional group over a finite field
• Comparison theorems for reversible Markov chains
• Card shuffling and the decomposition of tensor products.
• Applications of symmetric functions to cycle and increasing subsequence structure after shuffles
• GL(n, q) and increasing subsequences in non-uniform random permutations
• Combinatorial operators for Kronecker powers of representations of \(\mathfrak S_n\).
• Normal subgroup reconstruction and quantum computation using group representations
• Stein's method and random character ratios
• Generating a random permutation with random transpositions
• Stein’s method and Plancherel measure of the symmetric group
• The cutoff phenomenon in finite Markov chains.
• Asymptotics of Plancherel measures for symmetric groups
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Discrete orthogonal polynomial ensembles and the Plancherel measure