Separation cutoffs for random walk on irreducible representations

DOI10.1007/s00026-010-0062-5zbMath1248.60013arXivmath/0703291OpenAlexW2163297766MaRDI QIDQ659593

Jason Fulman

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Markov chaincutoff phenomenonseparation distanceirreducible representation of a finite groupLagrange-Sylvester interpolation

Mathematics Subject Classification ID

Combinatorial probability (60C05) Probabilistic methods in group theory (20P05)

Related Items (4)

Tensor powers of the defining representation of \(S_n\) ⋮ Tensor product Markov chains ⋮ Commutation relations and Markov chains ⋮ Tensor quasi-random groups

Cites Work

• Stein's method, Jack measure, and the Metropolis algorithm
• Strong stationary times via a new form of duality
• Littelmann paths and Brownian paths
• Derangement characters of the finite general linear group.
• Exchangeable pairs and Poisson approximation
• Separation cut-offs for birth and death chains
• Commutation relations and Markov chains
• Strong uniform times and finite random walks
• Representations of finite classical groups. A Hopf algebra approach
• Mixing times of lozenge tiling and card shuffling Markov chains
• Card shuffling and the decomposition of tensor products.
• Applications of symmetric functions to cycle and increasing subsequence structure after shuffles
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• Convergence rates of random walk on irreducible representations of finite groups
• Combinatorial operators for Kronecker powers of representations of \(\mathfrak S_n\).
• Spectral Analysis, without Eigenvectors, for Markov Chains
• Stein's method and random character ratios
• Shuffling Cards and Stopping Times
• Analysis of Top To Random Shuffles
• Stein’s method and Plancherel measure of the symmetric group
• The cutoff phenomenon in finite Markov chains.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Separation cutoffs for random walk on irreducible representations