Strong order 1/2 convergence of full truncation Euler approximations to the Cox–Ingersoll–Ross process
We study convergence properties of the full truncation Euler scheme for the Cox–Ingersoll–Ross process in the regime where the boundary point zero is inaccessible. Under some conditions on the model parameters (precisely, when the Feller ratio is greater than three), we establish the strong order 1/2 convergence in of the scheme to the exact solution. This is consistent with the optimal rate of strong convergence for Euler approximations of stochastic differential equations with globally Lipschitz coefficients, despite the fact that the diffusion coefficient in the Cox–Ingersoll–Ross model is not Lipschitz.
Keywords: Cox–Ingersoll–Ross process, strong convergence order, explicit full truncation Euler scheme
Mathematics Subject Classification (2010): 60H35, 65C05, 65C30
Let be a filtered probability space and let be a 1-dimensional -adapted Brownian motion. A Cox–Ingersoll–Ross (CIR) process is defined by the stochastic differential equation (SDE):
where , , and are strictly positive real numbers. The SDE admits a unique strong solution, which is strictly positive when by the Feller test . The CIR process was originally introduced in finance to model the short-term interest rate . Nowadays, due to its desirable properties, like non-negativity, mean-reversion and analytical tractability, it plays a key role in the field of option pricing, for instance when modeling squared volatilities in the Heston model . For a given , the CIR process has a noncentral chi-squared conditional distribution and its increments can be simulated exactly . However, when pricing financial derivatives written on an underlying process modeled by a -dimensional SDE, with CIR dynamics in one or more components, we need to evaluate
where is the discounted payoff. This expectation is rarely available in closed form, nor can be sampled exactly. In this case, we employ Monte Carlo simulation methods  and approximate the solution to the SDE using a suitable discretization scheme. Due to the non-zero probability of the approximation process becoming negative, the standard Euler–Maruyama scheme applied to (1.1) is not well-defined. Possible remedies are to set the process equal to zero when it turns negative (absorption fix), e.g., the full truncation Euler (FTE) scheme studied in this paper, or reflect it in the origin (reflection fix). An overview of the explicit Euler schemes with different fixes at the boundary can be found in . Alternatively, we can use an implicit Euler or a Milstein scheme to discretize the CIR process.
Weak convergence is important when estimating expectations of payoffs such as the one in (1.2). However, strong convergence plays a crucial role in multilevel Monte Carlo methods [12, 13, 25] and may be required for some complex path-dependent derivatives. Furthermore, pathwise convergence follows automatically .
The classical convergence theory [20, 27] does not apply to the CIR process because the square-root diffusion coefficient is not Lipschitz. Consequently, a considerable amount of research has been devoted to the numerical approximation of (1.1) and alternative approaches have been employed to prove the strong convergence of various discretizations for the CIR process.
Results in the literature concerned with positive strong convergence rates for numerical approximations of the CIR process were restricted to the regime where the boundary point is inaccessible until just recently. Strong convergence, at best with a logarithmic rate, of different Euler schemes including the partial truncation, the full truncation, the reflection and the symmetrized Euler schemes was established in [1, 10, 15, 19, 28]. The first non-logarithmic rate was obtained in , where it was shown that the symmetrized Euler scheme converges strongly with the standard order 1/2 to the exact solution, although in a very restricted parameter regime. Strong convergence with order 1/2 of the backward (drift-implicit) Euler–Maruyama (BEM) scheme was later established in , and this rate was improved to 1 in [2, 30]. Recently,  proved the strong convergence with order 1 of the symmetrized Milstein scheme under some restrictive conditions on the parameters, whereas  proved the strong convergence of a modified Euler–Maruyama scheme with an order between 1/6 and 1 that depends on the parameters.
In the last few years, there has been some development in the accessible boundary case and polynomial rates of strong convergence for an order of up to 1/2 were established in  and  for the truncated Milstein scheme and the BEM scheme, respectively.
In this paper, we study the full truncation Euler scheme proposed in . This scheme preserves the positivity of the original process, is easy to implement and hence arguably the most widely used scheme in practice. Perhaps most importantly, it is found empirically to produce the smallest bias of all explicit Euler schemes with different fixes at the boundary . Consider a uniform grid
We introduce the discrete-time auxiliary process
where and , its continuous-time interpolation
as well as the non-negative process
whenever . The convergence in of this scheme was proved in . The convergence rate, however, remained an open question and our Theorem 1.1 is the first result to address it, to the best of our knowledge. For convenience, define the Feller ratio
We establish the strong convergence in with order 1/2 of the scheme in the inaccessible boundary case, specifically, for a Feller ratio above three. Hence, we obtain the optimal strong convergence rate for the numerical approximation of SDEs with globally Lipschitz coefficients [21, 29]. The main and novel idea of the proof is to weight the difference between the process and its approximation by the former raised to a suitably chosen negative power and prove the strong convergence with a rate of the weighted error. This, in turn, allows us to derive an upper bound for the actual error.
Suppose that and let . Then the FTE scheme converges strongly in with order 1/2, i.e., there exist and a constant such that, for all ,
We mention that the assumption on the Feller ratio from Theorem 1.1, i.e., , appears in the literature as a sufficient condition for the strong convergence with a rate of several discretization schemes for the CIR process. For example, this condition ensures in Corollary 4.1 in  the strong convergence with order 1/2 (and order 1 if ) of the modified Euler–Maruyama scheme, and in Proposition 3.1 in  the strong convergence with order 1 of the BEM scheme.
In , a lower error bound was recently derived for all discretization schemes for the CIR process based on equidistant evaluations of the Brownian driver in the regime where the boundary point is accessible. In light of this result, we demonstrate numerically that the FTE scheme achieves an optimal performance – in the sense – in half of the regime where the boundary point is accessible, where by optimal we mean that the empirical convergence rate is the best possible for equidistant discretization schemes for the CIR process.
2 Convergence analysis
We need to control the polynomial moments of the CIR process and its FTE discretization.
The CIR process has bounded moments, i.e.,
The FTE scheme has uniformly bounded moments, i.e.,
Follows from a simple application of the Burkholder–Davis–Gundy (BDG) inequality and Proposition 3.7 in . ∎
By construction, the FTE approximation is non-negative. However, an important step in the convergence analysis lies in analyzing the behaviour of the auxiliary process at the boundary. The next result derives a polynomial upper bound in the time step size on the probability of becoming negative. Similar results were established for the symmetrized Euler scheme, in Lemma 3.7 in , and for the symmetrized Milstein scheme, in Lemma 2.2 in . However, the full truncation Euler scheme has led to different technical challenges and the arguments employed in the proofs of the aforementioned results do not apply here.
Suppose that and let
Then there exist and a constant such that, for all ,
We first show that exists and derive bounds which imply that the exponent in (2.4) is negative. Note that as the value of increases, the left-hand side term of the inequality in (2.3) decreases and the right-hand side term increases. Hence, decreases as increases. In particular, .
Suppose that and fix . Define, for brevity,
First, consider the sequence given by
As , one can clearly see that for all . We will show by induction that
and some simple computations lead to the following sufficient condition for the induction step,
which clearly holds. For convenience, define another sequence given by
a bound which will be of use later in the proof. Using (2.7), we get
Let for the rest of the proof. Since , the Hurwitz (generalized Riemann) zeta function
converges and hence, for large enough, we have
which implies that
However, for large enough, we have
and the upper bound on in (2.14) follows.
Second, recall from (1.4) that, for all ,
and note that
Let be the natural filtration generated by and consider the shorthand notations and for the conditional expectation and probability. Conditioning on , we get
where and independent of . Using a standard inequality for the lower tail of the normal distribution, namely
and the arithmetic mean-geometric mean (AM-GM) inequality, we deduce that
where if and otherwise. Let , then
Denote as before and let be the inner expectation on the right-hand side of (2), i.e.,
where independent of . There are two possible outcomes, namely , in which case , and , which is treated now:
and is the standard normal CDF. We deduce from (2.13) that
and hence that
Taking in (2) and since , we obtain
Using (2.7) yields
However, for all , we have that such that , and hence
for all . ∎
Next, we bound the difference between the two continuous-time approximations and .
Suppose that and let . Then there exist and a constant such that, for all ,
Let . For convenience of notation, define
where for all . From the triangle inequality, we have
and hence, using Hölder’s inequality, we get
We can bound the last term on the right-hand side from above as follows,
Before we prove the main result of this paper, we need the following technical auxiliary result.
Suppose that . Then we can find such that
since spans the interval of values associated with (2.47) for
Furthermore, one can easily check that
which implies that
Let and define the right-hand side function
Hence, we deduce that
which concludes the proof. ∎
With these results at our disposal, we are now ready to prove the main theorem.
Since , the CIR process has almost surely strictly positive paths. Applying Itô’s formula to the function yields
where if and otherwise, and hence
we deduce that