2021
DOI: 10.1017/apr.2020.65
|View full text |Cite
|
Sign up to set email alerts
|

Markov chain approximation of one-dimensional sticky diffusions

Abstract: We develop a continuous-time Markov chain (CTMC) approximation of one-dimensional diffusions with sticky boundary or interior points. Approximate solutions to the action of the Feynman–Kac operator associated with a sticky diffusion and first passage probabilities are obtained using matrix exponentials. We show how to compute matrix exponentials efficiently and prove that a carefully designed scheme achieves second-order convergence. We also propose a scheme based on CTMC approximation for the simulation of st… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 15 publications
(3 citation statements)
references
References 42 publications
(5 reference statements)
0
3
0
Order By: Relevance
“…(2) e Bayesian networks Bayesian Networks (BNs) are topological structures composed of a directed acyclic graph and related probability distribution functions, representing the joint probability distribution of n random variables [15], which is composed of two parts, BNs � ( G, θ). G stands for a directed acyclic graph, whose nodes are random variables X 1 , X 2 , .…”
Section: Eoretical Preparation (1) Bayesian Networkmentioning
confidence: 99%
“…(2) e Bayesian networks Bayesian Networks (BNs) are topological structures composed of a directed acyclic graph and related probability distribution functions, representing the joint probability distribution of n random variables [15], which is composed of two parts, BNs � ( G, θ). G stands for a directed acyclic graph, whose nodes are random variables X 1 , X 2 , .…”
Section: Eoretical Preparation (1) Bayesian Networkmentioning
confidence: 99%
“…(n) t is a birth-and-death process, Li and Zhang (2016) propose an algorithm based on efficient matrix eigendecomposition which reduces the time complexity to O(n 2 y ). Another very efficient algorithm for matrix exponentials can be found in Meier et al (2021).…”
Section: Ctmc Approximation For the First Passage Problemmentioning
confidence: 99%
“…CTMC approximation has become a popular method for solving various option pricing problems under Markov models in recent years. See Mijatović and Pistorius (2013) and Cui and Taylor (2021) for barrier options, Eriksson and Pistorius (2015) for American options, Cai et al (2015), Song et al (2018) and for Asian options, Zhang and Li (2021c) for maximum drawdown options, Zhang et al (2021) for American drawdown options, Zhang and Li (2021b) for Parisian options, and Meier et al (2021) for option pricing under financial models with sticky behavior. In all these papers, the original Markov model is approximated by a CTMC, and then the option price under the CTMC model is derived.…”
Section: Introductionmentioning
confidence: 99%