NOTE: RANDOM-TO-FRONT SHUFFLES ON TREES

ANDERS BJORNER¨Abstract. A Markov chain is considered whose states are orderings of anunderlying fixed tree and whose transitions are local “random-to-front” re-orderings, driven by a probability distribution on subsets of the leaves. Theeigenvalues of the transition matrix are determined using Brown’s theory ofrandom walk on semigroups.