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 条
  • [1] Accelerating adaptation in the adaptive Metropolis-Hastings random walk algorithm
    Spencer, Simon E. F.
    AUSTRALIAN & NEW ZEALAND JOURNAL OF STATISTICS, 2021, 63 (03) : 468 - 484
  • [2] Metropolis-Hastings Random Walk with a Reduced Number of Self-Loops
    Matsumura, Toshiki
    Shudo, Kazuyuki
    2019 IEEE INTL CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, BIG DATA & CLOUD COMPUTING, SUSTAINABLE COMPUTING & COMMUNICATIONS, SOCIAL COMPUTING & NETWORKING (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2019), 2019, : 1556 - 1563
  • [3] Metropolis-Hastings Random Walk along the Gradient Descent Direction for MIMO Detection
    Gowda, Niranjan M.
    Krishnamurthy, Sundar
    Belogolovy, Andrey
    IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021), 2021,
  • [4] Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm
    Lemieux, Jessica
    Heim, Bettina
    Poulin, David
    Svore, Krysta
    Troyer, Matthias
    QUANTUM, 2020, 4
  • [5] Spiraling Facebook: an alternative Metropolis-Hastings random walk using a spiral proposal distribution
    Pina-Garcia, C. A.
    Gu, Dongbing
    SOCIAL NETWORK ANALYSIS AND MINING, 2013, 3 (04) : 1403 - 1415
  • [6] Metropolis-Hastings via Classification
    Kaji, Tetsuya
    Rockova, Veronika
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2023, 118 (544) : 2533 - 2547
  • [7] Kernel Adaptive Metropolis-Hastings
    Sejdinovic, Dino
    Strathmann, Heiko
    Garcia, Maria Lomeli
    Andrieu, Christophe
    Gretton, Arthur
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 32 (CYCLE 2), 2014, 32 : 1665 - 1673
  • [8] On adaptive Metropolis-Hastings methods
    Griffin, Jim E.
    Walker, Stephen G.
    STATISTICS AND COMPUTING, 2013, 23 (01) : 123 - 134
  • [9] Estimating Clustering Coefficients via Metropolis-Hastings Random Walk and Wedge Sampling on Large OSN Graphs
    Cem, Emrah
    Sarac, Kamil
    2016 IEEE 35TH INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC), 2016,
  • [10] The Implicit Metropolis-Hastings Algorithm
    Neklyudov, Kirill
    Egorov, Evgenii
    Vetrov, Dmitry
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32