Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths
From MaRDI portal
Publication:2228245
Discrete-time Markov processes on general state spaces (60J05) Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Applications of statistics to biology and medical sciences; meta analysis (62P10) Monte Carlo methods (65C05) Problems related to evolution (92D15)
Recommendations
- Geometric ergodicity of a hybrid sampler for Bayesian inference of phylogenetic branch lengths
- Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny
- Bayesian Phylogenetic Inference via Markov Chain Monte Carlo Methods
- Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species
- Bayesian phylogenetics. Methods, algorithms, and applications
Cites work
- Adaptive importance sampling in monte carlo integration
- Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree
- Bayesian Model Selection in Finite Mixtures by Marginal Density Decompositions
- Equation of state calculations by fast computing machines
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Geometric ergodicity of a hybrid sampler for Bayesian inference of phylogenetic branch lengths
- Geometric ergodicity of Metropolis algorithms
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
- scientific article; zbMATH DE number 3943611 (Why is no real title available?)
- scientific article; zbMATH DE number 3323598 (Why is no real title available?)
- Identifiability of a Markovian model of molecular evolution with gamma-distributed rates
- Inference from iterative simulation using multiple sequences
- Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
- Markov chain Monte Carlo methods for stochastic volatility models.
- Matching Sequences under Deletion/Insertion Constraints
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Monte Carlo sampling methods using Markov chains and their applications
- On the geometric ergodicity of hybrid samplers
- Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances
- Rates of convergence of the Hastings and Metropolis algorithms
- Simulation Run Length Control in the Presence of an Initial Transient
Cited in
(2)
This page was built for publication: Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228245)