A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces |
| |
Institution: | 1. Party School of the Chengdu Committee of the Chinese Communist Party, Chengdu 610110, China;2. School of Management, Fudan University, Shanghai 200433, China;3. Business School, University of Nottingham Ningbo, Ningbo 315100, China |
| |
Abstract: | Phylogenetic trees are commonly used to model the evolutionary relationships among a collection of biological species. Over the past fifteen years, the convergence properties for Markov chains defined on phylogenetic trees have been studied, yielding results about the time required for such chains to converge to their stationary distributions. In this work we derive an upper bound on the relaxation time of two Markov chains on rooted binary trees: one defined by nearest neighbor interchanges (NNI) and the other defined by subtree prune and regraft (SPR) moves. |
| |
Keywords: | Markov chains Phylogenetic trees Relaxation time Distinguished paths |
本文献已被 ScienceDirect 等数据库收录! |
|