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 条
  • [41] The spectrum of the independent Metropolis-Hastings algorithm
    Gasemyr, Jorund
    JOURNAL OF THEORETICAL PROBABILITY, 2006, 19 (01) : 152 - 165
  • [42] A Metropolis-Hastings Sampling of Subtrees in Graphs
    Eid, Abdelrahman
    Mamitsuka, Hiroshi
    Wicker, Nicolas
    AUSTRIAN JOURNAL OF STATISTICS, 2019, 48 (05) : 17 - 33
  • [43] Convergence rates of Metropolis-Hastings algorithms
    Brown, Austin
    Jones, Galin L.
    WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2024, 16 (05):
  • [44] An adaptive Metropolis-Hastings scheme: Sampling and optimization
    Wolpert, D. H.
    Lee, C. F.
    EUROPHYSICS LETTERS, 2006, 76 (03): : 353 - 359
  • [45] On the optimal scaling of the Modified Metropolis-Hastings algorithm
    Zuev, K. M.
    Beck, J. L.
    Katafygiotis, L. S.
    APPLICATIONS OF STATISTICS AND PROBABILITY IN CIVIL ENGINEERING, 2011, : 2836 - 2843
  • [46] Geometric convergence of the Metropolis-Hastings simulation algorithm
    Holden, L
    STATISTICS & PROBABILITY LETTERS, 1998, 39 (04) : 371 - 377
  • [47] Marginal likelihood from the Metropolis-Hastings output
    Chib, S
    Jeliazkov, I
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2001, 96 (453) : 270 - 281
  • [48] An Efficient Minibatch Acceptance Test for Metropolis-Hastings
    Seita, Daniel
    Pan, Xinlei
    Chen, Haoyu
    Canny, John
    CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE (UAI2017), 2017,
  • [49] Robust Censoring Using Metropolis-Hastings Sampling
    Kail, Georg
    Chepuri, Sundeep Prabhakar
    Leus, Geert
    IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2016, 10 (02) : 270 - 283
  • [50] Quasi-Newton particle Metropolis-Hastings
    Dahlin, Johan
    Lindsten, Fredrik
    Schon, Thomas B.
    IFAC PAPERSONLINE, 2015, 48 (28): : 981 - 986