
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)t≥0is a standard Brownian motion, b:R→Rand σ:R→R∗
+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