NOTE: RANDOM-TO-FRONT SHUFFLES ON TREES
2009 (English)In: Electronic Communications in Probability, ISSN 1083-589X, Vol. 14, 36-41 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2009. Vol. 14, 36-41 p.
Markov chain, shuffle, random-to-front, random walk, tree, semigroup, hyperplane arrangements
IdentifiersURN: urn:nbn:se:kth:diva-18155ISI: 000263106000001ScopusID: 2-s2.0-61449139065OAI: oai:DiVA.org:kth-18155DiVA: diva2:336201
QC 201005252010-08-052010-08-05Bibliographically approved