Fast $L_2$-approximation of integral-type functionals of Markov processes

In this paper, we provide strong $L_2$-rates of approximation of the integral-type functionals of Markov processes by integral sums. We improve the method developed in [2]. Under assumptions on the process formulated only in terms of its transition probability density, we get the accuracy that coincides with that obtained in [3] for a one-dimensional diffusion process.


Introduction
Let X t , t ≥ 0, be a Markov process with values in R d . Consider the following objects: h(X (kT )/n ), n ≥ 1. www.i-journals.org/vmsta

1) the integral functional
In this paper, we establish strong L 2 -approximation rates, that is, the bounds for The current research is mainly motivated by the recent papers [2] and [3].
In [3], strong L p -approximation rates are considered for an important particular case where X is a one-dimensional diffusion. The approach developed in this paper contains both the Malliavin calculus tools and the Gaussian bounds for the transition probability density of the process X, and relies substantially on the structure of the process.
Another approach to that problem has been developed in [2]. This approach is, in a sense, a modification of Dynkin's theory of continuous additive functionals (see [1], Chap. 6) and also involves the technique similar to that used in the proof of the classical Khasminskii lemma (see, e.g., [4,Lemma 2.1]). This approach allows us to obtain strong L p -approximation rates under assumptions on the process X formulated only in terms of its transition probability density.
For a bounded function h, the strong L p -rates of approximation of the integral functional I T (h) obtained in [2] essentially coincide with those established in [3]. However, under additional regularity assumptions on the function h (e.g., when h is Hölder continuous), the rates obtained in [3] are sharper (see [ In this note, we improve the method developed in [2], so that under the assumption of the Hölder continuity of h, the strong L 2 -approximation rates coincide with those obtained in [3], preserving at the same time the advantage of the method that the assumptions on the process X are quite general and do not essentially rely on the structure of the process.

Main result
In what follows, P x denotes the law of the Markov process X conditioned by X 0 = x, and E x denotes the expectation with respect to this law. Both the absolute value of a real number and the Euclidean norm in R d are denoted by | · |.
We make the following assumption on the process X.
A. The process X possesses a transition probability density p t (x, y) that is differentiable with respect to t and satisfies the following estimates: for some fixed α ∈ (0, 2] and some distribution density Q such that Without loss of generality, we assume that in (1) We assume that the function h satisfies the Hölder condition with exponent γ ∈ (0, α/2], that is, Now we formulate the main result of the paper.

Theorem 1. Suppose that Assumption A holds. Then
We provide the proof of Theorem 1 in Section 3. (1)

Remark 1. Any diffusion process satisfies conditions
, and properly chosen c 1 , c 2 (see [2]). In the case where X is a one-dimensional diffusion, Theorem 1 provides the same rates of convergence as those obtained in [3] (see Theorem 2.3 in [3]).

Remark 2.
Similarly to [2], we formulate the assumption on the process X only in terms of its transition probability density. Condition A, compared with condition X (cf. [2]), contains the additional assumption (3).

Proof of Theorem 1
Proof. For t ∈ [kT /n, (k + 1)T /n), denote η n (t) = kT n , ζ n (t) = (k + 1)T n , By the Markov property of X, for any r < s, we have Therefore, using the inequality s − η n (s) ≤ T /n, s ∈ [0, T ] and the Hölder continuity of the function h, we obtain: Split For |J 1 | and |J 2 |, the estimates can be obtained in the same way. Indeed, using the Cauchy inequality and (4), we get In the last inequality, we have used the inequality ζ n (s) − s ≤ T /n, s ∈ [0, T ]. Similarly, Now we proceed to the estimation of |J 3 |, which is the main part of the proof. Observe that the following identities hold: where in (6) we used that R d p r (y, z) dz = 1, r > 0, y ∈ R d , and in (7) we used the Chapman-Kolmogorov equation. We have: where in the last identity we have used (6) and (7). Further, we have Then, using condition A and the Hölder continuity of the function h, we obtain Therefore, according to (8) and (9), where in the fourth line we used that, for u ∈ [iT /n, (i + 1)T /n) and v ∈ [jT /n, (j + 1)T /n), we always have (i + 1)T /n − u ≤ T /n and (j + 1)T /n − v ≤ T /n.
Thus, from (10) we obtain where We estimate each term separately. In what follows, we consider the case γ < α/2; the case of γ = α/2 is similar and therefore omitted. We have Finally, since v − u ≤ T for 0 ≤ u < v ≤ T , we have ≤ C γ,α T 2γ/α n 1−2γ/α .