Approximating exit times of continuous Markov processes
Thomas Kruse, Mikhail Urusov

TL;DR
This paper establishes a functional limit theorem for approximating the exit times of one-dimensional continuous strong Markov processes, demonstrating the effectiveness of the EMCEL scheme and other schemes in capturing boundary hitting times even with irregular behaviors.
Contribution
It provides a stronger convergence theorem for both paths and exit times of Markov processes, extending previous results and verifying the applicability of the EMCEL and weak Euler schemes.
Findings
EMCEL scheme satisfies the theorem's assumptions for approximating exit times.
Weak Euler scheme can approximate absorption times of CEV diffusion.
Scale-transformed weak Euler scheme approximates hitting zero for squared Bessel process.
Abstract
The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of approximations of the process. We prove a functional limit theorem for approximating weakly both the paths of the Markov process and its exit times. In contrast to the functional limit theorem in [arXiv:1902.06249v1] for approximating the paths, we impose a stronger assumption here. This is essential, as we present an example showing that the theorem extended with the convergence of the exit times does not hold under the assumption in [arXiv:1902.06249v1]. However, the EMCEL scheme introduced in [arXiv:1902.06249v1] satisfies the assumption of our theorem, and hence we have a scheme capable of approximating both the process and its exit times for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Approximating exit times of continuous Markov processes
Thomas Kruse Thomas Kruse, Institute of Mathematics, University of Gießen, Arndtstr. 2, 35392 Gießen, Germany. Email: [email protected], Phone: +49 (0)641 9932043.
Mikhail Urusov Mikhail Urusov, Faculty of Mathematics, University of Duisburg-Essen, Thea-Leymann-Str. 9, 45127 Essen, Germany. Email: [email protected], Phone: +49 (0)201 1837428.
Abstract
The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of approximations of the process. We prove a functional limit theorem for approximating weakly both the paths of the Markov process and its exit times. In contrast to the functional limit theorem in [3] for approximating the paths, we impose a stronger assumption here. This is essential, as we present an example showing that the theorem extended with the convergence of the exit times does not hold under the assumption in [3]. However, the EMCEL scheme introduced in [3] satisfies the assumption of our theorem, and hence we have a scheme capable of approximating both the process and its exit times for every one-dimensional continuous strong Markov process, even with irregular behavior (e.g., a solution of an SDE with irregular coefficients or a Markov process with sticky features). Moreover, our main result can be used to check for some other schemes whether the exit times converge. As an application we verify that the weak Euler scheme is capable of approximating the absorption time of the CEV diffusion and that the scale-transformed weak Euler scheme for a squared Bessel process is capable of approximating the time when the squared Bessel process hits zero.
Keywords: one-dimensional Markov process; speed measure; absorption time; exit time; Markov chain approximation; numerical scheme; functional limit theorem.
2010 MSC: 60J22; 60J25; 60J60; 60H35; 60F17.
Introduction
In this article we aim at approximating exit times of one-dimensional regular continuous strong Markov processes (in the sense of Section VII.3 in [22] or Section V.7 in [23]). In what follows, the latter class of processes is called general diffusions, and the term exit time stays for a hitting time of a boundary point of the state space.
In the introduction we consider for simplicity a general diffusion in natural scale with the state space and a speed measure . For the interior of the state space we use the notation . A particular case is that is a solution of the Stochastic Differential Equation (SDE)
[TABLE]
where denotes a Brownian motion. It is known that (1) has a (possibly reaching [math] in finite time) unique in law weak solution under the Engelbert-Schmidt condition that is a non-vanishing (possibly irregular) Borel function such that is locally integrable on (see [14] or Theorem 5.5.7 in [21]). We extend to by setting to enforce absorption in [math] whenever [math] is accessible (whether or not [math] is accessible depends on the behavior of near [math]). In the case of (1) the speed measure is absolutely continuous with respect to the Lebesgue measure and is given by the formula . Notice, however, that our setting is more general than (1) because many general diffusions cannot be characterized in terms of an SDE (the latter is, in particular, true for general diffusions with sticky points, which correspond to atoms in the speed measure inside , and which gained an increased interest in recent years; see [20], [5], [13], [17] and references therein).
The question that initiated our research is as follows. Let and, for each , let be a continuous process viewed as an approximation of . Assume that
[TABLE]
which means that the distributions of the processes converge weakly to the distribution of (in ). The question is whether we have weak convergence of the hitting times
[TABLE]
where, for a process and , we use the notation (with ). The process can be given by some simulation scheme for the process (e.g., the Euler scheme with linear interpolation between grid points for the case when is driven by an SDE) and plays the role of discretization parameter. The question is thus whether we can approximately simulate the exit time having at our disposal a convergent scheme for itself. In the case when [math] is an accessible boundary point for , this is a difficult question because the path functional is discontinuous and hence does not in general preserve the weak convergence (also see Section 4 for an example, where (2) holds but (3) is violated). In the case of the Constant Elasticity of Variance (CEV) diffusion
[TABLE]
with and its Euler approximations , the article [10] proves the weak convergence , , for any fixed , which allows to approximately simulate the exit time of the CEV diffusion (to get continuous-time processes , the Euler scheme is linearly interpolated between the grid points). It is, however, an open question whether (3) holds true even for the CEV diffusion and its Euler approximations (see [10] for more detail and notice that, in contrast to the approach in (3), the main result in [10] requires to make the hitting boundary for the Euler scheme also depend on the discretization parameter ).
The first message we would like to convey is that the EMCEL approximation scheme , which is well-defined for every general diffusion , has the property (3) for every general diffusion . The EMCEL scheme is introduced in [3] and is shown to be able to approximate every general diffusion in the sense (2). This scheme is recalled in Example 2.2 below. The second message we would like to convey is that (3) holds true for the CEV diffusion given in (4) and its weak Euler approximations , which resolves a variant of the open question mentioned above.
Both messages mentioned in the preceding paragraph follow from our main result, Theorem 2.1, where we consider the class of approximating schemes described in (10)–(11) below and present a sufficient condition for (3) (Condition (B) below). In fact, Theorem 2.1 contains more than just (3) under Condition (B): it is a functional limit theorem both for the paths of the processes and for their exit times; see Section 2 for more detail. The mentioned messages are obtained as follows: the EMCEL scheme satisfies Condition (B) for every general diffusion ; the weak Euler scheme satisfies Condition (B) for given by (4).
We now discuss related literature. The article [15] proves weak convergence of certain absorption times that arise naturally in population genetics. The question of simulating the hitting times of squared Bessel processes is studied in [11] and [12]. Exact simulation of the first-passage time of diffusions (in the style of [6]) is considered in [18]. Under some regularity assumptions it is proved in [7] that the discrete exit time of the Euler scheme of a diffusion converges in with the optimal rate to the continuous exit time. For more information about the distributions of the exit times of diffusions see [9], [19] and references therein.
The paper is structured as follows. In Section 1 we formally describe our setting, the approximation schemes we use in the paper and recall the functional limit theorem from [3] ensuring (2) under a certain Condition (A). Section 2 presents and discusses the main result, Theorem 2.1, which is proved in Section 3. The assumption in Theorem 2.1, Condition (B), is stronger than Condition (A). Section 4 contains an example showing that Condition (A) does not suffice for (3). Finally, in Section 5 we discuss an application of our result to the CEV diffusion (4) and to squared Bessel processes.
1 Approximation schemes
Let be a one-dimensional continuous strong Markov process in the sense of Section VII.3 in [22]. We refer to this class of processes as general diffusions in the sequel. We assume that the state space is an open, half-open or closed interval . We denote by the interior of , where , and we set . Recall that by the definition we have for all . We further assume that is regular. This means that for every and we have that , where . Moreover, for in we denote by the first exit time of from , i.e., . Without loss of generality we suppose that the diffusion is in natural scale. If is not in natural scale, then there exists a strictly increasing continuous function , the so-called scale function, such that is in natural scale.
Let be the speed measure of the Markov process on (see VII.3.7 in [22]). Recall that for all in we have
[TABLE]
We assume that if a boundary point (that is, or ) is accessible, then it is absorbing. For our purposes, this assumption is without loss of generality, as for any general diffusion — possibly with reflecting boundary points — the stopped process is a general diffusion with absorbing boundary points and has the same exit times as .
Example 1.1** (Driftless SDE with possibly irregular diffusion coefficient).**
Consider the case, where inside the process is driven by the SDE
[TABLE]
where is a Borel function satisfying the Engelbert-Schmidt conditions
[TABLE]
( denotes the set of Borel functions locally integrable on ). Under (7)–(8) SDE (6) has a unique in law (possibly exiting in finite time) weak solution; see [14] or Theorem 5.5.7 in [21]. We make the convention that remains constant after reaching or in finite time, which makes the boundary points absorbing whenever accessible. This is a particular case of our setting, where the speed measure of on is given by the formula
[TABLE]
We now describe the approximation schemes considered in this paper. Let and suppose that for every we are given a Borel function such that and for all we have . We refer to each function as a scale factor. We next construct a family of Markov chains associated to the family of scale factors . To this end we fix a starting point of . Let be an iid sequence of random variables, on a probability space with a measure , satisfying . We denote by the Markov chain defined by
[TABLE]
We extend to a continuous-time process by linear interpolation, i.e., for all , we set
[TABLE]
To highlight the dependence of on the starting point we also sometimes write .
Next we recall the main result in [3], which allows to approximate with such Markov chains. Here and in the sequel we equip with the topology of uniform convergence on compact intervals, which is generated, e.g., by the metric
[TABLE]
where denotes the sup norm on . Moreover, we need the following condition.
Condition (A)
For all compact subsets of it holds that
[TABLE]
Theorem 1.2** (Theorem 1.1 in [3]).**
Assume that Condition (A) is satisfied. Then, for any , the distributions of the processes under converge weakly to the distribution of under , as ; i.e., for every bounded and continuous functional , it holds that
[TABLE]
2 Main result
We first introduce an auxiliary subset of . If , we define, for all ,
[TABLE]
where we use the convention . If , we set . Similarly, if , then we define, for all ,
[TABLE]
If , we set . We refer to Section 3 in [3] for a discussion of the extended real numbers and . In particular, it holds that is inaccessible if and only if for all . Similarly, is inaccessible if and only if for all . If or are accessible it holds that or , respectively, as .
Now the auxiliary subset is defined by
[TABLE]
We observe that and notice that is, in general, not connected, as it depends on the behavior of the scale factor , which is only a Borel function with the properties and for all . But, as , “gaps” can appear only close to accessible boundaries.
In order to formulate the main result we need to discuss the following conditions.
Condition (B)
(i) There exist , and a function with such that for all and
[TABLE]
(ii) For every compact subset of there exists a function with such that for all and
[TABLE]
We avoid introducing “Condition (C)” in this paper to escape a collision with anunrelated Condition (C) in the article [4], which studies convergence rates of the EMCEL and related schemes, and proceed with
Condition (D)
It holds that
[TABLE]
It is easy to see that Condition (B) is stronger than Condition (A), while Condition (D) is stronger than Condition (B). We prove our main result, Theorem 2.1 below, under Condition (B). In Section 4 we provide an example, where Condition (A) is satisfied but the claim of Theorem 2.1 does not hold true. Condition (D) can be viewed as a symmetric sufficient condition for the claim of Theorem 2.1, and it is, in fact, enough to deliver the first message mentioned in the introduction. On the contrary, to provide an answer to the open question about the convergence of the exit times for the (weak) Euler approximations of the CEV diffusion, we do need the full strength of Theorem 2.1 under Condition (B).
We recall that and denote the whole continuous-time processes: , . To formulate the main result of this article, Theorem 2.1, we equip with the metric
[TABLE]
and we use the standard product topology on product spaces, which is generated, e.g., by the metric on the product space defined as sum of the distances between the components (also recall the paragraph preceding Condition (A)).
Theorem 2.1**.**
Assume that Condition (B) is satisfied. Then, for any , the distributions of the random elements under converge weakly to the distribution of under , as ; i.e., for every bounded and continuous functional , it holds that
[TABLE]
As usual, for the weak convergence (18) we use the shorthand notation
[TABLE]
We remark that (19) immediately implies the weak convergence of the marginals. In particular, Theorem 2.1 establishes more than Theorem 1.2, but this is achieved under the stronger Condition (B) and cannot be achieved under Condition (A) (see Section 4). Furthermore, (19) immediately implies the weak convergence
[TABLE]
as is a continuous function .
It is important to note that for every speed measure there exists a family of scale factors such that Condition (D), and hence Condition (B), is satisfied. Consequently, Theorem 2.1 entails that the exit times of every general diffusion can be approximated with the help of Markov chains of the form (10). These scale factors are provided in the next example.
Example 2.2** (EMCEL approximations).**
Let . The EMCEL scale factor is defined by and, for all ,
[TABLE]
The associated process defined in (10)–(11) is denoted by and referred to as Embeddable Markov Chain with Expected time Lag (we write shortly ). The whole family is referred to as the EMCEL approximation scheme. Alternatively, we simply say EMCEL approximations.
We now explain in more detail what is included in Definition (20). For all , we define () and notice that, for , it holds if and only if . Fix . It follow from (5) that whenever . Therefore, the function
[TABLE]
is strictly increasing and continuous on (by the dominated convergence theorem). The definitions of and yield that, for , the number is a unique positive root of the equation (in )
[TABLE]
while, for (resp., ), is chosen to satisfy
[TABLE]
It follows from (22) that the set of (14) corresponding to the EMCEL scale factor (and, naturally, denoted by ) is simply
[TABLE]
This yields that the left-hand side in (17) vanishes for the EMCEL approximations and, therefore, for this scheme Condition (D), and hence Condition (B), is satisfied.
Remark 2.3**.**
As shown in Example 2.2 the EMCEL scale factors always satisfy Condition (D). However, Equation (21) defining these scale factors can rarely be solved in closed form. Therefore, in practice we usually need to solve (21) approximately. Condition (D) dictates that we need to solve (21) with an error of order uniformly in in order to guarantee convergence of the associated exit times. Condition (B) is a certain asymmetric weakening of the required precision.
Moreover, we note that Theorem 2.1 is not only applicable to perturbations of the EMCEL approximation but also can be used to derive convergence results for exit times in other approximation methods, e.g., for the weak Euler scheme. This is illustrated in Section 5.
Remark 2.4**.**
One might wonder why we consider only the question of convergence of the exit times from rather than considering the task of approximating for any . The answer is that this question is interesting (and difficult — see the paragraph containing (2), (3) and (4) in the introduction) only for . For , the path functional is -a.s. continuous for any . Indeed, the functional , for , is only discontinuous at paths that at some point in time touch the level but do not cross it, i.e., at paths with local maximum or minimum value . Formally, in the case (resp., ) the points of discontinuity of intersected with are contained in the set
[TABLE]
(resp., in the set given by the similar formula, where “” is replaced by “” and “” by “”), while the latter set has -measure zero, which follows from the strong Markov property of and the oscillating behavior of at time zero. More precisely, we refer to the property
[TABLE]
where
[TABLE]
which follows from the construction of as a time-changed Brownian motion, see Theorem V.47.1 in [23]. Therefore, for any , we obtain , , for any starting point under Condition (A) just as a corollary of Theorem 1.2. Moreover, the same reasoning immediately leads to the following extension of Theorem 2.1:
Assume that Condition (B) is satisfied. Let and . Then, for any , the distributions of the random elements
[TABLE]
under converge weakly to the distribution of
[TABLE]
under , as .
3 Proof of Theorem 2.1
The exit times considered in Theorem 2.1 may attain the value with positive probability. This is why we introduced in the text preceding Theorem 2.1 the metric on the nonnegative real line including . The next result shows that it suffices to verify convergence in probability on compact time intervals.
Lemma 3.1**.**
Let be an increasing bijection and let be the metric satisfying , . Let be a probability space, let be a random variable and let , , be a sequence of random variables such that for all the sequence of -valued random variables converges to in probability (with respect to the metric induced by the absolute value). Then the sequence converges to in probability with respect to the metric on .
Proof.
Throughout the proof fix . We need to show that as . For all introduce the set
[TABLE]
Since is continuous on it is uniformly continuous on , i.e., there exists such that for all with it holds that . This together with the assumption that converges to in probability implies
[TABLE]
Next note that for all
[TABLE]
Using similar arguments as in (23) we obtain that as . Combining this with (23) we obtain that as . This completes the proof. ∎
We now proceed with the proof of Theorem 2.1. It follows from the results in [3] that the discrete-time Markov chain can be embedded into with a sequence of stopping times. More precisely, Proposition 3.4 in [3] ensures that for all and there exists a sequence of stopping times such that
[TABLE]
In what follows denotes the sequence of stopping times from Proposition 3.4 in [3]. For every let be the discrete-time process satisfying , . Similarly to (11), we extend to a continuous-time process by linear interpolation, i.e., for all , we set
[TABLE]
Then it follows from (25) and (11) that for all and
[TABLE]
Therefore, in order to establish (18) it suffices to show for all that
[TABLE]
where the notation stands for the convergence in probability under the metric on given by the formula
[TABLE]
where the metrics and are defined in the texts preceding Condition (A) and Theorem 2.1. Clearly, it is enough to show the convergence of the three marginals separately. We first notice that for all
[TABLE]
as it is nothing else but convergence in probability uniformly on compact intervals, and it is established under Condition (A) in the proof of Theorem 1.1 in [3]. Concerning the convergence of the remaining marginals in (28), by symmetry it is enough only to show that for all
[TABLE]
By Lemma 3.1 (applied with , ) it is sufficient to prove for any finite time horizon and for all that
[TABLE]
(in (29) we use the standard Euclidean distance, hence the simpler notation , as the random variables now take finite values).
We verify (29) in a two-step procedure: We first show for every that is dominated by on a set with probability arbitrarily close to as (Proposition 3.2). The reverse direction is established in Proposition 3.5 with the help of Lemma 3.3 and Lemma 3.4. To formulate Proposition 3.2 it suffices to impose Condition (A). Recall that Condition (B) implies Condition (A).
Proposition 3.2**.**
Suppose that Condition (A) is satisfied. Then for all , and it holds that
[TABLE]
Proof.
Throughout the proof fix , , and .
First choose such that
[TABLE]
Next, note that the functional is -a.s. continuous with respect to the sup norm on . Moreover, it follows from the proof of Theorem 1.1 in [3] (see, in particular, (40) therein) that under Condition (A) we have for . This implies that there exists such that for all we have
[TABLE]
For all we have and hence on the event
[TABLE]
Consequently, we have for all that
[TABLE]
This completes the proof. ∎
Next, note that Corollary 3.3 in [3] shows that for all and we have
[TABLE]
Therefore, Condition (B) ensures that for all and we have that Concerning the complement of , the definition of shows that for all we have . Consequently, it follows for all and that (recall that and )
[TABLE]
We recall that denotes the sequence of stopping times from Proposition 3.4 in [3] (see, in particular, (25)).
Lemma 3.3**.**
Suppose that Condition (B) is satisfied. Then for all , and it holds that
[TABLE]
Proof.
Throughout the proof fix and . For all we define . By Proposition 3.4 in [3] and Condition (B) we have for all and on the event
[TABLE]
Again by Proposition 3.4 in [3] on the event we have . This implies for all and that
[TABLE]
and hence
[TABLE]
Next, (31) ensures that
[TABLE]
Therefore, Proposition 5.2 in [3] ensures that
[TABLE]
Combining this with (33) proves (32) and completes the proof. ∎
Lemma 3.4**.**
Suppose that Condition (B) is satisfied. Then for all , and it holds that
[TABLE]
Proof.
Throughout the proof fix , , , and let . By Markov’s inequality it holds that
[TABLE]
It follows from Lemma 5.1 in [3] that
[TABLE]
Then (31) shows that
[TABLE]
Letting go to [math] completes the proof. ∎
Proposition 3.5**.**
Suppose that Condition (B) is satisfied. Then for all , and it holds that
[TABLE]
Proof.
Throughout the proof fix , and . For all we introduce the events
[TABLE]
We show that for all small enough it holds that . Then Lemma 3.3 and Lemma 3.4 imply (36).
First notice that for all on the event we have
[TABLE]
Next, there exists such that for all it holds that
[TABLE]
This implies that for all and we have
[TABLE]
Note that for all and on the event it holds that and and, therefore, it follows from the construction of (cf. (26)) that . Consequently, for all and on the event we have
[TABLE]
Finally, for all on the event we have and again by the construction of (cf. (26)) that
[TABLE]
Therefore, by (38) we have for all on the event
[TABLE]
and, consequently, . Combining this with (37) and (39) proves that for all it holds that . This completes the proof. ∎
Combining Proposition 3.2 and Proposition 3.5 shows that for all , and we have
[TABLE]
which is (29). The proof of Theorem 2.1 is thus completed.
Remark 3.6**.**
It is worth noting that, under Condition (D), we can apply Corollary 5.4 of [3] and conclude that for all and it holds
[TABLE]
This allows to simplify the above argumentation and results in an easier proof of the claim of Theorem 2.1 under Condition (D). The latter, however, does not provide an answer to the open question about the convergence of the exit times of the (weak) Euler approximations for the CEV diffusion. To answer that question, we need the full strength of Theorem 2.1 under Condition (B) (see Section 5).
4 Condition (A) does not suffice
For simplicity we assume that throughout this section. Let be an accessible boundary point of . Let be the numbers defined at the beginning of Section 2. It holds that as . Let be another family satisfying for all and as . Then define for all a scale factor by for all and by for all , where is the EMCEL() scale factor defined in Example 2.2. Notice that for the scheme with scale factors due to the second term on the right-hand side of (14), hence Condition (B) is not satisfied (the integral in (15) is zero whenever is close to ).
By (21) it holds for every and that
[TABLE]
For every compact subset of there exists such that for all . This implies for all that
[TABLE]
and hence Condition (A) is satisfied for this choice of scale factors. Theorem 1.2 applies and we thus have the weak convergence of to as .
Next, let and . This implies that and hence there exists such that and
[TABLE]
This implies that
[TABLE]
Now suppose that . Then we have for all that and for all that . Hence it holds that
[TABLE]
which contradicts (40). Hence, it must hold that . To summarize, we have for all that and for all that . This implies that the discrete-time process (cf. (10)) does not jump from the region to the boundary point . Moreover, once it enters the interval it stays constant. Therefore, the process never hits the boundary point and it holds for all . In particular, we do not have weak convergence of to and thus the claim of Theorem 2.1 does not hold true.
To sum up, for every general diffusion with state space , being an accessible boundary point, we constructed a family of scale factors such that Condition (A) is satisfied but the claim of Theorem 2.1 does not hold true. In terms of the boundary classification, an accessible boundary can be either regular or exit (see, e.g., Definition 16.48 in [8]). It is worth noting that the above construction works irrespectively of whether is an exit boundary of or a regular one.
5 Applications
5.1 CEV diffusion
We start with the CEV diffusion. Let . Consider the process driven by the SDE
[TABLE]
inside and stopped as soon as it reaches [math]. Notice that the boundary point [math] is accessible if and only if (a straightforward application of Feller’s test for explosions; see, e.g., Theorem 5.5.29 in [21]), hence such a restriction on the parameter . The state space of is thus . In other words, is a diffusion in natural scale with state space and speed measure on .
In this subsection we consider the question of approximating the law of . As discussed in the introduction this is a challenging problem already in the case (see the text after (4) and, for more detail, see [10]). Of course, one possibility is to use the EMCEL scheme, which works for every general diffusion, let alone for (41). Below we discuss the weak Euler scheme for (41).
More precisely, we consider the weak Euler scheme slightly modified near zero to exclude the possibility of jumping out of the state space (recall that the scale factors we consider should satisfy whenever and ). Namely, let and for all let
[TABLE]
For all and we denote by the corresponding weak Euler scheme started in with step size defined via (10) and (11).
The main part of this subsection is devoted to the verification that in the case for the weak Euler scheme (42) Condition (B) is satisfied (the remaining case will be discussed thereafter). To this end we need to distinguish the cases (Lemma 5.2) and (Lemma 5.3). Combining these results with Theorem 2.1 leads to the following corollary.
Corollary 5.1**.**
Let . Then for any the distributions of the random elements under converge weakly to the distribution of under , as .
In particular, we have the weak convergence of the exit times.
Lemma 5.2**.**
In the case the scale factors satisfy Condition (B).
Proof.
In the calculations of this proof we use the convention that . First note that for all and it holds that
[TABLE]
It follows that for all we have
[TABLE]
and hence for all . As , it holds for all . Since if and only if , and since , it follows that .
Next, let the function be given by
[TABLE]
It follows from (42) and (43) that
[TABLE]
where the function is a continuous and strictly increasing bijection given by the formula
[TABLE]
To verify Item (i) of Condition (B), we fix , recall that and conclude from (45) and the fact that is -valued that
[TABLE]
i.e., (15) is satisfied with , and .
To verify Item (ii) of Condition (B), let be a compact subset of . The fact that is continuous and increasing ensures for all that
[TABLE]
and hence it follows from the fact that that
[TABLE]
This yields (16) and concludes the proof. ∎
Lemma 5.3**.**
In the case the scale factors satisfy Condition (B).
Proof.
The arguments go along the lines of the proof of Lemma 5.2. Therefore, we only list the quantitative changes. First note that for all and it holds that
[TABLE]
It follows that for all we have
[TABLE]
and hence for all
[TABLE]
As , it holds for all . The preceding calculations hold true, in fact, for all . Given that , we have the following equivalence:
[TABLE]
holds if and only if (notice that the equality in (47) holds true if and only if ). Hence, under the assumption of Lemma 5.3, for all . Since if and only if , we obtain that .
We again define the function by (44) and infer from (42) and (46) that
[TABLE]
where, for , the function is a continuous and strictly increasing bijection given by the formula
[TABLE]
while, for , the function is identically (but (48) still applies). Now Condition (B) is verified in qualitatively the same way as it was done in the proof of Lemma 5.2. ∎
Alternative approach for .
As Corollary 5.1 covers the case , what follows is of particular interest for , although it applies more generally for . The idea is to extend the state space beyond [math] to make [math] an interior point and get weakly converging approximations for using any scheme satisfying , , on the extended space (recall Remark 2.4). It is worth noting that, on the contrary, in the case we cannot extend the state space beyond [math], as for any in the latter case, so that (5) cannot be satisfied on any state space, where zero is an interior point. For completeness, we now describe the approach more precisely.
Below we assume as announced that . Consider a continuous strong Markov process with state space which is a weak solution to the SDE
[TABLE]
with
[TABLE]
Notice that (49) has a unique in law weak solution because the function satisfies the Engelbert-Schmidt conditions (7) and (8) on . Put differently, is a diffusion in natural scale with state space and speed measure .
Fix an arbitrary starting point and notice that
[TABLE]
In particular, the laws of the exit times and coincide. As the functional is -a.s. continuous ([math] is an interior point of the state space for ), we get the convergence , , and hence the required convergence
[TABLE]
with any scheme starting in satisfying
[TABLE]
It remains only to discuss for which schemes we have (51). A universal possibility is to use the EMCEL scheme for the SDE (49), which ensures (51) (recall that the EMCEL scheme works for every general diffusion). Concerning other schemes for which (51) might hold true, the following list contains what is currently known from the literature (to the best of our knowledge):
- (1)
[16] proves the almost sure convergence of the Euler scheme for a diffusion under the local Lipschitz condition on the diffusion coefficient inside the domain. This result does not apply, as is not locally Lipschitz near the interior point [math]. 2. (2)
To mention a related result for not locally Lipschitz diffusion coefficients, [1] proves the weak convergence of the type (51) for the Euler scheme for the CEV diffusion (41) (to be precise, not for (49)). But they treat only the case , while we are considering here. Moreover, even if this result was available also for , we could not infer the weak convergence of the exit times because the path functional is essentially discontinuous under , although it is essentially continuous under . In other words, we would then need such a result for (49) (not for (41)). 3. (3)
Theorem 2.2 in [25] establishes the weak convergence of the Euler scheme for certain discontinuous, hence not locally Lipschitz, diffusion coefficients , provided uniqueness in law holds for the SDE (which we know for (49)) and is locally bounded and has at most linear growth. This gives (51) for the Euler scheme for of (49) whenever (for us, the case of interest is ). Alternatively, the latter statement can be inferred from the results of the recent article [24], where again has to be locally bounded and of at most linear growth. Notice that for the mentioned results are not applicable (local boundedness near [math] is violated). 4. (4)
In the case the convergence of the Euler scheme for (49) is, indeed, a delicate issue: see the discussion in the end of Example 5.4 in [2] for the proof that in the case the law of the Euler scheme for (49) does not weakly converge to the law of . 5. (5)
We summarize the previous discussion by concluding that in the case both the Euler and the EMCEL schemes ensure (51), while in the case the EMCEL scheme is the only one currently known from the literature for which (51) is proved.
5.2 Squared Bessel processes
As approximating hitting times of Bessel processes is of special interest (see [11] and [12]), in the end we briefly recall the relation between the CEV diffusion and the squared Bessel process (stopped at the time when it hits zero), which yields a way to approximate the time when a Bessel process hits zero.
Let . We consider the process driven by the SDE
[TABLE]
inside and stopped as soon as it hits zero. Zero is accessible if and only if . Notice that, for , is the squared Bessel process of dimension stopped as it reaches zero. Without stopping the solution to (52) would be instantaneously reflecting at zero whenever . Recall that stopping when reaching a boundary point is without loss of generality for our purposes ( does not change). Such a diffusion is not in natural scale. We define the process
[TABLE]
with
[TABLE]
(this is a variant of the scale function of ), and conclude via Itô’s formula that is exactly the CEV diffusion of (41) with . Formally, Itô’s formula is applied on the stochastic interval because has infinite derivative at zero. This is enough for us because both and hit zero as , hence , and we indeed get the dynamics (41) for inside and is stopped upon reaching zero. As , we can approximate by approximating , e.g., as discussed in the previous subsection.
Acknowledgement
We thank Stefan Ankirchner for an interesting discussion that initiated this research and for pointing out several related references. We acknowledge the support from the German Research Foundation through the project 415705084.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. M. Abramov, F. C. Klebaner, and R. S. Liptser. The Euler-Maruyama approximations for the CEV model. Discrete Contin. Dyn. Syst. Ser. B , 16(1):1–14, 2011.
- 2[2] S. Ankirchner, T. Kruse, and M. Urusov. Numerical approximation of irregular SD Es via Skorokhod embeddings. J. Math. Anal. Appl. , 440(2):692–715, 2016.
- 3[3] S. Ankirchner, T. Kruse, and M. Urusov. A functional limit theorem for coin tossing Markov chains. Preprint, ar Xiv:1902.06249 , 2019.
- 4[4] S. Ankirchner, T. Kruse, and M. Urusov. Wasserstein convergence rates for random bit approximations of continuous markov processes. Preprint, ar Xiv:1903.07880 , 2019.
- 5[5] R. F. Bass. A stochastic differential equation with a sticky point. Electron. J. Probab. , 19:no. 32, 22, 2014.
- 6[6] A. Beskos, O. Papaspiliopoulos, and G. O. Roberts. Retrospective exact simulation of diffusion sample paths with applications. Bernoulli , 12(6):1077–1098, 2006.
- 7[7] B. Bouchard, S. Geiss, and E. Gobet. First time to exit of a continuous Itô process: general moment estimates and L 1 subscript 𝐿 1 L_{1} -convergence rate for discrete time approximations. Bernoulli , 23(3):1631–1662, 2017.
- 8[8] L. Breiman. Probability , volume 7 of Classics in Applied Mathematics . Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1992. Corrected reprint of the 1968 original.
