Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny

From MaRDI portal
Publication:997424

DOI10.1214/105051600000000538zbMATH Open1121.60078arXivq-bio/0505002OpenAlexW1963972906MaRDI QIDQ997424FDOQ997424


Authors: Elchanan Mossel, Eric Vigoda Edit this on Wikidata


Publication date: 6 August 2007

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: Markov chain Monte Carlo algorithms play a key role in the Bayesian approach to phylogenetic inference. In this paper, we present the first theoretical work analyzing the rate of convergence of several Markov chains widely used in phylogenetic inference. We analyze simple, realistic examples where these Markov chains fail to converge quickly. In particular, the data studied are generated from a pair of trees, under a standard evolutionary model. We prove that many of the popular Markov chains take exponentially long to reach their stationary distribution. Our construction is pertinent since it is well known that phylogenetic trees for genes may differ within a single organism. Our results shed a cautionary light on phylogenetic analysis using Bayesian inference and highlight future directions for potential theoretical work.


Full work available at URL: https://arxiv.org/abs/q-bio/0505002




Recommendations




Cites Work


Cited In (14)

Uses Software





This page was built for publication: Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny

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