Abstract
A cladogram is a tree with labelled leaves and unlabelled degree-3 branchpoints. A certain
Markov chain on the set of n-leaf cladograms consists of removing a random leaf (and its
incident edge) and re-attaching it to a random edge. We show that the mixing time (time
to approach the uniform stationary distribution) for this chain is at least
O(n2) and at most O(n3).
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献