scientific article; zbMATH DE number 1750693
From MaRDI portal
Publication:4534218
zbMath0995.60071MaRDI QIDQ4534218
Publication date: 23 October 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods in Markov chains (60J22) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)
Related Items (10)
An adjacent-swap Markov chain on coalescent trees ⋮ Elementary bounds on mixing times for decomposable Markov chains ⋮ A down‐up chain with persistent labels on multifurcating trees ⋮ Beyond windability: approximability of the four-vertex model ⋮ Wright-Fisher diffusion with negative mutation rates ⋮ The Aldous chain on cladograms in the diffusion limit ⋮ A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces ⋮ The worm process for the Ising model is rapidly mixing ⋮ Subtree prune and regraft: a reversible real tree-valued Markov process ⋮ Polynomial mixing time of edge flips on quadrangulations
This page was built for publication:
