Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths

DOI10.1007/s00180-020-00969-1zbMath1505.62384OpenAlexW3010653897MaRDI QIDQ2228245

David A. Spade

Publication date: 17 February 2021

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-020-00969-1

zbMATH Keywords

Markov chain Monte Carlomixing timeBayesian methodsstatistical phylogenetics

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Applications of statistics to biology and medical sciences; meta analysis (62P10) Bayesian inference (62F15) Problems related to evolution (92D15) Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05)

Related Items (1)

Estimating drift and minorization coefficients for Gibbs sampling algorithms

Uses Software

• MrBayes
• BEAST
• BEAUti
• Bali-phy

Cites Work

• Unnamed Item
• Unnamed Item
• Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances
• Geometric ergodicity of a hybrid sampler for Bayesian inference of phylogenetic branch lengths
• Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
• Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree
• Geometric ergodicity of Metropolis algorithms
• Inference from iterative simulation using multiple sequences
• Markov chain Monte Carlo methods for stochastic volatility models.
• Rates of convergence of the Hastings and Metropolis algorithms
• Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
• Simulation Run Length Control in the Presence of an Initial Transient
• Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
• On the geometric ergodicity of hybrid samplers
• Bayesian Model Selection in Finite Mixtures by Marginal Density Decompositions
• Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
• Equation of State Calculations by Fast Computing Machines
• Adaptive importance sampling in monte carlo integration
• Identifiability of a Markovian model of molecular evolution with gamma-distributed rates
• Monte Carlo sampling methods using Markov chains and their applications
• Matching Sequences under Deletion/Insertion Constraints

This page was built for publication: Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths