Mixing Times for the Branch-Rotation Chain on Cladograms (or the Triangulation Walk) This concerns two problems which are similar (intuitively, at least). Con2n−4)! sider the regular n-gon. There are a finite number Cn - Walk-on - Document - PDFSEARCH.IO

First Page	Meta Content
	Mixing Times for the Branch-Rotation Chain on Cladograms (or the Triangulation Walk) This concerns two problems which are similar (intuitively, at least). Con2n−4)! sider the regular n-gon. There are a finite number Cn Add to Reading List Document Date: 2005-12-16 11:50:43 Open Document File Size: 70,82 KB Share Result on Facebook Company Cambrdige University Press / Monte Carlo / / IndustryTerm base chain / local search / / Position D.J. / / SocialTag Phylogenetics Combinatorics Markov processes Stochastic processes Triangulation Cladogram Markov chain Catalan number Cladistics Statistics

Mixing Times for the Branch-Rotation Chain on Cladograms (or the Triangulation Walk) This concerns two problems which are similar (intuitively, at least). Con2n−4)! sider the regular n-gon. There are a finite number CnAdd to Reading List