Mixing Time for a Markov Chain on Cladograms

By David J. Aldous. Combinatorics, probability & computing, 2000

50 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

SUBTREE PRUNE AND REGRAFT: A REVERSIBLE REAL TREE-VALUED MARKOV PROCESS (2005, background): “Chains based on other moves are investigated in [5, 14, 29].”
Random walks on trees and matchings (2002, background): “Aldous (2000) and Schweinsberg (2001) study a different walk for which they have given coupling and eigenvalue bounds quite different from (1).”
Rayleigh processes, real trees, and root growth with re-grafting (2004, background): “Once the extended process has been constructed, we gain a new perspective on objects such as standard Brownian excursion and the associated random triangulation of the circle (see [Ald94a, Ald94b, Ald00 ]).”
Probabilities on cladograms: introduction to the alpha model (2005, background): “Previously, David Aldous has introduced a one dimensional continuous family of models, collectively called the beta model ([4],[5],[6]), which interpolates between the Yule, Uniform and Comb models.”