Separation cutoffs for random walk on irreducible representations

DOI10.1007/S00026-010-0062-5zbMATH Open1248.60013arXivmath/0703291OpenAlexW2163297766MaRDI QIDQ659593FDOQ659593

Authors: Jason Fulman 

Publication date: 24 January 2012

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

Abstract: Random walk on the irreducible representations of the symmetric and general linear groups is studied. A separation distance cutoff is proved and the exact separation distance asymptotics are determined. A key tool is a method for writing the multiplicities in the Kronecker tensor powers of a fixed representation as a sum of non-negative terms. Connections are made with the Lagrange-Sylvester interpolation approach to Markov chains.

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

Recommendations

• Convergence rates of random walk on irreducible representations of finite groups
• scientific article; zbMATH DE number 2042290
• The random \(k\) cycle walk on the symmetric group
• Enumeration and random walks on finite groups
• Comparison techniques for random walk on finite groups

zbMATH Keywords

Markov chainseparation distancecutoff phenomenonirreducible representation of a finite groupLagrange-Sylvester interpolation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A course in combinatorics.
• Title not available (Why is that?)
• Shuffling Cards and Stopping Times
• Title not available (Why is that?)
• Strong uniform times and finite random walks
• Title not available (Why is that?)
• Strong stationary times via a new form of duality
• Mixing times of lozenge tiling and card shuffling Markov chains
• Representations of finite classical groups. A Hopf algebra approach
• Title not available (Why is that?)
• The cutoff phenomenon in finite Markov chains.
• Stein's method and random character ratios
• Title not available (Why is that?)
• Stein's method, Jack measure, and the Metropolis algorithm
• Littelmann paths and Brownian paths
• Separation cut-offs for birth and death chains
• 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
• Derangement characters of the finite general linear group.
• Commutation relations and Markov chains
• Stein’s method and Plancherel measure of the symmetric group
• Exchangeable pairs and Poisson approximation
• Combinatorial operators for Kronecker powers of representations of \(\mathfrak S_n\).
• Title not available (Why is that?)
• Analysis of Top To Random Shuffles
• Card shuffling and the decomposition of tensor products.
• Title not available (Why is that?)
• Spectral Analysis, without Eigenvectors, for Markov Chains

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659593)