Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T14:08:54.588Z Has data issue: false hasContentIssue false

AN IMPROVEMENT OF MARKOVIAN INTEGRATION BY PARTS FORMULA AND APPLICATION TO SENSITIVITY COMPUTATION

Published online by Cambridge University Press:  05 January 2021

Yue Liu
Affiliation:
School of Geography, Nanjing Normal University, Nanjing, Jiangsu, ChinaSchool of Finance and Economics, Jiangsu University, Zhenjiang, Jiangsu, China
Zhiyan Shi
Affiliation:
School of Mathematical Science, Jiangsu University, Zhenjiang, Jiangsu, China E-mail: shizhiyan1984@126.com
Ying Tang
Affiliation:
School of Mathematical Science, Jiangsu University, Zhenjiang, Jiangsu, China E-mail: shizhiyan1984@126.com
Jingjing Yao
Affiliation:
School of Finance and Economics, Jiangsu University, Zhenjiang, Jiangsu, China
Xincheng Zhu
Affiliation:
Department of Computer and Mathematics, Arcadia University, Glenside, Pennsylvania 19038, USASchool of Mathematical Science, Jiangsu University, Zhenjiang, Jiangsu, China
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper establishes a new version of integration by parts formula of Markov chains for sensitivity computation, under much lower restrictions than the existing researches. Our approach is more fundamental and applicable without using Girsanov theorem or Malliavin calculus as did by past papers. Numerically, we apply this formula to compute sensitivity regarding the transition rate matrix and compare with a recent research by an IPA (infinitesimal perturbation analysis) method and other approaches.

Information

Type
Research Article
Copyright
Copyright © The Author(s), 2020. Published by Cambridge University Press