Note: Random-to-front shuffles on trees

Simple item page
dc.creatorBjörner, Anders
dc.date2009-01-27
dc.date.accessioned2026-07-07T12:34:54Z
dc.date.available2026-07-07T12:34:54Z
dc.descriptionA 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.
dc.description6 pages, 4 figures; to appear in Electronic Communications in Probability
dc.identifierhttps://arxiv.org/abs/0901.4278
dc.identifierhttp://arxiv.org/abs/0901.4278
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217604
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60J10; 60C05; 05E99
dc.titleNote: Random-to-front shuffles on trees
dc.typetext

Files

Collections

arXiv