A sharp analysis of the mixing time for random walk on rooted trees
Combinatorics
2009-08-11 v1 Probability
Abstract
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.
Keywords
Cite
@article{arxiv.0908.1141,
title = {A sharp analysis of the mixing time for random walk on rooted trees},
author = {Jason Fulman},
journal= {arXiv preprint arXiv:0908.1141},
year = {2009}
}
Comments
13 pages