Note: Random-to-front shuffles on trees
Probability
2009-01-28 v1 Combinatorics
Abstract
A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local "random-to-front" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the transition matrix are determined using Brown's theory of random walk on semigroups.
Cite
@article{arxiv.0901.4278,
title = {Note: Random-to-front shuffles on trees},
author = {Anders Björner},
journal= {arXiv preprint arXiv:0901.4278},
year = {2009}
}
Comments
6 pages, 4 figures; to appear in Electronic Communications in Probability