Geometric convergence of the Metropolis-Hastings simulation algorithm

DOI10.1016/S0167-7152(98)00096-0zbMATH Open0914.60043OpenAlexW2093875919MaRDI QIDQ1273019FDOQ1273019

Authors: Lars Holden 

Publication date: 20 June 1999

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-7152(98)00096-0

Recommendations

• Rates of convergence of the Hastings and Metropolis algorithms
• Geometric ergodicity of Metropolis algorithms
• Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
• On the convergence of the Metropolis-Hastings Markov chains

zbMATH Keywords

convergenceMetropolis-Hastings algorithm

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Random number generation in numerical analysis (65C10) Continuous-time Markov processes on discrete state spaces (60J27)

Cites Work

• Title not available (Why is that?)
• Monte Carlo sampling methods using Markov chains and their applications
• Markov chains and stochastic stability
• Rates of convergence of the Hastings and Metropolis algorithms

Cited In (15)

• Bayesian analysis of the logit model and comparison of two Metropolis-Hastings strategies.
• Improving Convergence of the Hastings–Metropolis Algorithm with an Adaptive Proposal
• Geometric ergodicity of Metropolis algorithms
• On the geometric ergodicity of Metropolis-Hastings algorithms
• Rates of convergence of the Hastings and Metropolis algorithms
• Title not available (Why is that?)
• Geometric ergodicity of Metropolis-Hastings algorithms for conditional simulation in generalized linear mixed models
• Adaptive independent Metropolis-Hastings
• Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
• Numerical Results for the Metropolis Algorithm
• Markov-chain monte carlo: Some practical implications of theoretical results
• On the convergence of the Metropolis-Hastings Markov chains
• Improved Sampling‐Importance Resampling and Reduced Bias Importance Sampling
• A geometric interpretation of the Metropolis-Hastings algorithm.
• Mixing of MCMC algorithms

This page was built for publication: Geometric convergence of the Metropolis-Hastings simulation algorithm

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