Change search
ReferencesLink to record
Permanent link

Direct link
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).ORCID iD: 0000-0002-7497-2764
2009 (English)In: Electronic Communications in Probability, ISSN 1083-589X, Vol. 14, 36-41 p.Article in journal (Refereed) Published
Abstract [en]

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.
Keyword [en]
Markov chain, shuffle, random-to-front, random walk, tree, semigroup, hyperplane arrangements
URN: urn:nbn:se:kth:diva-18155ISI: 000263106000001ScopusID: 2-s2.0-61449139065OAI: diva2:336201
QC 20100525Available from: 2010-08-05 Created: 2010-08-05Bibliographically approved

Open Access in DiVA

No full text


Search in DiVA

By author/editor
Björner, Anders
By organisation
Mathematics (Div.)
In the same journal
Electronic Communications in Probability

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link