Separation cutoffs for random walk on irreducible representations
Probability
2007-05-23 v1 Representation Theory
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.
Cite
@article{arxiv.math/0703291,
title = {Separation cutoffs for random walk on irreducible representations},
author = {Jason Fulman},
journal= {arXiv preprint arXiv:math/0703291},
year = {2007}
}
Comments
20 pages