Multiplicative random walk Metropolis-Hastings on the real line

DOI10.1007/S13571-012-0040-5zbMATH Open1273.65004arXiv1008.5227OpenAlexW2048648896MaRDI QIDQ356503FDOQ356503

Authors: Somak Dutta 

Publication date: 25 July 2013

Published in: Sankhyā. Series B (Search for Journal in Brave)

Abstract: In this article we propose multiplication based random walk Metropolis Hastings (MH) algorithm on the real line. We call it the random dive MH (RDMH) algorithm. This algorithm, even if simple to apply, was not studied earlier in Markov chain Monte Carlo literature. The associated kernel is shown to have standard properties like irreducibility, aperiodicity and Harris recurrence under some mild assumptions. These ensure basic convergence (ergodicity) of the kernel. Further the kernel is shown to be geometric ergodic for a large class of target densities on $mathbbR$. This class even contains realistic target densities for which random walk or Langevin MH are not geometrically ergodic. Three simulation studies are given to demonstrate the mixing property and superiority of RDMH to standard MH algorithms on real line. A share-price return data is also analyzed and the results are compared with those available in the literature.

Full work available at URL: https://arxiv.org/abs/1008.5227

Recommendations

• The random walk Metropolis: linking theory and practice through a case study
• Geometric ergodicity of Metropolis algorithms
• Optimal scaling of random walk Metropolis algorithms with discontinuous target densities
• On the geometric ergodicity of Metropolis-Hastings algorithms
• Weak convergence and optimal scaling of random walk Metropolis algorithms

zbMATH Keywords

Markov chain Monte CarloMetropolis-Hastings algorithmgeometric ergodicityLangevin algorithmmultiplicative random walkrandom walk algorithmshare-price returnthick tailed density

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Monte Carlo strategies in scientific computing.
• Title not available (Why is that?)
• Exponential convergence of Langevin distributions and their discrete approximations
• Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modeling
• On Bayesian Modeling of Fat Tails and Skewness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monte Carlo sampling methods using Markov chains and their applications
• Equi-energy sampler with applications in statistical inference and statistical mechanics
• Markov chains and stochastic stability
• General state space Markov chains and MCMC algorithms
• Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
• Geometric ergodicity and hybrid Markov chains
• Rates of convergence of the Hastings and Metropolis algorithms
• On the geometric ergodicity of Metropolis-Hastings algorithms
• Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
• Markov-chain monte carlo: Some practical implications of theoretical results
• Title not available (Why is that?)
• Bayesian Inference for Stable Distributions
• A note on acceptance rate criteria for CLTS for Metropolis–Hastings algorithms
• Discussion of ``Equi-energy sampler by Kou, Zhou and Wong

Cited In (2)

• Markov chain Monte Carlo based on deterministic transformations
• Ergodicity of Markov chain Monte Carlo with reversible proposal

This page was built for publication: Multiplicative random walk Metropolis-Hastings on the real line

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