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] Control variates for the Metropolis-Hastings algorithm
    Hammer, Hugo
    Tjelmeland, Hakon
    SCANDINAVIAN JOURNAL OF STATISTICS, 2008, 35 (03) : 400 - 414
  • [22] Non-reversible Metropolis-Hastings
    Bierkens, Joris
    STATISTICS AND COMPUTING, 2016, 26 (06) : 1213 - 1228
  • [23] An Enhanced Metropolis-Hastings Algorithm Based on Gaussian Processes
    Chowdhury, Asif
    Terejanu, Gabriel
    MODEL VALIDATION AND UNCERTAINTY QUANTIFICATION, VOL 3, 2016, : 227 - 233
  • [24] Two-Stage Metropolis-Hastings for Tall Data
    Richard D. Payne
    Bani K. Mallick
    Journal of Classification, 2018, 35 : 29 - 51
  • [25] Variance reduction for Metropolis-Hastings samplers
    Alexopoulos, Angelos
    Dellaportas, Petros
    Titsias, Michalis K.
    STATISTICS AND COMPUTING, 2023, 33 (01)
  • [26] Improving on the independent Metropolis-Hastings algorithm
    Atchadé, YF
    Perron, F
    STATISTICA SINICA, 2005, 15 (01) : 3 - 18
  • [27] The spectrum of the independent Metropolis-Hastings algorithm
    Gasemyr, Jorund
    JOURNAL OF THEORETICAL PROBABILITY, 2006, 19 (01) : 152 - 165
  • [28] A Metropolis-Hastings Sampling of Subtrees in Graphs
    Eid, Abdelrahman
    Mamitsuka, Hiroshi
    Wicker, Nicolas
    AUSTRIAN JOURNAL OF STATISTICS, 2019, 48 (05) : 17 - 33
  • [29] Two-Stage Metropolis-Hastings for Tall Data
    Payne, Richard D.
    Mallick, Bani K.
    JOURNAL OF CLASSIFICATION, 2018, 35 (01) : 29 - 51
  • [30] Marginal likelihood from the Metropolis-Hastings output
    Chib, S
    Jeliazkov, I
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2001, 96 (453) : 270 - 281