## Electronic Communications in Probability

### Note: Random-to-front shuffles on trees

Anders Bjorner

#### 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.

#### Article information

Source
Electron. Commun. Probab., Volume 14 (2009), paper no. 4, 36-41.

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

https://projecteuclid.org/euclid.ecp/1465234713

Digital Object Identifier
doi:10.1214/ECP.v14-1445

Mathematical Reviews number (MathSciNet)
MR2481664

Zentralblatt MATH identifier
1190.60059

Rights

#### Citation

Bjorner, Anders. Note: Random-to-front shuffles on trees. Electron. Commun. Probab. 14 (2009), paper no. 4, 36--41. doi:10.1214/ECP.v14-1445. https://projecteuclid.org/euclid.ecp/1465234713

#### References

• Allen, Brian; Munro, Ian. Self-organizing binary search trees. J. Assoc. Comput. Mach. 25 (1978), no. 4, 526–535.
• Bidigare, Pat; Hanlon, Phil; Rockmore, Dan. A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements. Duke Math. J. 99 (1999), no. 1, 135–174.
• Bjorner,A. Random walks, arrangements, cell complexes, greedoids, and self-organizing libraries, in “Building Bridges” (eds. M. Grotschel and G. O. H. Katona), Bolyai Soc. Math. Studies 19 (2008), Springer (Berlin) and Janos Bolyai Math. Soc. (Budapest), pp.165–203.
• Brown, Kenneth S. Semigroups, rings, and Markov chains. J. Theoret. Probab. 13 (2000), no. 3, 871–938.
• Brown, Kenneth S.; Diaconis, Persi. Random walks and hyperplane arrangements. Ann. Probab. 26 (1998), no. 4, 1813–1854.
• Dobrow, Robert P.; Fill, James Allen. On the Markov chain for the move-to-root rule for binary search trees. Ann. Appl. Probab. 5 (1995), no. 1, 1–19.
• Fill, James Allen; Holst, Lars. On the distribution of search cost for the move-to-front rule. Random Structures Algorithms 8 (1996), no. 3, 179–186.
• Stanley, Richard P. Enumerative combinatorics. Vol. 1.With a foreword by Gian-Carlo Rota.Corrected reprint of the 1986 original.Cambridge Studies in Advanced Mathematics, 49. Cambridge University Press, Cambridge, 1997. xii+325 pp. ISBN: 0-521-55309-1; 0-521-66351-2