Open Access
2009 Note: Random-to-front shuffles on trees
Anders Bjorner
Author Affiliations +
Electron. Commun. Probab. 14: 36-41 (2009). DOI: 10.1214/ECP.v14-1445


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.


Download Citation

Anders Bjorner. "Note: Random-to-front shuffles on trees." Electron. Commun. Probab. 14 36 - 41, 2009.


Accepted: 4 February 2009; Published: 2009
First available in Project Euclid: 6 June 2016

zbMATH: 1190.60059
MathSciNet: MR2481664
Digital Object Identifier: 10.1214/ECP.v14-1445

Primary: 60J10
Secondary: 05E99 , 60C05

Keywords: eigenvalue , Markov chain , Random walk , random-to-front , semigroup , shuffle , tree

Back to Top