scientific article; zbMATH DE number 1750693

MaRDI QIDQ4534218zbMATH OpenFDO

Authors Jason Schweinsberg

Publication date 23 October 2002

zbMATH Keywords

cladogramscontinuum random treedistinguished pathsMarkov chainsmixing timesPoincaré inequalities

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Computational methods in Markov chains (60J22)

Recommendations

• Mixing Time for a Markov Chain on Cladograms
• The Aldous chain on cladograms in the diffusion limit
• A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
• Relaxation time of \(L\)-reversal chains and other chromosome shuffles
• An adjacent-swap Markov chain on coalescent trees

Cited in

(11)

• Wright-Fisher diffusion with negative mutation rates
• The Aldous chain on cladograms in the diffusion limit
• Polynomial mixing time of edge flips on quadrangulations
• Elementary bounds on mixing times for decomposable Markov chains
• A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
• Subtree prune and regraft: a reversible real tree-valued Markov process
• Mixing Time for a Markov Chain on Cladograms
• The worm process for the Ising model is rapidly mixing
• An adjacent-swap Markov chain on coalescent trees
• A down‐up chain with persistent labels on multifurcating trees
• Beyond windability: approximability of the four-vertex model

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4534218)