INTERPOLATED DRIFT IMPLICIT EULER MLMC METHOD FOR BARRIER OPTION PRICING AND APPLICATION TO CIR AND CEV MODELS MOUNA BEN DEROUICH AND AHMED KEBAIER

2025-05-05 0 0 962.03KB 32 页 10玖币
侵权投诉
INTERPOLATED DRIFT IMPLICIT EULER MLMC METHOD FOR BARRIER
OPTION PRICING AND APPLICATION TO CIR AND CEV MODELS
MOUNA BEN DEROUICH AND AHMED KEBAIER
Abstract. Recently, Giles et al. [14] proved that the efficiency of the Multilevel Monte Carlo
(MLMC) method for evaluating Down-and-Out barrier options for a diffusion process (Xt)t[0,T ]
with globally Lipschitz coefficients, can be improved by combining a Brownian bridge technique and
a conditional Monte Carlo method provided that the running minimum inft[0,T ]Xthas a bounded
density in the vicinity of the barrier. In the present work, thanks to the Lamperti transformation
technique and using a Brownian interpolation of the drift implicit Euler scheme of Alfonsi [2], we
show that the efficiency of the MLMC can be also improved for the evaluation of barrier options for
models with non-Lipschitz diffusion coefficients under certain moment constraints. We study two
example models: the Cox-Ingersoll-Ross (CIR) and the Constant of Elasticity of Variance (CEV)
processes for which we show that the conditions of our theoretical framework are satisfied under
certain restrictions on the models parameters. In particular, we develop semi-explicit formulas for
the densities of the running minimum and running maximum of both CIR and CEV processes which
are of independent interest. Finally, numerical tests are processed to illustrate our results.
1. Introduction
Barrier options are one of the most widely traded exotic options in the financial markets. Pricing
and hedging such path-dependent option can quickly become very challenging especially when we
need to achieve a good precision for the approximation. Evaluating barrier options by a classic
Monte Carlo method introduces a systematic bias when approximating the continuous running
maximum (resp. minimum) in the crossing-barrier indicator by a discrete running maximum (resp.
minimum). To overcome this difficulty, several numerical strategies exist in the literature among
them the popular Brownian bridge technique introduced in [3] well known for its efficiency and ease of
use (see also [16] for related refinements). The Brownian bridge technic uses an analytic expression
for the probability of hitting the barrier between two known values in a simulated path of the
underlying asset. More recently, a combination of the Multilevel Monte Carlo (MLMC) method with
the Brownian bridge technique has been developed in [14] for pricing barrier options. The Multilevel
Monte Carlo method introduced in Giles [12] as an extension of the two-level Monte Carlo method of
[20], significantly reduces the time complexity of the classical Monte Carlo method. More precisely,
for a given precision ε > 0and a Lipschitz payoff function, if the underlying asset (Xt)t[0,T ]is
approximated using a discretization scheme (¯
Xt)t[0,T ]with time step h > 0satisfying E|Xt¯
Xt|2=
O(hβ)and |E[Xt¯
Xt]|=O(hα)with α1
2, then the time complexity of the MLMC methods is:
O(ε2)when β > 1,O(ε2(log ε)2)when β= 1 and O(ε21β
α)when β(0,1). However, for
the same precision ε > 0the optimal time complexity of a classic Monte Carlo method is O(ε3).
As the payoff function of a barrier option is not Lipschitz, Giles et al. [14] take advantage of the
Brownian bridge to run the MLMC method for pricing such options, since this technique substitutes
Date: September 17, 2024.
2010 Mathematics Subject Classification. 60H10, 60H35, 65C05, 65C30, 33C15, 41A60.
Key words and phrases. Multilevel Monte Carlo, Stochastic differential equations with singular diffusion coeffi-
cients, drift implicit Euler scheme, Lamperti transformation, Confluent hypergeometric functions, Asymptotic ap-
proximations, Computational finance.
1
arXiv:2210.00779v2 [math.PR] 16 Sep 2024
the barrier-crossing indicators by the probabilities that the approximation scheme (¯
Xt)t[0,T ]hits
the barrier between each two consecutive discretization times tiand ti+1 and which are represented
as smooth functions of the realized points ¯
Xtiand ¯
Xti+1 . More precisely, Giles et al. [14] consider an
underlying asset solution to a one-dimensional stochastic differential equation (SDE) with globally
Lipschitz smooth coefficients that is approximated by a high order strong approximation scheme
namely the Milstein scheme (¯
XMilstein
t)t[0,T ]that satisfies E|Xt¯
XMilstein
t|2=O(h2). For this case,
they prove that the MLMC method reaches its optimal time complexity O(ε2)for pricing a Down-
and-Out barrier option 1provided that inft[0,T ]Xthas a bounded density in the neighborhood
of the barrier. This latter condition cannot be easily checked even when the SDE coefficients are
Lipschitz except for very specific cases.
In the current paper, we are interested in studying the MLMC method for pricing barrier options
when the underlying asset is solution to a SDE with a non-Lipschitz diffusion coefficient such as
the popular Cox-Ingersoll-Ross (CIR) and the Constant of Elasticity of Variance (CEV) processes.
Only few works exist in the literature that studied the problem of pricing path-dependent options
under such singular models (see e.g. [8]). To analyze the performance of the MLMC method, we
consider in Section 2a general framework of models with non-Lipschitz diffusion coefficients and
use a Lamperti transformation to focus our study on a new process (Yt)t[0,T ]with an additive
noise diffusion but in counterpart with a possibly singular drift coefficient L. Then, we introduce
a Brownian interpolation scheme (¯
Yt)t[0,T ]associated to the drift implicit Euler scheme of Alfonsi
[2] for which we prove a strong convergence result with order one (see Theorem 2.1). In Section 3,
we use the Brownian bridge technic that substitutes the crossing-indicators with smooth functions
of realized points in the path of the scheme (¯
Yt)t[0,T ]to build the corresponding MLMC estimator.
Next, under suitable assumptions on the drift L, we prove that the obtained MLMC method for
pricing Down-and-Out (resp. Up-and-Out) reaches its optimal time complexity O(ε2)provided
that inft[0,T ]Yt(resp. supt[0,T ]Yt) has a bounded density in the neighborhood of the barrier (see
Theorem 3.3 and Remark 3.4). In Sections 4and 5, we provide two examples of processes satisfying
Theorem 3.3 conditions, namely the CIR and the CEV models. It turns out that under additional
constraints on the parameters of these two models ensuring the existence of finite negative moments
up to a certain order, the MLMC method behaves exactly like a classical unbiased Monte Carlo
estimator despite the use of approximation schemes. To show that the conditions of our theoretical
framework are satisfied for these two models, we develop using fine asymptotic properties of confluent
hypergeometric type functions, semi-explicit formulas for the densities of the running minimum and
running maximum of both CIR and CEV processes which are of independent interest (see Theorems
4.1,4.2,5.2 and 5.3). Finally, we proceed to several numerical tests illustrating our results.
2. General framework
Let us consider a process (Xt)t[0,T ]solution to
dXt=b(Xt)dt +σ(Xt)dWt, X0=x, (1)
where (Wt)t0is a standard Brownian motion, b:RRand σ:RR
+are locally Lipschitz-
functions such that 1
σis locally integrable. For ϕ(y) = Ry
y0
1
σ(x)dx, if σ∈ C1then by the Lamperti
transform Yt=ϕ(Xt)solves the stochastic differential equation
dYt=L(Xt)dt +dWt, Y0=ϕ(x),
1A Down-and-Out barrier Call (resp. Put) is the option to buy (resp. sell), at maturity T, the underlying with a
fixed strike if the underlying value never falls below the barrier before time T.
2
with L(x) = b
σσ
2(ϕ1(x)). In this work, we are interested in approximating barrier option
prices such as the Down-and-Out (D-O) and the Up-and-Out (U-O) barrier options
πBD=Ehf(XT){inft[0,T ]Xt>BD}iand πBU=Ehf(XT){supt[0,T ]Xt<BU}i.
The other types of barrier options such as the Down-and-In and the Up-and-In can be easily deduced
from the price of the vanilla option E[f(XT)]. As the function ϕis monotonic, by the Lamperti
transformation we reduce ourselves to a pricing problem with the process (Yt)t[0,T ]. More precisely,
we get πBD=πDand πBU=πUwhere
πD=Ehg(YT){inft[0,T ]Yt>D}i, πU=Ehg(YT){supt[0,T ]Yt<U}i,
g(x) = fϕ1(x),D=ϕ(BD)and U=ϕ(BU). In the sequel, we consider the general setting given
in [2] and let (Yt)t0denote the SDE defined on I= (0,+)solution to
dYt=L(Yt)dt +γdWt, t 0, Y0=yI, with γR,(2)
where the drift coefficient Lis supposed to satisfy the following monotonicity assumption:
L:IRis C2,such that κ > 0,y, yI, y y, L(y)L(y)κ(yy).(3)
In addition, for an arbitrary point dI, we assume that
v(x) = Zx
dZy
d
exp 2
γ2Zy
z
L(ξ)dzdy satisfies lim
x0+v(x) = +.(H1)
On the one hand, by the Feller’s test (see e.g. [19]), (3) and (H1) ensure that the SDE (2) admits
a unique strong solution (Yt)t0on Ithat never reaches the boundaries 0and +. On the other
hand, under these two conditions the below drift implicit continuous scheme introduced in [2],
b
Yn
t=b
Yn
ti+L(b
Yn
t)(tti) + γ(WtWti),with t(ti, ti+1], ti=iT
n,0in1,(4)
b
Yn
0=y.
is well defined and for all t[0, T ],Yn
tI. Besides, if in addition we assume that for p1, we
have
EhZT
0|L(Yu)L(Yu) + γ2
2L′′(Yu)|dupi<and EhZT
0
(L(Yu))2dup
2i<,(H2)
then by [2], there exists a positive constant Kpsuch that
E1
p"sup
t[0,T ]|b
Yn
tYt|p#Kp
T
n.
For our purpose, we rather focus on a slightly different interpolated version of the drift implicit
scheme. More precisely, we first introduce the discrete version of the drift implicit scheme given by
Yn
ti+1 =Yn
ti+L(Yn
ti+1 )T
n+γ(Wti+1 Wti),with ti=iT
n,0in1,
Yn
0=y.
(5)
and introduce the following interpolated drift implicit scheme
Yn
t=Yn
ti+L(Yn
ti+1 )(tti) + γ(WtWti),for t[ti, ti+1[,0in1.(6)
The main advantages of this Brownian interpolation is that it preserves the rate of strong conver-
gence of the original drift implicit scheme (4) and allows at the same time the use of the Brownian
3
bridge technique for pricing Barrier options (see Section 3.1 below). In what follows, we strengthen
our assumption on the drift coefficient Las follows:
L:IRis C2such that: Lis decreasing on (0, A)for A > 0,
and Lthe first derivative of Lsatisfies L
A>0s.t. y(A, ),|L(y)| ≤ L
A.(H3)
Theorem 2.1. Assume that conditions (H2)and (H3)hold true for a given p > 1and with
L
A<n
2T. Then, there exists a constant Kp>0such that
E1
phsup
t[0,T ]|Yn
tYt|piKp
T
n.
Proof. At first, for p1and t[0, T ], we denote et=Yn
tYt. By (2), we have for 0in1,
eti+1 =eti+L(Yn
ti+1 )(ti+1 ti)Zti+1
ti
L(Ys)ds
since for all 0in1,Yn
tiI. As Lis of class C2there exists a point ξti+1 lying between
Yti+1 and Yn
ti+1 such that L(Yn
ti+1 )L(Yti+1 ) = βti+1 (Yn
ti+1 Yti+1 )with βti+1 =Lξti+1 . Besides,
according to the proof [2, Proposition 3], we know that
Ehsup
1in|eti|piKT
npEhZT
0|L(Yu)L(Yu) + γ2
2L′′(Yu)|dupi
+|γ|pEhZT
0
(L(Yu))2dup
2i,(7)
where Kis a positive constant that depends on Tand p. On the one hand, we first use (6) to write
eti+1 =eti+L(Yn
ti+1 )(ti+1 ti)Zti+1
ti
L(Ys)ds
=eti+hL(Yn
ti+1 )L(Yti+1 )i(ti+1 ti) + Zti+1
tiL(Yti+1 )L(Ys)ds
=eti+βti+1 eti+1 (ti+1 ti) + Zti+1
tiL(Yti+1 )L(Ys)ds.
It follows that
1βti+1 (ti+1 ti)eti+1 =eti+Zti+1
tiL(Yti+1 )L(Ys)ds. (8)
On the other hand, we have for all t[ti, ti+1)
Yn
t=Yn
ti+L(Yn
ti+1 )(tti) + γ(WtWti)
=Yn
ti+L(Yn
ti+1 )(ti+1 ti) + γ(Wti+1 Wti)L(Yn
ti+1 )(ti+1 t)γ(Wti+1 Wt)
=Yn
ti+1 L(Yn
ti+1 )(ti+1 t)γ(Wti+1 Wt).
Then, it follows that for all t[ti, ti+1)
Yn
tYt=Yn
ti+1 Yti+1 +Yti+1 YtL(Yn
ti+1 )(ti+1 t)γ(Wti+1 Wt)
et=eti+1 +Zti+1
t
L(Ys)ds +γ(Wti+1 Wt)L(Yn
ti+1 )(ti+1 t)γ(Wti+1 Wt)
4
=eti+1 L(Yn
ti+1 )L(Yti+1 )(ti+1 t) + Zti+1
t
L(Ys)L(Yti+1 )ds
=eti+1 βti+1 (Yn
ti+1 Yti+1 )(ti+1 t) + Zti+1
t
L(Ys)L(Yti+1 )ds.
So, we deduce that for all t[ti, ti+1)
et= (1 βti+1 (ti+1 t))eti+1 +Zti+1
t
L(Ys)L(Yti+1 )ds. (9)
By assumption (H3), on (0, A)Lis decreasing, so it is easy to see that 1<1βti+1 (ti+1 t)<
1βti+1 (ti+1 ti). On (A, ), as Lis bounded and since n > 2L
AT, we have |1βti+1 (ti+1 t)| ≤ 3
2
and 1βti+1 (ti+1 ti)>1
2. Then, it follows that 1βti+1 (ti+1t)
1βti+1 (ti+1ti)3.Now, combining (8) and
(9) we easily get
et=1βti+1 (ti+1 t)
1βti+1 (ti+1 ti)eti+Zti+1
tiL(Yti+1 )L(Ys)ds+Zti+1
t
L(Ys)L(Yti+1 )ds. (10)
Then, by Itô’s formula and Fubini theorem we get
|et| ≤ 3|eti|+Zti+1
tiL(Yti+1 )L(Ys)ds+Zti+1
t
L(Ys)L(Yti+1 )ds
3|eti|+T
nZti+1
tiL(Yu)L(Yu) + γ2
2L′′(Yu)du +|γ|Zti+1
ti
(uti)L(Yu)dWu
+T
nZti+1
tL(Yu)L(Yu) + γ2
2L′′(Yu)du +|γ|Zti+1
t
(ut)L(Yu)dWu.
Therefore, there exists a positive constant Cpsuch that
|et|pCp"|eti|p+ 2T
npZti+1
tiL(Yu)L(Yu) + γ2
2L′′(Yu)dup+|γ|pZti+1
ti
(uti)L(Yu)dWup
+|γ|pZti+1
t
uL(Yu)dWup+|γ|pTpZti+1
t
L(Yu)dWup#
and thus,
sup
t[0,T ]|et|pCp"sup
0in|eti|p+ 2T
npZT
0L(Yu)L(Yu) + γ2
2L′′(Yu)dup
+|γ|psup
0stTZt
s
(utη(u))L(Yu)dWup+|γ|psup
0stTZt
s
uL(Yu)dWup
+|γ|pTpsup
0stTZt
s
L(Yu)dWup#
Cp"sup
0in|eti|p+ 2T
npZT
0L(Yu)L(Yu) + γ2
2L′′(Yu)dup
+ 2p1|γ|psup
0tTZt
0
(utη(u))L(Yu)dWup+ 2p1|γ|psup
0tTZt
0
uL(Yu)dWup
+ 2p1|γ|pTpsup
0tTZt
0
L(Yu)dWup#.
5
摘要:

INTERPOLATEDDRIFTIMPLICITEULERMLMCMETHODFORBARRIEROPTIONPRICINGANDAPPLICATIONTOCIRANDCEVMODELSMOUNABENDEROUICHANDAHMEDKEBAIERAbstract.Recently,Gilesetal.[14]provedthattheefficiencyoftheMultilevelMonteCarlo(MLMC)methodforevaluatingDown-and-Outbarrieroptionsforadiffusionprocess(Xt)t∈[0,T]withgloballyL...

展开>> 收起<<
INTERPOLATED DRIFT IMPLICIT EULER MLMC METHOD FOR BARRIER OPTION PRICING AND APPLICATION TO CIR AND CEV MODELS MOUNA BEN DEROUICH AND AHMED KEBAIER.pdf

共32页,预览5页

还剩页未读, 继续阅读

声明:本站为文档C2C交易模式,即用户上传的文档直接被用户下载,本站只是中间服务平台,本站所有文档下载所得的收益归上传人(含作者)所有。玖贝云文库仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。若文档所含内容侵犯了您的版权或隐私,请立即通知玖贝云文库,我们立即给予删除!
分类:图书资源 价格:10玖币 属性:32 页 大小:962.03KB 格式:PDF 时间:2025-05-05

开通VIP享超值会员特权

  • 多端同步记录
  • 高速下载文档
  • 免费文档工具
  • 分享文档赚钱
  • 每日登录抽奖
  • 优质衍生服务
/ 32
客服
关注