Next Article in Journal
On Coupled System of Langevin Fractional Problems with Different Orders of μ-Caputo Fractional Derivatives
Next Article in Special Issue
Applications of Fractional Differentiation Matrices in Solving Caputo Fractional Differential Equations
Previous Article in Journal
A Non-Convex Hybrid Overlapping Group Sparsity Model with Hyper-Laplacian Prior for Multiplicative Noise
Previous Article in Special Issue
Laplace-Residual Power Series Method for Solving Time-Fractional Reaction–Diffusion Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Rates of Convergence for Functional Limit Theorems with Stable Subordinators and for CTRW Approximations to Fractional Evolutions

by
Vassili N. Kolokoltsov
1,2
1
Faculty of Computation Mathematics and Cybernetics, Moscow State University, 119991 Moscow, Russia
2
Faculty of Economics, National Research University Higher School of Economics, 101000 Moscow, Russia
Fractal Fract. 2023, 7(4), 335; https://doi.org/10.3390/fractalfract7040335
Submission received: 1 February 2023 / Revised: 28 March 2023 / Accepted: 29 March 2023 / Published: 17 April 2023

Abstract

:
From the initial development of probability theory to the present days, the convergence of various discrete processes to simpler continuous distributions remains at the heart of stochastic analysis. Many efforts have been devoted to functional central limit theorems (also referred to as the invariance principle), dealing with the convergence of random walks to Brownian motion. Though quite a lot of work has been conducted on the rates of convergence of the weighted sums of independent and identically distributed random variables to stable laws, the present paper is the first to supply the rates of convergence in the functional limit theorem for stable subordinators. On the other hand, there is a lot of activity on the convergence of CTRWs (continuous time random walks) to processes with memory (subordinated Markov process) described by fractional PDEs. Our second main result is the first one yielding rates of convergence in such a setting. Since CTRW approximations may be used for numeric solutions of fractional equations, we obtain, as a direct consequence of our results, the estimates for error terms in such numeric schemes.

1. Introduction

From the initial development of probability theory to the present days, the convergence of various discrete processes to simpler continuous distributions remain at the heart of stochastic analysis. Many efforts have been devoted to functional central limit theorems (also referred to as the invariance principle), dealing with the convergence of random walks to Brownian motion. For the first results on the rates of convergence in the functional CLT, we can refer to [1,2], with explicit numeric constants provided in [3]. For recent development in the convergence rates for functional CLT and its generalizations, see, for example, refs. [4,5] and references therein.
There are many papers devoted to the rates of convergence of random sequences to stable laws; see, for example, refs. [6,7,8,9], and the references therein. However, though there is a serious interest in the function limit theorems with convergence to stable process, see, for example, refs. [10,11] and references therein, there seems to be yet no results on the rates of convergence in this setting. To the best knowledge of the author, the present paper is the first one supplying the rates of convergence in the functional limit theorem for stable subordinators. Moreover, we give explicit numeric constants, which seems to be new, even for the convergence to stable laws. As a technical novelty, we introduce and use effectively the smooth Wasserstein–Kantorovich metrics for measures based on the functional spaces of Hölder continuous functions. This approach makes our estimates rather flexible for adjusting to various stability indexes and various levels of regularity.
Let us notice that the results on the rates of weak convergence of processes are often formulated in terms of certain topologies on path spaces (such as Skorokhod topologies J 1 and M 1 ) and related metrics. Our convergence rates are formulated in simpler terms of the uniform convergence of marginal (in time) distributions. Alternative measures of convergence could be also various pseudo-distances ν r between distribution functions, say F , G , defined, for instance, by the inequalities of type | F ( s ) G ( s ) | A | s | r ν r (that have to hold for small s); see [12] and the numerous references therein.
Another popular topic deals with the convergence of CTRWs (continuous random walks) to processes with memory described by fractional PDEs. The CTRWs were introduced in [13]. They found numerous applications in physics. The scaling limits of these CTRWs were analyzed by many authors; see for example, [14,15,16]. The crucial point (realized initially by physicists, see [17] or [13]) is the fact that the limits of scaled CTRW yield Markov processes, time changed by inverse stable subordinators that solve fractional in time PDEs. The scaling limit for the position dependent CTRW was developed in [18]. Refs. [12,19] present convergence rates for a particular case of convergence to fractional distributions, including double-array schemes, but there seem to be no results available for the rates of convergence for a functional limit to fractional evolutions. Our final result is the first one providing the rates in this setting, and it deals with a rather general model of generalized (position depending) CTRWs. The methods used for proofs are based essentially on the theory of operator semigroups in the spirit of ideas, proposed initially in [18,20] and developed further in [21].
Since CTRW approximations may be used for numeric solutions of fractional equations (see [22]), we get, as a direct consequence of our results, the estimates for error terms in such numeric schemes. Numeric solutions to fractional PDEs is currently a rather hot topic. We refer to papers [23,24] for the probabilistic (Monte Carlo type) approach to numeric solutions of fractional equations and to [25] and references therein for (much more abundant) work on deterministic approaches.
The paper is organized as follows. In the next section, we formulate carefully our main results, discuss some links with related popular research topics and present the most basic examples. Section 3 is devoted to a review of some auxiliary facts playing a crucial role in our arguments. Though they are mostly known, we present them for handy references, stressing also some particular points and consequences related to our purposes. The rest of the paper is devoted to the proof of the main results, together with some intermediate steps that may be of independent interest.
We conclude the introduction with certain basic notations that will be used in the paper without further reminder.
Letters P and E will be used to denote probability and expectation. The indicator function of a set M will be denoted by 1 ( M ) .
As usual, let C ( R d ) denote the space of bounded continuous functions on R d equipped with the standard sup-norm . . For k N , let C k = C k ( R d ) denote the space of k times continuously differentiable functions on R d with bounded derivatives equipped with the standard norm
f C k = max { f , max m = 1 k f ( m ) } ,
where f ( k ) denotes the maximum of sup-norms of all partial derivatives of f of order k. Let C ( R d ) denote the closed subspace of C ( R d ) consisting of functions vanishing at infinity, C k ( R d ) the closed subspace of C k ( R d ) consisting of functions such that all its derivatives, up to order k, belong to C ( R d ) .
For α ( 0 , 1 ] , let H α = H α ( R d ) denote the space of bounded α -Hölder continuous functions equipped with the norm
f α = max { f , sup 0 < | x y | 1 | f ( x ) f ( y ) | | x y | α } ,
and for k N , let H k , α = H k , α ( R d ) denote the subspace of C k ( R d ) of functions with α -Hölder continuous derivatives of order k equipped with the norm
f k , α = max { f C k , f ( k ) α } ,
where f ( k ) α is the maximum of the H α - norms of all partial derivatives of f of order k.

2. Formulation of the Main Results

In this section, we formulate our main results. In the first subsection, we shall deal with the convergence of random walks to stable subordinators in three senses: in smooth Wasserstein distances (based on the functional spaces of Hölder continuous functions), in Kolmogorov’s distance and in various versions of convergence that are uniform in time. In the second subsection, we formulate our result on the rates of convergence for CTRW approximations. Finally, we supply some basic examples and recall the main link with the fractional PDEs.

2.1. Convergence of Random Walks to Stable Subordinators

Everywhere in this paper, we assume that τ i , i N , is a sequence of positive independent and identically distributed random variables having probability density p ( y ) on R + such that p ( 0 ) = 0 , p ( x ) is continuously differentiable, and p ( y ) = y 1 β for y B with some β ( 0 , 1 ) and B > 0 such that β B β > 1 . The latter condition comes from the requirement that B p ( y ) d y 1 . Let
Φ t h = i = 1 [ t / h ] h 1 / β τ i ,
be the corresponding scaled random walk (where we set Φ t h = 0 for t < h ). We shall denote by V h [ t / h ] the transition operators of the discrete Markov chain Φ t h .
Remark 1.
(i) The exact power law dependence of the density p ( x ) for large x is the standard simplifying assumption for the analysis of the central limit theorem for stable laws, see, for example, [7]. However, for convergence to stable distributions, more weaker assumptions can also be found in the literature; see, for example, [8]. We decided to stick here to the simplest assumption to show the idea of our framework for the calculations of the rates of convergence in the most transparent way. (ii) Requirements that p ( 0 ) = 0 and p ( x ) are continuously differentiable are not needed for the validity of Theorems 1 and 2.
Let T β t be the Feller semigroup of the β -stable Lévy subordinator Σ ^ t β in R generated by the operator
L ^ β f ( x ) = 0 f ( x + y ) f ( x ) y 1 + β d y .
For convenience, we chose L ^ to differ from the case of the standard stable subordinators (see (34)) by a multiplier. Therefore, if Σ t β is the standard β -subordinator, then
Σ ^ t β = Σ t Γ ( 1 β ) / β β .
It is well known that the operators V h [ t / h ] converge to the Feller semigroup T β t of the stable subordinator; see, for example, [15] or [18]. The next three theorems specify the rates of convergence in three different senses.
Theorem 1.
(i) If
β < ( 1 β ) / β ,
then for any α ( β , min { 1 , ( 1 β ) / β } ] ,
sup s t ( V h [ s / h ] T β s ) f h min ( 1 , ( 1 β ) / β ) t 2 B 1 β + 4 α β 2 ( 1 β ) ( α β ) f 1 , α .
For instance, if β 1 / 2 and thus 1 β β , choosing α = 1 yields the estimate
sup s t ( V h [ s / h ] T β s ) f h t 2 B 1 β + 4 β 2 ( 1 β ) 2 f 1 , 1 ,
and if β < ( 1 β ) / β 1 , then, choosing α = ( 1 β ) / β yields the estimate
sup s t ( V h [ s / h ] T β s ) f h ( 1 β ) / β t 2 B 1 β + 4 β 2 ( 1 β β 2 ) f 1 , ( 1 β ) / β .
(ii) If β ( 1 β ) / β , then
sup s t ( V h [ s / h ] T β s ) f h 1 β t 2 B 1 β + 10 β 2 ( 1 β ) 2 f 1 , ( 1 β ) / β .
These results can be more elegantly written using certain popular norms, which we shall review now.
For a subspace B of C ( R ) , which is itself a Banach space equipped with the norm . B , one can introduce a metric on the set of real random variables by the equation
d B ( X , Y ) = sup { | E f ( X ) E f ( Y ) | : f B 1 } .
For instance, if B = C k , k N , the corresponding metrics d C k are often referred to as the smooth Wasserstein metrics (see, for example, [8]). Intermediate metrics can be defined by using the spaces of Hölder functions H α as the subspace B. For the space H 1 , the corresponding metric is referred to as the bounded Lipschitz metric.
For instance, with these notations, the inequality (5) can be equivalently written
sup s t d H 1 , α ( Φ s h , Σ ^ s β ) h min ( 1 , ( 1 β ) / β ) t 2 B 1 β + 4 α β 2 ( 1 β ) ( α β ) .
Similarly, the other statements of Theorem 1 can be rewritten.
Notice that estimates (5) with flexible α may require less regularity than estimates (6) and (7), which are more transparent but less powerful than (5).
Remark 2.
The rates of convergence studied in the literature relate the convergence of weighted sums of τ i to stable distributions. For instance, in our notations, the results of [8] represent the estimates for d C 2 ( Φ 1 h , Σ ^ 1 β ) (where h = 1 / n in [8]). Our estimates, apart from being functional (giving uniform estimates for s t ), are based on more general spaces H α , thus requiring less regularity. We also supply the exact values for the constants involved.
The convergence of a sequence of random variables in smooth Wasserstein metrics implies its weak convergence. Now, we shall enhance the convergence with respect to smooth Wasserstein metrics (as given by Theorem 1) to a stronger convergence in Kolmogorov’s metric.
Theorem 2.
(i) If β < ( 1 β ) / β any α ( β , min { 1 , ( 1 β ) / β } ] , then
sup K > 0 sup s [ t 0 , t ] | P ( Φ s h K ) P ( Σ ^ s β < K ) |
1 2 ( t 0 1 / β + 3 ) 2 B 1 β + 4 α β 2 ( 1 β ) ( α β ) 1 / ( α + 2 ) ( h min ( 1 , ( 1 β ) / β ) t ) 1 / ( α + 2 ) ,
for any 0 < t 0 t and
sup K > k sup s t | P ( Φ s h K ) P ( Σ ^ s β < K ) |
[ k 1 ( Γ ( 1 β ) / β ) 1 / β + 3 / 2 ] 2 B 1 β + 4 α β 2 ( 1 β ) ( α β ) 1 / ( α + 2 ) ( h min ( 1 , ( 1 β ) / β ) t ) 1 / ( α + 2 ) ,
for any t > 0 , k > 0 .
(ii) If β ( 1 β ) / β , then
sup K > 0 sup s [ t 0 , t ] | P ( Φ s h K ) P ( Σ ^ s β < K ) |
1 2 ( t 0 1 / β + 3 ) 2 B 1 β + 10 β 2 ( 1 β ) 2 β / ( β + 1 ) ( h 1 β t ) β / ( β + 1 ) ,
for any 0 < t 0 t and
sup K > k sup s t | P ( Φ s h K ) P ( Σ ^ s β < K ) |
[ k 1 ( Γ ( 1 β ) / β ) 1 / β + 3 / 2 ] 2 B 1 β + 10 β 2 ( 1 β ) 2 β / ( β + 1 ) ( h 1 β t ) β / ( β + 1 ) ,
for any t > 0 , k > 0 .
It is seen that the difference between the distribution functions of the random variables Φ s h and Σ ^ s β may not be easy to control for both s and K small. This effect can be expected, as Φ s h is discrete in s and Σ ^ s β has a density function that increases to infinity, as s 0 .
Recall that the Kolmogorov distance between random variables X and Y is defined by the formula
d K o l ( X , Y ) = sup z | P ( X z ) P ( Y z ) | .
Thus, inequality (13) rewrites as
sup t 0 < s t d K o l ( Φ s h , Σ ^ s β ) 1 2 ( t 0 1 / β + 3 ) 2 B 1 β + 10 β 2 ( 1 β ) 2 β / ( β + 1 ) ( h 1 β t ) β / ( β + 1 ) .
If β 1 / 2 , then from (11) one derives the estimate
sup t 0 s t d K o l ( Φ s h , Σ ^ s β ) 1 2 ( t 0 1 / β + 3 ) 2 B 1 β + 4 β 2 ( 1 β ) 2 1 / 3 ( h t ) 1 / 3 ,
and if β 2 < 1 β β , then from (11) one derives the estimate
sup t 0 s t d K o l ( Φ s h , Σ ^ s β ) 1 2 ( t 0 1 / β + 3 ) 2 B 1 β + 4 β 2 ( 1 β β 2 ) β / ( β + 1 ) h ( 1 β ) / ( 1 + β ) t β / ( β + 1 ) .
In Theorem 2, we estimated | P ( Φ s h K ) P ( Σ ^ s β < K ) | uniformly in K for bounded s. Now we shall estimate | P ( Φ s h K ) P ( Σ ^ s β < K ) | uniformly in s for bounded K, which is crucial for the proof of our last theorem.
Below, we shall use the constant t 0 (depending only on β ), which is given explicitly in Proposition 6.
Theorem 3.
If β 1 / 2 , then
sup K K 0 sup s 1 | P ( Φ s h K ) P ( Σ ^ s β < K ) |
2 h 1 / ( 3 + β ) 2 B 1 β + 4 β 2 ( 1 β ) 2 1 / 3 + 2 2 / β K 0
for any K 0 and small enough h, namely whenever h β / ( β + 3 ) 1 / t 0 .
If β 2 < 1 β β , then
sup K K 0 sup s 1 | P ( Φ s h K ) P ( Σ ^ s β < K ) |
2 h ( 1 β ) / ( 1 + β + β 2 ) 2 B 1 β + 4 β 2 ( 1 β β 2 ) β / ( β + 1 ) + 2 2 / β K 0
for any K 0 and small enough h, namely whenever h β ( 1 β ) / ( 1 + β + β 2 ) 1 / t 0 .
If β ( 1 β ) / β , then
sup K K 0 sup s 1 | P ( Φ s h K ) P ( Σ ^ s β < K ) |
2 h β ( 1 β ) / ( 1 + β + β 2 ) 2 B 1 β + 10 β 2 ( 1 β ) 2 β / ( β + 1 ) + 2 2 / β K 0
for any K 0 and small enough h, namely whenever h β 2 ( 1 β ) / ( 1 + β + β 2 ) 1 / t 0 .
Moreover, one has similar estimates for
sup k K K 0 sup s > 0 | P ( Φ s h K ) P ( Σ ^ s β < K ) |
with the same power dependence of h but with different constants (depending on k , K 0 , β , B ).
Finally,
0 | P ( Φ s h K ) P ( Σ ^ s β < K ) | d s ( 1 + K + K 1 ) C ( β ) h ϰ ( β )
with some constants C ( β ) > 0 and ϰ ( β ) ( 0 , 1 ) (that can be written explicitly). For instance, if β ( 1 β ) / β , then
ϰ ( β ) = β ( 1 β ) 2 1 + β + β 2 .

2.2. Convergence of Position-Dependent CTRWs to Fractional Evolutions

In this subsection, we formulate our second main result concerning the rates of convergence of generalized (position dependent) CTRWs to Markov processes with memory described by fractional PDEs.
The inverse process to the scaled random walk Φ t h is defined by the equation
N K h = sup { t : Φ t h < K } .
In renewal theory, this process is also referred to as the number of renewals. It can be defined by several other equivalent ways. They are insightful, and we provide them for the convenience of the readers in our less standard (scaled) version. Namely, N K h can be equivalently defined by (i) the requirement that the events ( N K h > t ) and ( Φ t h < K ) coincide (for all t , K ), (ii) by the requirement that
Φ N K h h h < K Φ N K h h ,
or (iii) by the counting-number-of-events formula
N K h / h = 1 + n = 1 1 ( Φ n h h < K ) = 1 + n = 1 1 i = 1 n h 1 / β τ i < K .
In particular, the key relation is
P ( N K h > t ) = P ( Φ t h < K ) .
Suppose X 1 h , X 2 h , is a sequence of independent and identically distributed random variables in R d such that the distribution of each X i h is given by a probability measure μ s p a c e h ( d x ) that depends on h. The standard (scaled) continuous time random walk (CTRW) is a random process given by the random sum
j = 1 N t h / h X i h .
In position-dependent CTRW, the jumps X i h are not independent, but each X i h depends on the position of the process before this jump. The natural general formulation can be given in terms of discrete Markov chains as follows.
Let O h n ( x ) be a family (depending on a parameter h > 0 ) of discrete-time Markov chains in R d , independent of the sequence { τ i } . Let U h be a transition operator of O h 1 ( x ) so that
U h f ( x ) = E O h 1 ( x ) = f ( y ) μ s p a c e h ( x , d y ) ,
with some family of stochastic kernels μ s p a c e h ( x , d y ) .
The discrete-time process
O h N t h / h ( x ) ,
with the transition operators U h N t h / h , is a generalized scaled (position dependent) continuous time random walk (CTRW) arising from transitions μ s p a c e h ( x , d y ) and the sequence of waiting times { τ i } . Thus, it is a Markov chain, time changed by the inverse process to the scaled random walk built on the sequence { τ i } .
Let us denote by
σ y = max { t : Σ ^ t β y }
the inverse process to the stable subordinator Σ ^ t β .
As was already mentioned, it has been proved by many authors under various assumptions that if ( U h 1 ) / h converges to an operator L, which generates a Feller process X t ( x ) (here, as in (25), x stands for the initial point of the process) with a Feller semigroup F t , then the processes of CTRW O h N t h / h ( x ) converges in distribution to the time-changed Markov process X t ( x ) , that is, to the process X σ t ( x ) . Our final result supplies the rates of convergence for this scaling limit in terms of marginal distributions.
Theorem 4.
Let the Feller semigroup F t = e t L of a Feller process X t ( x ) and the family of contractions U h satisfy the assumptions of Proposition 1 (given below) with ϰ h + ϵ h = h ω with some ω > 0 . Then, if m > 0 , then
sup x | E f ( O h N t h / h ( x ) ) E f ( X σ t ( x ) ) | = E U h N t h / h f E F σ t f
4 ( 1 + max ( 1 , m / ω ) ) ( 1 + t + t 1 ) ln ( 1 / h ) 1 f D ,
for all t > 0 , f D , and h h 0 with sufficiently small h 0 (depending on β , B ).
If m = 0 , then the convergence rates on the right-hand side of (26) can be improved to the power-type estimate
sup x | E f ( O h N t h / h ( x ) ) E f ( X σ t ( x ) ) | C ( β ) ( 1 + t + t 1 ) h ϰ ( β ) f D ,
with some C ( β ) and ϰ ( β ) ( 0 , 1 ) . For instance, if β ( 1 β ) / β , then
ϰ ( β ) = min ω β + 1 , β ( 1 β ) 2 1 + β + β 2 .
A numeric estimate for h 0 is easy to derive for given β , B , but a general formula is lengthy and not very revealing; hence, it is omitted.

2.3. Link with Fractional Equations and Fractional Distributions; Examples

It is well known, see, for example, monographs [16,20,26], that the subordinated limiting evolution described by the operators E f ( X σ t ( x ) ) = E F σ t f ( x ) solves fractional in time-differential equations. Namely, under the conditions of Theorem 4, the function f t ( x ) = E ( F σ t f ) ( x ) satisfies the equation
D 0 + β f t ( x ) = L f t ( x ) , f 0 ( x ) = f ( x ) ,
where D 0 + β is the Caputo–Dzherbashian derivative of order β acting on the variable t, and the operator L acts on the variable x. Thus, Theorem 4 provides the rates of convergence for the CTRW approximations of the solutions to fractional equations.
Recall that the Caputo–Dzherbashian derivative of order β ( 0 , 1 ) is given by the formula
D 0 + β f ( s ) = 1 Γ ( 1 β ) 0 x ( s r ) β f ( r ) d r ,
see, for example, [27].
The most basic examples are supplied by operators L that are diffusion operators
L d i f f ( x ) = 1 2 tr G ( x ) 2 f x 2 ( x ) = 1 2 i j G i j ( x ) 2 f x i x j ( x ) , x R d ,
with G ( x ) , a positive d × d -matrix, or the generators of stable-like processes
L s t β f ( x ) = S d 1 | ( s , f ( x ) ) | β μ ( x , s ) d s , x R d ,
with β ( 0 , 2 ) , μ ( x , s ) and even in s positive functions on R d × S d 1 and d s Lebesgue measures on the unit sphere S d 1 . In particular, if μ ( x , s ) = 1 (that is, the spectral measure μ ( x , s ) d s is uniform), then L s t β = σ | Δ | β / 2 (with σ a constant depending on d) becomes a standard fractional Laplacian. Standard CTRW approximations to these operators are well presented in the literature, see [16,20,26].
In both cases, if the coefficients are sufficiently smooth, one can take the space D = C ( R d ) C 4 ( R d ) , for which the assumptions of Proposition 1 (and thus of Theorem 4) hold with ϰ h = ϵ h = h . In fact, the second required condition (42) usually holds trivially for the standard constructions of CTRW approximation (as mentioned above), and the first required condition (41) holds trivially with ϰ h = h whenever D is a subspace such that L 2 is a bounded operator D C ( R d ) . Estimates with ϰ h = h ω with some ω > 0 can be obtained for larger space D = H 1 , α in the same way, as it is done for the stable subordinator in Section 4 below.
If the coefficients of these operators are constant (they specify a spatially homogeneous process), then the assumptions of Proposition 1 hold with m = 0 , thus allowing for better power law rates of convergence (rather than our general logarithmic rates).
Let us present the simplest possible example. Namely, the operator L = Δ / 2 in R d is known to generate a standard Brownian motion B t with the standard heat equation semigroup F t . Let us approximate it by the standard random walk with the transition operator
U h f ( x ) = i = 1 d f ( x + h e i ) + f ( x h e i ) 2 f ( x ) 2 h 2 ,
where e i is the standard basis in R d . Choosing D = C ( R d ) C 4 ( R d ) , we find ourselves under the assumptions of Proposition 1 with ϰ h = ϵ h = h , m = 0 and l = 1 . Choosing β such that β ( 1 β ) / β and applying Theorem 4, we obtain the rates of convergence of the corresponding CTRW O h N t h / h to the subordinated Brownian motion (fractional diffusion):
sup x | E f ( O h N t h / h ( x ) ) E f ( B σ t ( x ) ) | = E U h N t h / h f E F σ t f
C ( β ) ( 1 + t + t 1 ) h β ( 1 β ) 2 / ( 1 + β + β 2 ) f C 4 ,
for sufficiently small h. This can be also rewritten in terms of the smooth Wasserstein distances (9):
d C 4 ( O h N t h / h , B σ t ) C ( β ) ( 1 + t + t 1 ) h β ( 1 β ) 2 / ( 1 + β + β 2 ) f C 4 .
The same estimate holds if instead of the Brownian motion, one takes the stable process Y t α in R d generated by the fractional Laplacian | Δ | α / 2 , α ( 1 , 2 ) , and the corresponding standard CTRW approximation. The distribution of the subordinated process Y σ t α , where σ t is the inverse to the stable subordinator Σ t β , was called fractional stable in [14] because, as it was found, it could be obtained as the distribution of the ratio of two independent stable random variables (the denominator taken in power β / α ). For completeness, let us write down the marginal probability density q t ( y ) of the process Y σ t α (started at y 0 = 0 ):
q t ( y ) = 0 S α 1 , ( z / t ) β / α y ( z / t ) d β / α S β ( 1 , z ) d z ,
where S α and S β are the densities of the symmetric α -stable distribution in R d and of the β -stable subordinator (with the unit scaling coefficient). Density (33) was obtained in [14], as the limit of CTRWs, for the case of t = d = 1 . A noteworthy observation is that density function (33) is the same as for the distribution of the ratio Y 1 α ( Σ 1 β / t ) β / α .
Since the limiting distribution of Y σ t α has a smooth density, the convergence in the smooth Wasserstein metric (32) can be further enhanced to a stronger convergence in Kolmogorov’s or Prokhorov’s metric. Notice also that, for fixed t, we find ourselves in another extremely popular field of research concerning the rates of convergence of the random sums of independent and identically distributed random variables, see [28] and numerous references therein.
Let us stress finally again that, as it follows from the discussion above, CTRW approximations can be used for numeric solutions of fractional equations. This numeric approximation was seemingly first proposed in [22]. Our results supply the rates of convergence to these numeric schemes.

3. Auxiliary Results

In this section, we collect some mostly known results, stressing some particular points and consequences, which are crucial for our purposes.

3.1. Estimates of One-Sided Stable Laws near the Origin

Stable subordinators Σ t β are increasing Lévy processes generated by the inverted fractional derivative operator
d β d ( x ) β f ( x ) = β Γ ( 1 β ) 0 f ( x + y ) f ( x ) y 1 + β d y .
The characteristic functions ϕ t ( q ) of the transition probability densities S β ( t , x ) of these processes are known to equal
ϕ t ( q ) = exp { t | q | β e i π β sgn q / 2 } d q ,
so that the densities themselves have the integral representation
S β ( t , x ) = 1 2 π R exp { i q x t | q | β e i π β sgn q / 2 } d q .
Notice that the function G β ( t , x ) = S β ( t , x ) is the Green function for the Cauchy problem to the operator (34) so that it solves the Cauchy problem
G β t ( t , x ) = d β d ( x ) β G β ( t , x ) , G ( 0 , x ) = δ ( x ) .
It is clear that S β ( t , x ) are infinitely smooth in x and satisfy the scaling relation
S β ( t , x ) = t 1 / β S ( 1 , t 1 / β x ) .
Therefore, a study of the density S β can be effectively reduced to the study of S β ( 1 , x ) .
From (34), it follows that stable subordinators move only in one direction, implying that S β ( t , x ) = 0 for x 0 .
From (35), it follows that
S β ( 1 , x ) 1 π 0 exp { t q β cos ( π β / 2 ) } d q
for any x and therefore
max x S β ( 1 , x ) 1 π β Γ ( 1 / β ) [ cos ( π β / 2 ) ] 1 / β .
In this paper, we are working with the re-scaled subordinator Σ ^ t β , given by (3) and having the transition density S ^ ( t , x ) = S ( t Γ ( 1 β ) / β , x ) . It follows that
max x S ^ ( t , x ) = max x S ( t Γ ( 1 β ) / β , x ) = ( t Γ ( 1 β ) / β ) 1 / β max x S ( 1 , x )
t 1 / β ( Γ ( 1 β ) / β ) 1 / β Γ ( 1 / β ) π β [ 1 β ] 1 / β ,
where in the last inequality, we took into account the simple estimate cos ( π β / 2 ) > 1 β , valid of all β ( 0 , 1 ) . Thus, using also that Γ ( 2 β ) = Γ ( 1 β ) ( 1 β ) , we conclude that
max x S ^ ( t , x ) t 1 / β M , M = sup β ( 0 , 1 ) [ ( Γ ( 2 β ) / β ) 1 / β Γ ( 1 / β ) π β ] .
Performing elementary manipulations (which we omit) with the Stirling formula (with explicit estimates, see, for example, [29]) allows one to prove a uniform bound for the multiplier M:
Lemma 1.
M = sup β ( 0 , 1 ) [ Γ ( 2 β ) / β ] 1 / β Γ ( 1 / β ) π β 1 / 2 .
Consequently,
P ( Σ ^ t β K ) = 0 K S ^ β ( t , x ) d x = 1 2 K t 1 / β .
We shall need also the estimates for S β ( 1 , x ) for large x. These estimates can be derived from the standard expansion (see, for example, [30,31])
S β ( 1 , x ) = 1 π x k = 1 Γ ( 1 + k β ) Γ ( 1 + k ) sin ( k π β ) ( x β ) k ,
which is convergent for all x > 0 . Making a very rough estimate of the terms, we obtain
S β ( 1 , x ) π β π x k = 1 k x β k = β x x β 1 x β .
Thus, for x 2 ,
S β ( 1 , x ) x 1 β β 1 2 β .
Since 1 e β ln 2 β ln 2 ( 1 β ln 2 / 2 ) β ln 2 ( 1 ln 2 / 2 ) , it follows that
S β ( 1 , x ) 3 x 1 β , x 2 .

3.2. Convergence of Markov Chains to Continuous-Time Processes

It is well known that the convergence of the generators of contraction semigroups on the core of the limiting generator implies the convergence of semigroups. We shall need a version of this fact with explicit rates, namely the following result, given in Theorem 8.1.1 of [20].
Proposition 1.
Let F t = e t L be a Feller semigroup in the Banach space B = C ( R d ) , generated by an operator L, having a core D, which is itself a Banach space with a norm . D . B such that L f B l f D for a constant l and all f D . Let F t be also a bounded semigroup in D such that
max s [ 0 , t ] F t D D e m t ,
with a constant m 0 (the growth rate of the semigroup).
Let U h be a family of contractions in B, and let
U h 1 h L f B ϵ h f D ,
F h 1 h L f B ϰ h f D ,
with ϵ h 0 and ϰ h 0 , as h 0 . Then the scaled discrete semigroups ( U h ) [ t / h ] converge to the semigroup F t and moreover
sup s t ( U h ) [ s / h ] F s f B ( ϰ h + ϵ h ) f D 0 t e m s d s .
As a key illustration to when (40) holds, we shall look at the convergence of random walks to stable subordinators, as described by the following result.
Lemma 2.
Let p ( y ) be a probability density on R + such that p ( y ) = y 1 β for y B with some β ( 0 , 1 ) and B > 0 such that β B β > 1 (the latter condition comes from the requirement that B p ( y ) d y 1 ). Then, we have the following:
(i) For any bounded measurable f having support on [ B h 1 / β , ) ,
h 1 0 f ( h 1 / β y ) p ( y ) d y = 0 f ( y ) d y y 1 + β ,
(ii) For any bounded measurable f on R + such that | f ( y ) | L y for y [ 0 , B h 1 / α ] and some constant L, it follows that
h 1 0 f ( h 1 / β y ) p ( y ) d y 0 f ( y ) d y y 1 + β C B , β L h 1 + 1 / β ,
with
C B , β = B 1 β 1 β + 0 B y p ( y ) d y B 1 β 1 β + B 2 B 1 β .
Proof. 
(i) From the condition on the support of f, one can change p ( y ) to y 1 β . Changing the variable of integration to y = h 1 / β y completes the proof.
(ii) Let f have support on [ 0 , B h 1 / β ] . Then
h 1 0 f ( h 1 / β y ) p ( d y ) = h 1 0 B f ( h 1 / β y ) p ( y ) d y h 1 + 1 / β L 0 B y p ( y ) d y ,
and
0 f ( y ) d y y 1 + β = 0 B h 1 / β f ( y ) d y y 1 + β L 0 B h 1 / β d y y β = B 1 β 1 β L h 1 + 1 / β ,
implying (44). From β B β > 1 , it follows that B > 1 , which implies the last estimate for C B , β . □
In particular, it follows that, for f C 1
h 1 0 ( f ( x ± h 1 / β y ) f ( x ) ) p ( y ) d y 0 ( f ( x ± y ) f ( x ) ) d y y 1 + β 2 B 1 β f h ( 1 / β ) 1 .

3.3. Estimates for Characteristic Functions for Distributions with a Density

It is well known (and easy to see) that if the support of a probability law μ on R is not contained in a lattice, then the characteristic function ϕ μ ( q ) is everywhere less than one in magnitude, apart from the value ϕ μ ( 0 ) = 1 . One can give various estimates for the magnitude of ϕ μ ( q ) away from zero. Here, we derive a simple estimate that is handy for heavy tailed distributions.
Proposition 2.
Let a distribution μ on R + have a bounded density p ( x ) and there exist B > 0 such that p ( x ) is monotonically decreasing and strictly positive for x B . Then for any q 0 > 0 , there exists a ϰ q 0 ( 0 , 1 ) such that
| ϕ μ ( q ) | ϰ q 0 whenever | q | > q 0 .
Concretely, one can take
ϰ q 0 = 1 1 2 B + π / q 0 p ( x ) d x .
Proof. 
Let q q 0 > 0 . We have
B e i q x p ( x ) d x 2 = B B cos [ q ( x y ) ] p ( x ) p ( y ) d x d y .
Due to the monotonicity of p ( x ) and the oscillations of cos [ q ( x y ) ] with period 2 π / q ,
B cos [ q ( x y ) ] p ( x ) d x B B + π / q p ( x ) d x B B + π / q 0 p ( x ) d x .
Hence,
| B e i q x p ( x ) d x | 2 B B + π / q 0 p ( x ) d x B p ( y ) d y .
Therefore,
| ϕ μ ( q ) | 0 B e i q x p ( x ) d x + B e i q x p ( x ) d x
0 B p ( x ) d x + B B + π / q 0 p ( x ) d x B p ( y ) d y
= 1 B p ( x ) d x + B B + π / q 0 p ( x ) d x B p ( x ) d x ,
which is easily seen to be bound by C ϰ q 0 from (46). □

3.4. From Weak to Strong Convergence of Distributions

Convergence of a sequence in the smooth Wasserstein metrics (9) implies the weak convergence of this sequence. Here, we present a quantitative result, which is a generalization of Corollary 1.6 from [8], showing that if a limiting distribution has a density, then the convergence with respect to any of the smooth Wasserstein metrics implies the convergence in Kolmogorov’s metric (15). Moreover, one is able to relate the rates of convergence in Wasserstein’s and Kolmogorov’s distances.
Proposition 3.
Let X , Y be two random variables such that the distribution of Y has a bounded probability density p ( x ) with M = sup x p ( x ) . Then, for any k N ,
d K o l ( X , Y ) ( M + ϰ k ) [ d C k ( X , Y ) ] 1 / ( k + 1 ) ,
with a constant ϰ k 1 depending only on k. For instance, ϰ 1 3 / 2 and ϰ 2 6 . Moreover, for any α ( 0 , 1 ] ,
d K o l ( X , Y ) ( M + 1 ) [ d H α ( X , Y ) ] 1 / ( α + 1 ) ,
d K o l ( X , Y ) ( M + 3 / 2 ) [ d H 1 , α ( X , Y ) ] 1 / ( α + 2 ) ,
Proof. 
Since ϰ k 1 and d K o l ( X , Y ) 1 , inequality (47) holds trivially whenever d C k ( X , Y ) 1 . Let us now assume that d C k ( X , Y ) < 1 .
By the assumptions on Y,
P ( Y [ a , b ] ) ( b a ) M
for any interval [ a , b ] .
Let ϕ be a smooth function R [ 0 , 1 ] such that ϕ ( x ) = 0 for x 1 and ϕ = 1 for x 0 , and let ρ 1 be a constant. Let ϕ ρ , z ( s ) = ϕ ( ρ ( s z ) ) , so that ϕ ρ , z ( s ) = 0 for s > z + 1 / ρ . Then
P ( X z ) E ϕ ρ , z ( X ) E ϕ ρ , z ( Y ) + d C k ( X , Y ) ρ k ϕ C k
P ( Y z + 1 / ρ ) + d C k ( X , Y ) ρ k ϕ C k P ( Y z ) + M / ρ + d C k ( X , Y ) ρ k ϕ C k .
Let us choose ρ = [ d C k ( X , Y ) ] 1 / ( k + 1 ) . Then
P ( X z ) P ( Y z ) [ d C k ( X , Y ) ] 1 / ( k + 1 ) ( M + ϕ C k ) .
Similarly, the opposite inequality is obtained, implying (47) with ϰ k = ϕ C k . For k = 1 , one can choose ϕ ( x ) = 1 3 x 2 + 2 x 3 for x [ 0 , 1 ] so that ϰ 1 = max x [ 0 , 1 ] ( 6 x 6 x 2 ) = 3 / 2 . For k = 2 , one can choose ϕ ( x ) = 1 10 x 3 + 15 x 4 6 x 5 yielding ϰ 2 < 6 .
Inequalities (48) and (49) are proved analogously, choosing the linear function as ϕ on [ 0 , 1 ] for the first case (so ϕ becomes Lipschitz with the Lipschitz constant 1) and the function 1 3 x 2 + 2 x 3 for the second case. □
We will need this result for the distributions of stable processes Y = Σ t β . By (36) and the scaling property of the stable densities, we derive that for the standard β -stable subordinator Y = Σ t β , the constant M in Proposition 3 can be estimated as
M = max x S β ( t , x ) Γ ( 1 / β ) π β [ t cos ( π β / 2 ) ] 1 / β Γ ( 1 / β ) π β [ t ( 1 β ) ] 1 / β ,
and for the distribution of Y = Σ ^ t β generated by L ^ β , this constant modifies to
M = max x S ^ β ( t , x ) = [ t Γ ( 2 β ) / β ] 1 / β Γ ( 1 / β ) π β 1 / 2 t 1 / β ,
where Lemma 1 was used.

4. Regularity of Stable Semigroups in Hölder Spaces

We are planning to derive Theorem 1 by an application of Proposition 1 with d = 1 . For this application, we need estimates (40) and (41). The former is supplied for our setting by Lemma 2. The latter estimate is the subject of the present section.
Proposition 4.
Let T β t be the Feller semigroup of the β-stable Lévy subordinator in R generated by the operator
L β f ( x ) = 0 f ( x + y ) f ( x ) y 1 + β d y .
Then, for any α ( β , 1 ] ,
T β t f f 2 α β ( α β ) t f α ,
and for any α ( 0 , β ] ,
T β t f f 5 β ( 1 β ) t α / ( 1 + α ) f α ,
Proof. 
If α ( β , 1 ] , then
L β f f α 0 1 y α d y y 1 + β + 2 1 d y y 1 + β 2 1 α β + 1 β f α = 2 α β ( α β ) f α .
In particular,
L β f 2 β ( 1 β ) f C 1 .
Hence
T β t f f 0 t T s L β f d s t L β f 2 α β ( α β ) t f α ,
yielding (52).
Next, let ϕ be an even nonnegative smooth function on R with support in [ 1 , 1 ] such that ϕ ( 0 ) = 1 and ϕ ( x ) d x = 1 . For δ ( 0 , 1 ] , let ϕ δ ( x ) = δ 1 ϕ ( x / δ ) . Let us approximate an arbitrary continuous function on R by its convolutions
( f ϕ δ ) ( x ) = f ( y ) ϕ δ ( x y ) d y = f ( x y ) ϕ δ ( y ) d y .
If f H α , then
f f ϕ δ sup x | f ( x ) f ( y ) | ϕ ( ( x y ) / δ ) d y δ f α sup x | x y | α ϕ ( ( x y ) / δ ) d y δ
= f α δ α | z | α ϕ ( z ) d z f α δ α .
On the other hand,
( f ϕ δ ) 1 δ f | ϕ ( y ) | d y 2 δ f .
Hence,
f ϕ δ C 1 f max { 1 , 2 δ } 2 δ f .
Therefore (using (54) in the last step),
( T β t 1 ) f ( T β t 1 ) ( f f ϕ δ ) + ( T β t 1 ) ( f ϕ δ ) 2 f f ϕ δ + t L β ( f ϕ δ )
f α 2 δ α + 2 β ( 1 β ) 2 t δ .
Choosing δ = ( 2 t ) 1 / ( 1 + α ) and estimating β ( 1 β ) 1 / 4 yields (53). □
Lemma 3.
If f H 1 , α , then L β H α and
L β f α 2 β ( 1 β ) f 1 , α .
Proof. 
Writing
L β f ( x ) = L β 1 f ( x ) + L β 2 f ( x )
with
L β 1 f ( x ) = 0 1 f ( x + z ) f ( x ) z 1 + β d z = 0 1 0 z f ( x + w ) d w z 1 + β d z ,
L β 2 f ( x ) = 1 f ( x + z ) f ( x ) z 1 + β d z ,
we have
| L β 1 f ( x ) L β 1 f ( y ) | | x y | α f 1 , α 0 1 z z 1 + β d z = 1 1 β f 1 , α ,
and
| L β 2 f ( x ) L β 2 f ( y ) | | x y | α 1 | f ( x + z ) f ( y + z ) | + | f ( x ) f ( y ) | | x y | α z 1 + β d z
2 f | x y | 1 α 1 d z z 1 + β 2 β f .
Therefore (and using (54)),
L β f α f 1 , α 2 1 β + 2 β
yielding (55). □
Proposition 5.
Under assumptions of Proposition 4, if α ( 0 , β ] , then
T β t 1 t L β f 10 β 2 ( 1 β ) 2 t α / ( 1 + α ) f 1 , α ,
and if α ( β , 1 ] , then
T β t 1 t L β f 4 α β 2 ( 1 β ) ( α β ) t f 1 , α .
In particular,
T β t 1 t L β f 4 β 2 ( 1 β ) 2 t f C 2 .
Proof. 
We have
T β t 1 t L β f = 1 t 0 t ( T β s 1 ) L f d s .
Hence, if α ( 0 , β ] , then by (53) and (55), the left-hand side of (56) is bounded by
5 β ( 1 β ) t α / ( 1 + α ) L β f α 5 β ( 1 β ) t α / ( 1 + α ) 2 β ( 1 β ) f 1 , α ,
yielding (56). Similarly, the case α ( β , 1 ] is dealt with. □

5. Proof of Theorems 1 and 2

As a direct consequence of Proposition 1, estimates (45) and (56), and the observation that, because the Feller semigroup of the stable has a spatially homogeneous integral kernel, this Feller semigroup is a contraction in all spaces C k , the spaces H α and H 1 , α (so Proposition 1 holds with m = 0 ), we can conclude that, for α ( β , 1 ] ,
sup s t ( U h [ s / h ] T β s ) f t 2 B 1 β h ( 1 β ) / β + 4 α h β 2 ( 1 β ) ( α β ) f 1 , α .
Consequently, under (4), choosing any α ( β , min { 1 , ( 1 β ) / β } ] yields (5).
If (4) does not hold, then, choosing α = ( 1 β ) / β , we obtain
sup s t ( U h [ s / h ] T β s ) f t 2 B 1 β h ( 1 β ) / β + 10 β 2 ( 1 β ) 2 h 1 β f 1 , ( 1 β ) / β .
Since ( 1 β ) / β > 1 β , it implies (8), completing the proof of Theorem 1.
Next, by (49),
sup s t d K o l ( Φ s h , Σ ^ s β ) ( M + 3 / 2 ) [ d H 1 , α ( Φ s h , Σ ^ s β ) ] 1 / ( α + 2 ) ,
with M 1 / 2 by (51). Therefore, estimates (11) and (13) follow from Theorem 1.
In view of these results, in order to prove (12) and (14) it is sufficient to consider only the case of t = 1 . To complete the proof, one has to look first at the proof of Proposition 3 and to note that in order to estimate | P ( X z ) P ( Y z ) | , it is sufficient to choose M to be the maximum of the density p ( x ) only in a neighborhood of K (and not necessarily the global maximum). Then for any s ( 0 , 1 ) , we can use inequality (49) with
M = M ( s ) = S ^ β ( s , K ) = ( s Γ ( 1 β ) / β ) 1 / β S β ( 1 , K ( s Γ ( 1 β ) / β ) 1 / β ) .
Let us decompose the domain of variables K into two parts: K K 0 and K [ k , K 0 ) , where
K 0 = 2 [ s Γ ( 1 β ) / β ] 1 / β .
In the first part, K ( s Γ ( 1 β ) / β ) 1 / β 2 , and we can use estimate (39) to conclude that M 3 K 1 3 k 1 . In the second part, we use estimate (51) yielding
M 1 2 s 1 / β ( Γ ( 1 β ) / β ) 1 / β k 1 .
Since ( Γ ( 1 β ) / β ) 1 / β 3 , this completes the proof of 2.

6. Tails of Scaled CTRW

Recall that τ i , i N , is a sequence of positive independent and identically distributed random variables having probability density p ( y ) on R + such that p ( y ) = y 1 β for y B with some β ( 0 , 1 ) and B > 0 such that β B β > 1 , and
Φ t h = i = 1 [ t / h ] h 1 / β τ i .
is the corresponding scaled random walk.
Proposition 6.
Assume additionally that p ( 0 ) = 0 and p ( x ) is continuously differentiable. Then, for any K > 0 and t 2 ,
P ( Φ t h < K ) 3 2 K ( t 1 ) 1 / β 2 1 / β + ω ( t 1 ) ,
where ω ( t 1 ) is exponentially small for large t uniformly for h 1 and all K. In particular, for t > t 0 with some t 0 (which is explicitly given by condition (71)),
ω ( t 1 ) 1 2 K ( t 1 ) 1 / β 2 1 / β ,
and
P ( Φ t h < K ) 2 1 + 2 / β K t 1 / β
for all h 1 and K 1 .
Proof. 
The characteristic function of Φ t h equals
ϕ Φ t h ( q ) = [ ϕ T ( q h 1 / β ) ] [ t / h ] = [ 1 + ( e i q h 1 / β x 1 ) p ( x ) d x ] [ t / h ] .
We need an estimate for its magnitude.
Consider separately three domains of the values of q:
I : | q | C 1 h 1 / β , I I : C 1 h 1 / β | q | C 2 h 1 / β , I I I : | q | > C 2 h 1 / β ,
with constants C 1 , C 2 chosen later. Then we can write
P ( Φ t h < K ) = 1 2 π 0 K e i q x ϕ Φ t h ( q ) d q d x
= 1 2 π 1 e i q K i q ϕ Φ t h ( q ) d q = I + I I + I I I .
In domain I,
| ϕ Φ t h ( q ) | | 1 + 0 ( e i q h 1 / β x 1 ) p ( x ) d x | ( t 1 ) / h .
By (5),
1 h 0 ( e i q h 1 / β x 1 ) p ( x ) d x = 0 ( e i q y 1 ) d y y 1 + β + ω ,
where
| ω | C B , β | q | h 1 + 1 / β .
The value of the integral on the right-hand side is well known:
0 ( e i q y 1 ) d y y 1 + β = Γ ( 1 β ) β e i π β sgn q / 2 | q | β
= Γ ( 1 β ) β | q | β ( cos ( π β / 2 ) i sin ( π β / 2 ) ) ,
where ∓ corresponds to positive and negative q, respectively. If
h Γ ( 1 β ) β | q | β 1 2 cos ( π β / 2 ) ,
then
| ϕ Φ t h ( q ) | | 1 + ( e i q h 1 / β x 1 ) p ( x ) d x |
| 1 h Γ ( 1 β ) β | q | β ( cos ( π β / 2 ) i sin ( π β / 2 ) ) | + h | ω |
= 1 h Γ ( 1 β ) β | q | β 2 cos ( π β / 2 ) h Γ ( 1 β ) β | q | β + h | ω |
1 h 2 Γ ( 1 β ) β | q | β 2 cos ( π β / 2 ) h Γ ( 1 β ) β | q | β + h | ω |
1 h 2 Γ ( 1 β ) β | q | β ( 3 / 2 ) cos ( π β / 2 ) + h | ω | .
If, additionally,
C B , β | q | h 1 / β h 4 Γ ( 1 β ) β | q | β ( cos ( π β / 2 ) ,
then
| ϕ Φ t h ( q ) | | 1 + ( e i q h 1 / β x 1 ) p ( x ) d x | 1 h 2 Γ ( 1 β ) β | q | β ( cos ( π β / 2 ) ,
and
| ϕ Φ t h ( q ) | 1 h 2 Γ ( 1 β ) β | q | β cos ( π β / 2 ) ( t 1 ) / h exp { 1 2 ( t 1 ) | q | β Γ ( 1 β ) β cos ( π β / 2 ) } .
Conditions (64) and (65) are satisfied if
| q | C 1 h 1 / β
with
C 1 = min β 2 Γ ( 1 β ) cos ( π β / 2 ) 1 / β , Γ ( 1 β ) 4 C B , β β cos ( π β / 2 ) 1 / ( 1 β ) ,
which we assume from now on.
Then
| I | K π 0 exp { 1 2 ( t 1 ) q β Γ ( 1 β ) β cos ( π β / 2 ) } d q .
Changing the variable of integration yields
| I | K π ( t 1 ) 1 / β 0 exp { 1 2 q β Γ ( 1 β ) β cos ( π β / 2 ) } d q ,
and therefore
| I | K Γ ( 1 / β ) π β ( t 1 ) 1 / β 1 2 Γ ( 1 β ) β cos ( π β / 2 ) 1 / β .
Using the inequality cos ( π β / 2 ) > 1 β and Lemma 1 yields the estimate
| I | 3 2 K ( t 1 ) 1 / β 2 1 / β .
We assume that p ( x ) is continuously differentiable and p ( 0 ) = 0 . Then in domain III,
| ϕ T ( q ) | 1 | q | 0 | p ( y ) | d y
and
| I I I | q C 2 h 1 / β 2 π q 1 q h 1 / β 0 | p ( y ) | d y ( t 1 ) / h d q
= 2 h π ( t 1 ) ( h 1 / β ) ( t 1 ) / h ( h 1 / β ) ( t 1 ) / h 0 | p ( y ) | d y / C 2 ( t 1 ) / h .
Thus,
| I I I | 2 h π ( t 1 ) 0 | p ( y ) | d y / C 2 ( t 1 ) / h .
Choosing
C 2 = max C 1 , 2 0 | p ( y ) | d y ,
we obtain
| I I I | 2 h π ( t 1 ) 2 ( t 1 ) / h .
Thus, for t 3 , any h 1 and K 1 ,
| I I I | 1 8 K ( t 1 ) 1 / β 2 1 / β ,
which is bounded by 1 / 12 of the estimate of the main term | I | .
Finally, to work with II, we use Proposition 2 to conclude that | ϕ T ( q ) | ϰ C 1 < 1 for | q | C 1 . In our case,
ϰ C 1 = 1 1 2 B + π / C 1 p ( x ) d x = 1 1 2 B + π / C 1 x 1 β d x = 1 1 2 β ( B + π / C 1 ) β .
Then in II,
| ϕ Φ t h ( q ) | = | ϕ T ( q h 1 / β ) | [ t / h ] ϰ C 1 ( t 1 ) / h .
Therefore,
| I I | 2 π ϰ C 1 ( t 1 ) / h C 1 h 1 / β C 2 h 1 / β d q q = 2 π ϰ C 1 ( t 1 ) / h ln C 2 C 1 .
Thus, the second and the third integrals are exponentially small for large t uniformly for h 1 . Moreover, if t 0 3 is such that
2 π ϰ C 1 ( t 0 1 ) ln C 2 C 1 1 8 ( t 0 1 ) 1 / β 2 1 / β ,
then | I I | + | I I I | is bounded by 1 / 6 of the estimate of the main term | I | yielding the required estimate for the exponentially small remainder ω ( t 1 ) . Finally, estimating t / ( t 1 ) 2 , yields (63). □

7. Proof of Theorem 3

Let us prove (19), as other estimates are proved quite analogously. If t 1 and β ( 1 β ) / β , then by (13),
sup K > 0 sup 1 s t | P ( Φ s h K ) P ( Σ ^ s β < K ) | C ( β ) ( h 1 β t ) β / ( β + 1 ) ,
with a constant C ( β ) given explicitly in (13). We shall use this estimate for t Ω with some large Ω > 0 to be chosen later. For t > Ω , we shall estimate the probabilities on the left-hand side of (72) via tail estimates.
Namely, by (63), for t t 0 ,
P ( Φ t h < K ) 2 1 + 2 / β K t 1 / β
and by (38)
P ( Σ ^ t β K ) 1.5 K t 1 / β .
Thus,
sup k K sup t Ω | P ( Φ t h K ) P ( Σ ^ t β < K ) | 2 1 + 2 / β K Ω 1 / β .
Consequently,
sup k K sup s 1 | P ( Φ s h K ) P ( Σ ^ s β < K ) | C ( β ) ( h 1 β Ω ) ) β / ( β + 1 ) + 2 × 2 2 / β K Ω 1 / β .
Choosing now
Ω = h ϵ , ϵ = β ( 1 β ) 1 + β + β 2 ,
we obtain
sup k K sup s 1 | P ( Φ s h K ) P ( Σ ^ s β < K ) | C ˜ ( β , K ) h ϵ / β ,
with
C ˜ ( β , K ) = C ( β ) + 2 × 2 2 / β K ,
whenever h ϵ 1 / t 0 . This implies (19).
To obtain similar estimates for (22), one uses estimates (12) and (14).
Finally, to prove (23), let us again consider the case β ( 1 β ) / β for definiteness. Let us decompose the integral
I = 0 | P ( Φ s h K ) P ( Σ ^ s β < K ) | d s
into the two parts I + I I , over the domains { s Ω = h ϵ } and { s > Ω } with some ϵ > 0 . Then the integrand is bound (up to a constant) by
( 1 + K 1 ) ( h 1 β s ) β / ( β + 1 )
in the first domain and by K s 1 / β in the second domain. Integrating, we obtain the estimate
I ( 1 + K 1 ) h ( 1 β ) β / ( β + 1 ) h ϵ [ 1 + β / ( β + 1 ) ] + K h ϵ ( 1 β ) / β .
Choosing
ϵ = β 2 ( 1 β ) 1 + β + β 2 ,
we obtain the estimate
I C ( β ) h β ( 1 β ) 2 / ( 1 + β + β 2 )
implying (23).

8. Proof of Theorem 4

For definiteness, let us consider the case with β 1 / 2 , other cases being quite analogous.
We have
E U h N t h / h f E F σ t f I + I I ,
with
I = E U h N t h / h f E F N t h f , I I = E F N t h f E F σ t f .
To estimate I, we write
I = 0 ( U h [ s / h ] f F s f ) μ t h ( d s ) = 0 z ( U h [ s / h ] f F s f ) μ t h ( d s ) + z ( U h [ s / h ] f F s f ) μ t h ( d s ) ,
where μ t h is the distribution of N t h .
By Proposition 1, the first term here is bounded in magnitude by
h ω f D e m z / z ,
and, by Proposition 6, the second term is bounded by
2 f P ( N t h > z ) = 2 f P ( Φ z h < t ) 2 2 + 2 / β t z 1 / β f .
Thus,
| I | [ h ω e m z / z + 2 2 + 2 / β t z 1 / β ] f D .
Choosing z = min ( 1 , ω / m ) ln ( 1 / h ) yields
| I | f D [ h ω ω max ( 1 , m / ω ) ln ( 1 / h ) 1 + 2 2 + 2 / β t ln ( 1 / h ) 1 / β ( max ( 1 , m / ω ) ) 1 / β ]
4 ( t + 1 ) ln ( 1 / h ) 1 f D ( 4 max ( 1 , m / ω ) ) 1 / β .
Integrating by parts in II, we obtain the following:
I I = E e N t h L f E e σ t L f
= 0 s ( e s L f ) ( P ( σ t s ) P ( N t h s ) ) d s
= 0 L e s L f ( P ( Σ ^ s β > t ) P ( Φ s h > t ) ) d s
L f 0 | P ( Σ ^ s β t ) P ( Φ s h t ) | d s .
Consequently, by (23),
I I l f D ( 1 + t + t 1 ) C ( β ) h ϰ ( β ) .
Since the logarithmic decay of integral I is more rough than the power decay of II, estimate (26) follows.
Finally, if m = 0 , then
| I | [ h ω z + 2 2 + 2 / β t z 1 / β ] f D ,
which is of order h ω / ( β + 1 ) (obtained by choosing z = h ω β / ( β + 1 ) ). Choosing further the worst power estimate from I and I I , completes the proof.

Funding

The paper was published with the financial support of the Ministry of Education and Science of the Russian Federation as part of the program of the Moscow Center for Fundamental and Applied Mathematics under the agreement 075-15-2022-284.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Borovkov, A.A. On the rate of convergence for the invariance principle. Theory Probab. Appl. 1974, 18, 207–225. [Google Scholar] [CrossRef]
  2. Dudley, R.M. Speeds of metric probability convergence. Z. Wahrschein1ichkeitstheorie Verw. Geb. 1972, 22, 323–332. [Google Scholar] [CrossRef]
  3. Sakhanenko, A.I. On Borovkov’s estimate in the Invariance Principle. Sib. Electron. Mat. Izv. 2019, 16, 1776–1784. [Google Scholar] [CrossRef]
  4. Antoniou, M.; Melbourne, I. Rate of Convergence in the Weak Invariance Principle for Deterministic Systems. Commun. Math. Phys. 2019, 369, 1147–1165. [Google Scholar] [CrossRef]
  5. Hafouta, Y. Convergence Rates in the Functional CLT for α-Mixing Triangular Arrays. Available online: https://arxiv.org/abs/2107.02234v3 (accessed on 1 January 2020).
  6. Avram, F.; Taqqu, M.S. Weak convergence of sums of moving averages in the α-stable domain of attraction. Ann. Probab. 1992, 20, 483–503. [Google Scholar] [CrossRef]
  7. Kuske, R.; Keller, J.B. Rate of convergence to a stable limit. SIAM J. Appl. Math. 2001, 61, 1308–1323. [Google Scholar]
  8. Chen, P.; Xu, L. Approximation to stable law by the Lindeberg principle. J. Math. Anal. Appl. 2019, 48, 123338. Available online: https://arxiv.org/abs/1809.10864 (accessed on 1 January 2020). [CrossRef]
  9. Johnson, O.; Samworth, R. Central limit theorem and convergence to stable laws in Mallows distance. Bernoulli 2005, 11, 829–845. [Google Scholar] [CrossRef]
  10. Tyran-Kaminska, M. Functional limit theorems for linear processes in the domain of attraction of stable laws. Statist. Probab. Lett. 2010, 80, 975–981. [Google Scholar] [CrossRef]
  11. Basrak, B.; Krizmanić, D.; Segers, J. A functional limit theorem for dependent sequences with infinite variance stable limits. Ann. Probab. 2012, 40, 2008–2033. [Google Scholar] [CrossRef]
  12. Bening, V.E.; Korolev, V.Y.; Kolokoltsov, V.N. Limit theorems for continuous-time rasndom walks in the double-array scheme. J. Math. Sci. 2006, 138, 5348–5365. [Google Scholar] [CrossRef]
  13. Montroll, E.W.; Weiss, G.H. Random Walks on Lattices, II. J. Math. Phys. 1965, 6, 167–181. [Google Scholar] [CrossRef]
  14. Kolokoltsov, V.; Korolev, V.; Uchaikin, V. Fractional Stable Distributions. J. Math. Sci. 2001, 105, 2570–2577. [Google Scholar] [CrossRef]
  15. Meerschaert, M.M.; Scheffler, H.-P. Limit Theorems for Continuous-Time Random Walks with Infinite Mean Waiting Times. J. Appl. Prob. 2004, 41, 623–638. [Google Scholar] [CrossRef]
  16. Meerschaert, M.M.; Sikorskii, A. Stochastic Models for Fractional Calculus; De Gruyter Studies in Mathematics; De Gruyter: New York, NY, USA, 2012; Volume 43. [Google Scholar]
  17. Zaslavsky, G.M. Fractional kinetic equation for Hamiltonian chaos. Physica D 1994, 76, 110–122. [Google Scholar] [CrossRef]
  18. Kolokoltsov, V.N. Generalized Continuous-Time Random Walks (CTRW), Subordination by Hitting Times and Fractional Dynamics. Theory Probab. Appl. 2009, 53, 594–609. [Google Scholar] [CrossRef]
  19. Bening, V.E.; Korolev, V.Y.; Koksharov, S.; Kolokoltsov, V.N. Convergence-rate estimates for superpositions of independent stochastic processes with applications to estimation of the accuracy of approximation of the distributions of continuus-time random Markov walks by fractional stable laws. J. Math. Sci. 2007, 146, 5950–5957. [Google Scholar] [CrossRef]
  20. Kolokoltsov, V.N. Markov Processes, Semigroups and Generators; DeGruyter Studies in Mathematics v. 38; DeGruyter: Berlin, Germany; New York, NY, USA, 2011. [Google Scholar]
  21. Kolokoltsov, V.N. Differential Equations on Measures and Functional Spaces; Birkhäuser Advanced Texts Basler Lehrbücher: Cham, Switzerland, 2019. [Google Scholar]
  22. Uchaikin, V.V.; Saenko, V.V. Stochastic solution to partial dfferential equations of fractional orders. Sib. Zh. Vychisl. Mat. 2003, 6, 197–203. [Google Scholar]
  23. Kolokoltsov, V.; Lin, F.; Mijatovic, A. Monte Carlo estimation of the solution of fractional partial differential equations. Fract. Calc. Appl. Anal. 2021, 24, 278–306. [Google Scholar] [CrossRef]
  24. Lv, L.; Wang, L. Stochastic representation and monte carlo simulation for multiterm time-fractional diffusion equation. Adv. Math. Phys. 2020, 2020, 1315426. [Google Scholar] [CrossRef]
  25. Vabishchevich, P.N. Numerical solution of nonstationary problems for a space-fractional diffusion equation. Fract. Calc. Appl. Anal. 2016, 19, 116–139. [Google Scholar]
  26. Uchaikin, V.V.; Zolotarev, V.M. Chance and Stability: Stable Distributions and Their Applications; Walter de Gruyter: Berlin, Germany; New York, NY, USA, 2011. [Google Scholar]
  27. D’Ovidio, M. On the Non-Local Boundary Value Problem from the Probabilistic Viewpoint. Mathematics 2022, 10, 4122. [Google Scholar] [CrossRef]
  28. Shevtsova, I.G. Estimates for the rate of convergence in the global CLT for generalized mixed Poisson distributions. Teor. Veroyatn. Primen. 2018, 63, 89–116. translation in Theory Probab. Appl. 2018, 63, 72–93. (In Russian) [Google Scholar]
  29. Batir, N. Inequalities for the gamma function. Arch. Math. 2008, 91, 554–563. [Google Scholar] [CrossRef]
  30. Ibragimov, I.A.; Linnik, Y.V. Indendent and Stationary Sequencs of Random Variables; Wolters-Noordhoff.Groningen: Groningen, The Netherlands, 1971. [Google Scholar]
  31. Zolotarev, V.M. One-Dimensional Stable Distributions; Nauka: Moscow, Russia, 1983; Engl. transl. in vol. 65 of Translations of Mathematical Monographs AMS, Providence, Rhode Island, 1986. (In Russian) [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kolokoltsov, V.N. The Rates of Convergence for Functional Limit Theorems with Stable Subordinators and for CTRW Approximations to Fractional Evolutions. Fractal Fract. 2023, 7, 335. https://doi.org/10.3390/fractalfract7040335

AMA Style

Kolokoltsov VN. The Rates of Convergence for Functional Limit Theorems with Stable Subordinators and for CTRW Approximations to Fractional Evolutions. Fractal and Fractional. 2023; 7(4):335. https://doi.org/10.3390/fractalfract7040335

Chicago/Turabian Style

Kolokoltsov, Vassili N. 2023. "The Rates of Convergence for Functional Limit Theorems with Stable Subordinators and for CTRW Approximations to Fractional Evolutions" Fractal and Fractional 7, no. 4: 335. https://doi.org/10.3390/fractalfract7040335

APA Style

Kolokoltsov, V. N. (2023). The Rates of Convergence for Functional Limit Theorems with Stable Subordinators and for CTRW Approximations to Fractional Evolutions. Fractal and Fractional, 7(4), 335. https://doi.org/10.3390/fractalfract7040335

Article Metrics

Back to TopTop