arXiv Analytics

Sign in

arXiv:0908.1141 [math.CO]AbstractReferencesReviewsResources

A sharp analysis of the mixing time for random walk on rooted trees

Jason Fulman

Published 2009-08-08Version 1

We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n^2 steps are necessary and suffice for convergence to the stationary distribution.

Comments: 13 pages
Categories: math.CO, math.PR
Related articles: Most relevant | Search more
arXiv:1306.5008 [math.CO] (Published 2013-06-20, updated 2014-11-12)
Likelihood Orders for some Random Walks on the Symmetric Group
arXiv:2104.09706 [math.CO] (Published 2021-04-20)
Several consequences of adding or removing an edge from an electric network
arXiv:1606.09588 [math.CO] (Published 2016-06-30)
A random walk on the symmetric group generated by random involutions

Links

Toolbox