Simulation of multidimensional diffusions with sticky boundaries via Markov chain approximation

被引:6
|
作者
Meier, Christian [1 ]
Li, Lingfei [1 ]
Zhang, Gongqiu [2 ]
机构
[1] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Hong Kong, Peoples R China
[2] Chinese Univ Hong Kong, Sch Sci & Engn, Shenzhen, Peoples R China
基金
中国国家自然科学基金;
关键词
Applied probability; Multidimensional diffusions; Sticky boundary; Markov chain approximation; Monte Carlo simulation; PRICING ASIAN OPTIONS; GENERAL FRAMEWORK; LOCAL TIME; WEAK APPROXIMATION; VOLATILITY MODELS; BROWNIAN-MOTION; EULER SCHEME; EQUATIONS; ZERO; PARTICLES;
D O I
10.1016/j.ejor.2022.07.038
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this study, we develop a novel method to simulate multidimensional diffusions with sticky boundaries for which the Euler scheme fails. We approximate the sticky diffusion process by a multidimensional continuous-time Markov chain (CTMC) that can be easily simulated. We provide two approaches to con-struct the CTMC. In the first approach, we approximate the infinitesimal generator of the sticky diffusion by finite difference using standard coordinate directions. In the second one, we match the local moments using the drift and the eigenvectors of the covariance matrix as transition directions. The first approach does not always guarantee a valid Markov chain, whereas the second one can. We show that both con-struction methods yield a first-order simulation scheme, which can capture the sticky behavior and is free from the curse of dimensionality. As applications, we use our method to simulate the limit of a queuing system with exceptional service policy and a multi-factor short rate model for low interest rate environment. (c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码:1292 / 1308
页数:17
相关论文
共 50 条
  • [21] Unbiased approximation of posteriors via coupled particle Markov chain Monte Carlo
    Willem van den Boom
    Ajay Jasra
    Maria De Iorio
    Alexandros Beskos
    Johan G. Eriksson
    [J]. Statistics and Computing, 2022, 32
  • [22] Unbiased approximation of posteriors via coupled particle Markov chain Monte Carlo
    van den Boom, Willem
    Jasra, Ajay
    De Iorio, Maria
    Beskos, Alexandros
    Eriksson, Johan G.
    [J]. STATISTICS AND COMPUTING, 2022, 32 (03)
  • [23] A Markov Chain Approximation to Choice Modeling
    Blanchet, Jose
    Gallego, Guillermo
    Goyal, Vineet
    [J]. OPERATIONS RESEARCH, 2016, 64 (04) : 886 - 905
  • [24] On the approximation of one Markov chain by another
    Jerrum, M
    [J]. PROBABILITY THEORY AND RELATED FIELDS, 2006, 135 (01) : 1 - 14
  • [25] On the approximation of one Markov chain by another
    Mark Jerrum
    [J]. Probability Theory and Related Fields, 2006, 135 : 1 - 14
  • [26] Irreducible Markov chain Monte Carlo schemes for partially observed diffusions
    Kalogeropoulos, Konstantinos
    Roberts, Gareth
    Dellaportas, Petros
    [J]. NSSPW: NONLINEAR STATISTICAL SIGNAL PROCESSING WORKSHOP: CLASSICAL, UNSCENTED AND PARTICLE FILTERING METHODS, 2006, : 216 - +
  • [27] On the optimal Markov chain of IS simulation
    Nakagawa, K
    [J]. 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 415 - 415
  • [28] On the optimal Markov chain of IS simulation
    Nakagawa, K
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (01) : 442 - 446
  • [29] Dynamic System Evolution and Markov Chain Approximation
    Melnik, Roderick V. Nicholas
    [J]. DISCRETE DYNAMICS IN NATURE AND SOCIETY, 1998, 2 (01) : 7 - 39
  • [30] MARKOV CHAIN APPROXIMATION OF RAYELEIGH FADING CHANNEL
    Dehnie, Sintayehu
    [J]. ICSPC: 2007 IEEE INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2007, : 1311 - 1314