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 条
  • [31] Non-reversible Metropolis-Hastings
    Joris Bierkens
    Statistics and Computing, 2016, 26 : 1213 - 1228
  • [32] CONVERGENCE OF CONDITIONAL METROPOLIS-HASTINGS SAMPLERS
    Jones, Galin L.
    Roberts, Gareth O.
    Rosenthal, Jeffrey S.
    ADVANCES IN APPLIED PROBABILITY, 2014, 46 (02) : 422 - 445
  • [33] A geometric interpretation of the Metropolis-Hastings algorithm
    Billera, LJ
    Diaconis, P
    STATISTICAL SCIENCE, 2001, 16 (04) : 335 - 339
  • [34] DISTRIBUTED PARTICLE METROPOLIS-HASTINGS SCHEMES
    Martino, Luca
    Elvira, Victor
    Camps-Valls, Gustau
    2018 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2018, : 553 - 557
  • [35] A modified conditional Metropolis-Hastings sampler
    Johnson, Alicia A.
    Flegal, James M.
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2014, 78 : 141 - 152
  • [36] Non-reversible Metropolis-Hastings
    Bierkens, Joris
    STATISTICS AND COMPUTING, 2016, 26 (06) : 1213 - 1228
  • [37] Control variates for the Metropolis-Hastings algorithm
    Hammer, Hugo
    Tjelmeland, Hakon
    SCANDINAVIAN JOURNAL OF STATISTICS, 2008, 35 (03) : 400 - 414
  • [38] A history of the Metropolis-Hastings algorithm - Comment
    Kotz, S
    Johnson, NL
    Read, CB
    Banks, DL
    AMERICAN STATISTICIAN, 2004, 58 (01): : 90 - 90
  • [39] Variance reduction for Metropolis-Hastings samplers
    Alexopoulos, Angelos
    Dellaportas, Petros
    Titsias, Michalis K.
    STATISTICS AND COMPUTING, 2023, 33 (01)
  • [40] Improving on the independent Metropolis-Hastings algorithm
    Atchadé, YF
    Perron, F
    STATISTICA SINICA, 2005, 15 (01) : 3 - 18