Mixing Time for a Markov Chain on Cladograms
From MaRDI portal
Publication:4500418
DOI10.1017/S096354830000417XzbMATH Open0961.60077OpenAlexW2146166368MaRDI QIDQ4500418FDOQ4500418
Publication date: 21 May 2001
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096354830000417x
Computational methods in Markov chains (60J22) Trees (05C05) Ergodicity, mixing, rates of mixing (37A25)
Cited In (18)
- Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
- Heat kernels, stochastic processes and functional inequalities. Abstracts from the workshop held November 17--23, 2019
- The evolving Moran genealogy
- A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
- Topological linkage disequilibrium calculated from coalescent genealogies
- Lagged couplings diagnose Markov chain Monte Carlo phylogenetic inference
- A polynomial upper bound for the mixing time of edge rotations on planar maps
- Spaces of algebraic measure trees and triangulations of the circle
- The Aldous chain on cladograms in the diffusion limit
- Polynomial mixing time of edge flips on quadrangulations
- On the enumeration of leaf-labeled increasing trees with arbitrary node-degree
- Subtree prune and regraft: a reversible real tree-valued Markov process
- Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022
- Algebraic two-level measure trees
- An adjacent-swap Markov chain on coalescent trees
- Wright-Fisher diffusion with negative mutation rates
- Rayleigh processes, real trees, and root growth with re-grafting
- A down‐up chain with persistent labels on multifurcating trees
This page was built for publication: Mixing Time for a Markov Chain on Cladograms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500418)
