Note: random-to-front shuffles on trees

DOI10.1214/ECP.v14-1445zbMath1190.60059arXiv0901.4278MaRDI QIDQ1038934

Anders Bjoerner

Publication date: 20 November 2009

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.4278

zbMATH Keywords

treeshufflesemigroupMarkov chainrandom walkrandom-to-front

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Algebraic combinatorics (05E99)

Related Items (15)

Quivers of monoids with basic algebras ⋮ Upper Bounds on Mixing Time of Finite Markov Chains ⋮ Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry ⋮ Mixing time for Markov chain on linear extensions ⋮ Markov Chains for Promotion Operators ⋮ Combinatorial topology and the global dimension of algebras arising in combinatorics ⋮ Random shuffles on trees using extended promotion ⋮ Unified theory for finite Markov chains ⋮ Random walks on rings and modules ⋮ Combinatorial Markov chains on linear extensions ⋮ Properties of the promotion Markov chain on linear extensions ⋮ A five-element transformation monoid on labelled trees ⋮ Markov chains, ${\mathscr R}$-trivial monoids and representation theory ⋮ Directed nonabelian sandpile models on trees ⋮ Character theory of monoids over an arbitrary field.

This page was built for publication: Note: random-to-front shuffles on trees