Multiplicative random walk Metropolis-Hastings on the real line

被引:4
|
作者
Dutta S. [1 ]
机构
[1] Department of Statistics, University of Chicago, 5734 S. University Avenue, Chicago
关键词
Primary 65C05, 65C40; Secondary 60J10; Markov chain Monte Carlo; Metropolis-Hastings algorithm; random walk algorithm; Langevin algorithm; multiplicative random walk; geometric ergodicity; thick tailed density; share-price return;
D O I
10.1007/s13571-012-0040-5
中图分类号
学科分类号
摘要
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. One should not confuse RDMH with RWMH. It is shown that they are different, conceptually, mathematically and operationally. The kernel associated with the RDMH algorithm 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 ℝ. 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. © 2013, Indian Statistical Institute.
引用
收藏
页码:315 / 342
页数:27
相关论文
共 50 条
  • [21] Langevin Diffusions and Metropolis-Hastings Algorithms
    G. O. Roberts
    O. Stramer
    Methodology And Computing In Applied Probability, 2002, 4 (4) : 337 - 357
  • [22] A Metropolis-Hastings Algorithm for Task Allocation
    Hamza, Doha
    Toonsi, Sarah
    Shamma, Jeff S.
    2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2021, : 4539 - 4545
  • [23] On a Metropolis-Hastings importance sampling estimator
    Rudolf, Daniel
    Sprungk, Bjoern
    ELECTRONIC JOURNAL OF STATISTICS, 2020, 14 (01): : 857 - 889
  • [24] On the Poisson equation for Metropolis-Hastings chains
    Mijatovic, Aleksandar
    Vogrinc, Jure
    BERNOULLI, 2018, 24 (03) : 2401 - 2428
  • [25] Metropolis-Hastings algorithms with adaptive proposals
    Cai, Bo
    Meyer, Renate
    Perron, Francois
    STATISTICS AND COMPUTING, 2008, 18 (04) : 421 - 433
  • [26] On the geometric ergodicity of Metropolis-Hastings algorithms
    Atchade, Yves F.
    Perron, Francois
    STATISTICS, 2007, 41 (01) : 77 - 84
  • [27] Maximal Couplings of the Metropolis-Hastings Algorithm
    O'Leary, John
    Wang, Guanyang
    Jacob, Pierre E.
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
  • [28] Metropolis-Hastings transition kernel couplings
    O'Leary, John
    Wang, Guanyang
    ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2024, 60 (02): : 1101 - 1124
  • [29] Density estimation for the Metropolis-Hastings algorithm
    Sköld, M
    Roberts, GO
    SCANDINAVIAN JOURNAL OF STATISTICS, 2003, 30 (04) : 699 - 718
  • [30] Metropolis-Hastings Generative Adversarial Networks
    Turner, Ryan
    Hung, Jane
    Frank, Eric
    Saatci, Yunus
    Yosinski, Jason
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97