Approximation of Fractional Local Times: Zero Energy and Derivatives
Arturo Jaramillo, Ivan Nourdin, Giovanni Peccati

TL;DR
This paper investigates the asymptotic behavior of empirical processes from high-frequency fractional Brownian motion observations, especially in the zero energy case, introducing derivatives of local times as a novel analytical tool for the rough Hurst range.
Contribution
It introduces the use of derivatives of local times for analyzing fluctuations of high-frequency fBm, extending results to the challenging rough range H<1/3.
Findings
Established law of large numbers for empirical processes of fBm.
Derived second order limit theorems with explicit convergence rates.
Extended analysis to the rough H<1/3 range, previously underexplored.
Abstract
We consider empirical processes associated with high-frequency observations of a fractional Brownian motion (fBm) with Hurst parameter , and derive conditions under which these processes verify a (possibly uniform) law of large numbers, as well as a second order (possibly uniform) limit theorem. We devote specific emphasis to the `zero energy' case, corresponding to a kernel whose integral on the real line equals zero. Our asymptotic results are associated with explicit rates of convergence, and are expressed either in terms of the local time of or of its \blue{derivatives}: in particular, the full force of our finding applies to the `rough range' , on which the previous literature has been mostly silent. The {\color{black}use of the derivatives} of local times for studying the fluctuations of high-frequency observations of a fBm is new, and is the main…
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.
Approximation of fractional local times:
zero energy and derivatives
Arturo Jaramillo, Ivan Nourdin, Giovanni Peccati
Abstract.
We consider empirical processes associated with high-frequency observations of a fractional Brownian motion (fBm) with Hurst parameter , and derive conditions under which these processes verify a (possibly uniform) law of large numbers, as well as a second order (possibly uniform) limit theorem. We devote specific emphasis to the ‘zero energy’ case, corresponding to a kernel whose integral on the real line equals zero. Our asymptotic results are associated with explicit rates of convergence, and are expressed either in terms of the local time of or of its derivatives: in particular, the full force of our finding applies to the ‘rough range’ , on which the previous literature has been mostly silent. The use of the derivatives of local times for studying the fluctuations of high-frequency observations of a fBm is new, and is the main technological breakthrough of the present paper. Our results are based on the use of Malliavin calculus and Fourier analysis, and extend and complete several findings in the literature, e.g. by Jeganathan (2004, 2006, 2008) and Podolskij and Rosenbaum (2018).
Key words and phrases:
Fractional Brownian motion, Malliavin calculus, local time, derivatives of the local time, high frequency observations, functional limit theorems.
2010 Mathematics Subject Classification:
60G22,60H07, 60J55, 60F17
1. Introduction
1.1. Overview
Let be a fractional Brownian motion (fBm) with Hurst parameter (see Section 2 for technical definitions). The aim of this paper is to study the asymptotic behaviour (as ) of empirical processes derived from the high-frequency observations of , that is, of mappings with the form
[TABLE]
where is a real-valued kernel, , and is a numerical sequence satisfying . Our specific aim is to study the first and second order fluctuations of such random functions, with specific emphasis on the ‘rough range’ — see Section 1.4 for a discussion about the relevance of such a set of values.
Our approach is based on the use of Malliavin calculus and Fourier analysis, and makes use of the derivatives of the local time of (see Section 5). The existence of local times derivatives for fBm was first established in [15, Section 28], partially building on the findings of [8]: several novel properties of these bivariate random fields are proved in Section 5 of the present paper. Our use of the derivatives of local times of is close in spirit to the study of derivatives of self-intersection local times, which was initiated by Rosen in [42] for the Brownian motion, and further developed by Markowsky [30] and Jung et al. [29] for the fractional Brownian motion case (see also [18] for the case of a self-intersection of independent fractional Brownian motions and [31] for related results on the Brownian sheet). The derivatives of the local time for a fractional Ornstein Uhlenbeck process are formally discussed in [19].
We briefly observe that values of the Hurst parameter in the range have recently become relevant for stochastic volatility modelling — see e.g. [16].
1.2. Statistical motivations and the semimartingale case
In the last three decades, the study of processes such as (1.1) (for a generic stochastic process, whose definition possibly depends on ) has gained particular traction in the statistical literature, since these random functions emerge both as natural approximations of the local time of , and (after a suitable change of variable in the sum) as scaled version of kernel estimates for regression functions in non-stationary time-series — see e.g. [1, 2, 10, 11, 17, 22, 23, 28, 35, 37, 38, 44, 45] for a sample of the available literature on these tightly connected directions of research. When is a diffusion process or, more generally, a semimartingale, the fluctuations of are remarkably well understood: a typical result in such a framework states that, under adequate assumptions, converges uniformly in probability over compact intervals towards a process of the type where is a scalar and is the local time of at , up to time . Moreover, when suitably normalized, the difference stably converges (as a stochastic process) towards a mixture of Gaussian martingales. The latter result is particularly useful for developing testing procedures. See e.g. [22, Theorems 1.1 and 1.2] for two well-known representative statements, applying to the case where is a Brownian semimartingale. We also mention that, in the limit case , the statistic has been used in [3] for estimating occupation time functionals for .
1.3. Local times
Let be a generic real-valued stochastic process defined on a probability space . We recall that, for and , the local time of up to time at is formally defined as
[TABLE]
where denotes the Dirac delta function. A rigorous definition of is obtained by replacing by the Gaussian kernel and taking the limit in probability as (provided that such limit exists). The random variable is a recurrent object in the theory of stochastic processes, as it naturally arises in connection with several fundamental topics, such as the extension of Itô’s formula to convex functions, the absolute continuity of the occupation measure of with respect to the Lebesgue measure, and the study of limit theorems for additive functionals of — see [6, 7, 12, 15, 21, 41] for some general references on the subject. It is a well-known fact (see e.g. [6, 7, 15]) that, if is a fBm with Hurst parameter , then the local time (1.2) exists for every . Moreover, by Theorems 3.1 and 4.1 in [4], the application admits a jointly continuous modification such that the mapping is -a.s. locally -Hölder continuous for every , and one has the following well-known occupation density formula: for every Borel set and every ,
[TABLE]
See also Lemma 5.3 below. The functional limit theorems evoked in the previous Section 1.2 can be regarded as natural extensions of the classical contributions [43] by Skorokhod, [14] by Erdös and Kac, and [27] by Knight, that established the convergence of (1.1) towards a scalar multiple of the Brownian local time, in the case where is either a random walk or a Brownian motion. See also Borodin [10].
1.4. The fractional case
The starting point of our analysis is the influential paper by Jeganathan [24], focussing on the case where, in (1.1), one has that , with a discrete-time process, and a normalising sequence such that converges in distribution to an -stable Lévy motion, for some . In the case , the results of [24] enter the framework of the present paper: in particular, [24, Theorem 4] yields that, if is a fractional Brownian motion with Hurst parameter and , then, for every and every ,
[TABLE]
A continuous version of (1.3) can be inferred from [24, Theorem 5], stating that, under the exact same assumptions on ,
[TABLE]
One sees immediately that (1.3) and (1.4) imply a trivial conclusion in the case of a ‘zero-energy’ function , that is, when (we borrowed the expression ‘zero-energy’ from reference [46], that we find particularly illuminating on the matter).
A refinement of (1.4) in the zero-energy case was first obtained in [25, Theorem 1], where it is proved that, if
[TABLE]
then, as ,
[TABLE]
where is a Brownian motion independent of , is an explicit constant (depending on and ), and indicates convergence in distribution in the Polish space . In the case , a similar statement can be deduced as a special case of [36, Theorem 1] (see also [20]), implying that the functional convergence (1.6) continues to hold if and . We also notice that the results from [20, 24, 36] are all extensions of the well-known Papanicolau-Stroock-Varadhan Theorem, as stated e.g. in [41, Theorem XIII-(2.6) and Proposition XIII-(2.8)].
An extension of (1.3), in the zero energy case and for , was obtained in [26, Theorem 4], where it is shown that, if , for , and , then, as ,
[TABLE]
where indicates convergence in the sense of finite-dimensional distributions. Although we did not check the details, it seems reasonable that the finite-dimensional convergence in [26, Theorem 4] can be lifted to convergence in the Skorohod space , for every , and that the conditions on can be relaxed so that they match (1.5).
We finally observe that the limit result (1.3) has been recently extended (in a fully functional setting) in [40, Theorem 1.1] to the case of sequences of the type (1.1), where the summand is replaced by a more general bivariate mapping f\big{(}n^{H}(X_{\frac{i-1}{n}}-\lambda),n^{H}(X_{\frac{i}{n}}-X_{\frac{i-1}{n}})\big{)}. It is interesting to notice that the arguments used in the proof of [40, Theorem 1.1] yield that the convergence (1.3) also holds uniformly in probability on compact intervals.
1.5. A representative statement
One of the crucial aims of the present paper is to explore in full generality the asymptotic behaviour of (1.1), in the case where has zero energy, and is a fBm with Hurst parameter in the range . Apart from the critical case (to which our techniques do not apply), this exactly corresponds to the values of that are not covered by the references [20, 25, 26, 36] discussed in the previous section. As anticipated, one of the methodological breakthroughs of our work is the use of the derivatives of the local times of ; the existence of such objects, as well as some of their basic properties, is discussed in Section 5.
Remark 1.1**.**
As already recalled, the existence of derivatives (DLT) for local times of fBm (with a suitably small Hurst parameter) was first proved in [15, Section 28], by using the general results of [8]. In this manuscript, our results concerning such a topic (see Lemma 5.3 in the Appendix) differ from those of the existing literature in several ways: (i) we introduce the DLT, not as an almost sure derivative of the local time with respect to the space variable, but rather as the limit a of a suitable sequence of approximating variables under the topology of , which is the most natural framework for the purpose of our application (additionally, in order to make the comparison with the results from [15] and [8] more transparent, in Lemma 5.3 we prove that our definition of DLT and the one from [15] are equivalent); (ii) we provide sharp conditions for the existence of the DLT, which allows us to use it under situations more general than those presented in [15]; (iii) we determine the time regularity of the DLT, which is a key ingredient for lifting our finite-dimensional results for to a functional level.**
Our main findings are stated in full generality in Theorem 1.5 and Theorem 1.9 below, and require a non negligible amount of further notation, introduced in Section 1.7. In order to motivate the reader, we will now state some immediate consequences of such general statements, that directly capture the spirit of our work. In particular, the forthcoming Theorem 1.1 illuminates the meaning of the threshold observed in [20, 25, 26, 36], by connecting such a value to the existence of derivatives for the local time of .
Theorem 1.1** (Special case of Theorems 1.5 and 1.9).**
Let denote a fBm with Hurst parameter . Let be a continuous function with compact support satisfying . Then, admits a unique antiderivative verifying . Writing , the following conclusions (1)–(4) hold, as .
- (1)
For every , the first derivative of the local time of (defined as in Section 1.7), noted , exists, verifies for every and , and moreover
[TABLE]
for every , where the constant involved in the ‘ ’ notation possibly depends on .
- (2)
For every , one has also that, for every ,
[TABLE]
where stands for convergence in probability.
- (3)
Fix and assume that , where . Then , the second derivative of the local time of , written , exists, verifies for every and , and
[TABLE]
for every .
- (4)
For every , the asymptotic relation at Point (3) takes also place in the sense of uniform convergence in probability over compact intervals.
The contents of Lemma 5.3 and Lemma 5.5 below implies that, for every , the derivative exists if and only if . We will see later on (Corollary 1.2) that our findings can also be used in order to study the fluctuations of Jeganathan’s limit result (1.3) in the case .
Remark 1.2**.**
Combining (1.8) with e.g. (1.7) one sees that, choosing and in (1.1), the correct normalisation in the zero energy case is given by , whereas for the normalisation has to be . The two exponents and coincide for the critical value . As anticipated, the study of (1.1) for is outside the scope both of our techniques (since in this case, the derivative of the local time of is not well-defined, by virtue of Lemma 5.5 in the Appendix), and of those of [20, 25, 26, 36] (e.g., since the constant appearing in (1.6) and (1.7) equals infinity, see [25, 26] as well as [36, Theorem 1.1]). **
1.6. Some heuristic considerations
In order to make more transparent the connection between (1.1) and the derivatives of the local time of , we present here some heuristic argument. First of all, as already observed, if the function appearing in (1.3) is such that , then the right hand side of (1.3) is equal to zero, which implies that the normalization is not adequate for deducing a non trivial limit. Notice that all functions of the form with satisfy the property (see indeed Remark 1.6(a) for a proof), which suggests that, in order to have a non-trivial limit for (1.1), one must distinguish the case where is the weak derivative of an integrable function or, more generally, the case where it is the weak derivative of order of such a function. With this in mind, for all function with weak derivatives of order and all , we define
[TABLE]
with the convention that the above sum is equal to zero when . We observe that the definition of in (1.10) is unambiguously given, even if the weak derivative is only defined up to sets of zero Lebesgue measure, since the argument is a random variable whose distribution has a density, for every . Now, at a purely heuristic level, we can write
[TABLE]
which, by a formal integration by parts, yields
[TABLE]
where the random variable (when it exists) is given by
[TABLE]
From here we can conjecture that under suitable hypotheses, the sequence converges to a scalar multiple of . However, one should observe that the approximation (1.11) can only be true under special conditions, in order for it to be consistent with the results evoked in Section 1.4. One should also notice that the above heuristic is based on the use of the generalized function , which makes computations very hard to be rigorously justified. To overcome this difficulty, we use the Fourier representation , and the Fourier inversion formula to rewrite and as a mixture of terms of the form and . Such a representation will facilitate algebraic manipulations, in view of the Gaussianity of .
In addition to the verification of the conjecture above, on the limit of , it is interesting to address the following natural problems arising from the approximation (1.11).
- (i)
Provided that has a non-trivial limit, what is the nature of the fluctuations of around such a limit? 2. (ii)
If we are interested in estimating with a suitable normalization of the statistic , how do we choose in order to minimize the associated mean-square error?
The behavior of will be described in Theorem 1.5, while the answer to (i) and (ii) will be provided in Theorem 1.9 and Remark 1.11, respectively. Before presenting the precise statement of our results, we need to introduce some further notation and definitions.
1.7. Further notation
Let be a non-negative integer satisfying . By Lemma 5.3 in the Appendix, for every fixed , the collection of processes
[TABLE]
converges pointwise in as goes to zero, to a limit process that has a modification with Hölder continuous trajectories (in the variable ) of order , for all . In this paper, the resulting continuous modification is called the derivative of order of the local time of at . Further properties for the process will be presented in Section 2.3
Remark 1.3**.**
The variable is of course the local time of at and it has been widely studied (see [12, 7, 15, 21]). The forthcoming Lemma 5.3 provides a range of values of for which the variable exists as the limit in of a suitable mollification, for (see also [15, Section 28]). In addition to this existence result, in Lemma 5.5 we prove that the condition is sharp, in the sense that if , then doesn’t converge in . Finally, in Lemma 5.5 we prove that can be regarded as the space derivative of with respect to the -topology; this observation yields that the random mapping introduced above coincides — up to the choice of a suitable modification — with the definition of the a.s. spatial derivative of the local time of used in [15, Section 28].**
For and , we will denote by the set of functions with weak derivatives of order , such that for all . We will endow with the norm given by
[TABLE]
Define the function by
[TABLE]
For a given and a non-negative integer , we will denote by the collection
[TABLE]
Finally, for a fixed function and a positive constant , we set
[TABLE]
Remark 1.4**.**
For every , one has clearly that , where the inclusion is strict. This implies that our forthcoming statements (in particular, relation (1.13) in the case ) contain a version of Jeganathan’s limit theorem (1.3) under slightly more stringent assumptions. Nonetheless, we stress that (1.3) is a purely qualitative statement, whereas the forthcoming estimate (1.13) also displays an explicit upper bound on the mean-square difference between the two terms. **
1.8. Main results
We now present one of the main results of the paper, which is a functional law of large numbers for .
Theorem 1.5**.**
If and is such that , then for all there exists a constant independent of and , such that
[TABLE]
In addition, the processes satisfy the following functional convergences:
- (i)
If and ,
[TABLE] 2. (ii)
If and , then
[TABLE] 3. (iii)
If , and , then
[TABLE]
Remark 1.6** (Consistency between different values of ).**
- (a)
If , then and its weak derivatives are integrable. An application of dominated convergence and of Rodrigues’ formula for Hermite polynomials consequently yields that, for ,
[TABLE]
where indicates the sequence of Hermite polynomials, and
[TABLE]
- (b)
From the definition of it easily follows that, for and for ,
[TABLE]
In view of Point (a), such a relation is consistent with the content of Theorem 1.5. Indeed, combining Point (a) with Theorem 1.5 we infer that, for and ,
[TABLE]
as , where the convergence takes place in ; one sees immediately that the relation , for every , is also a direct consequence of the fact that
[TABLE]
which one can deduce from Theorem 1.13.
Remark 1.7** (Regarding uniform convergence in Theorem 1.5).**
Using Dini’s theorem, we can easily check that the pointwise convergence of towards implies its uniform convergence over compact subsets of . To verify this claim, it suffices to write
[TABLE]
where and . Both and are increasing in and converge pointwise in probability to continuous processes, which implies that they converge uniformly, by virtue of Dini’s theorem. Unfortunately, this argument does not work in the general case . To check this, consider the test function . In this instance, the analog of the decomposition (1.18) is
[TABLE]
Notice that , and thus, by inequality (1.13), the terms and diverge to infinity while converges in . This prevents us from using the decomposition (1.19) for analyzing the uniform convergence of . For this reason, instead using Dini’s theorem, we tackle the tightness property for the case by means of the Billingsley’s criterion (see [9, Theorem 12.3]). Due to the high level difficulty of the application of this methodology, we were only able to prove uniform convergence either over compact subsets of in the general case or over compact subsets of in the more restrictive case . We conjecture that the uniform convergence over compact subsets of in the general case can eventually be shown by finding a suitable estimation on the moments of arbitrarily large order for the increments of .**
Remark 1.8**.**
Theorem 1.5 provides a full description of all the possible pointwise limits in probability of the high-frequency observations , provided that the index associated to satisfies the condition . However, it is still unclear to us what is its behavior in the case and , so we have left this interesting problem open for future research. **
The following result describes the limit behavior for the error associated with the convergences stated in Theorem 1.5, under suitable conditions on and .
Theorem 1.9**.**
If and is such that , then for all , there exists a constant independent of and , such that
[TABLE]
where . In addition, the processes satisfy the following functional convergences:
- (i)
If , then
[TABLE] 2. (ii)
If and , then
[TABLE]
Remark 1.10**.**
In the case where satisfies as approaches to infinity, we have that
[TABLE]
Thus, in this situation we can obtain Theorem 1.9 from Theorem 1.5, by replacing by and by . Notice however that there are examples of test functions satisfying (take for instance ), in such a way the above argument does not provide an equivalence between Theorems 1.9 and 1.5.**
As anticipated, the next statement shows that Theorem 1.9 in the case yields a second order counterpart to Jenagathan’s result (1.3), in the range . The case is outside the scope of the techniques developed in the present paper: we prefer to think about this issue as a separate problem, and leave it open for future research.
Corollary 1.2**.**
Fix , consider such that , and fix such that . Then, the convergence (1.3) takes place for every , and moreover, as ,
[TABLE]
Remark 1.11**.**
In general, if we are interested in estimating with the statistic
[TABLE]
for , it is relevant to choose in such a way that the -norm of the error is as small as possible. This problem is closely related to Theorem 1.9, due to the fact that under the condition , the convergence
[TABLE]
implies that the -norm of is of the order . Consequently, the value of that optimizes the rate at which converges to in is .**
1.9. Plan
The rest of the paper is organized as follows: In Section 2 we present some preliminary results on the fractional Brownian motion, Malliavin calculus and local non-determinism. In Sections 3 and 4 we prove Theorems 1.5 and 1.9. Finally, in Section 5 we present some results related to the properties of , and prove some technical identities for the proofs of Theorems 1.5 and 1.9.
Acknowledgments. We thank Mark Podolskij for a number of illuminating discussions. AJ is supported by the FNR grant R-AGR-3410-12-Z (MISSILe) at Luxembourg and Singapore Universities; GP is supported by the FNR grant R-AGR-3376-10 (FoRGES) at Luxembourg University.
2. Preliminaries
2.1. Malliavin calculus for classical Gaussian processes
In this section, we provide some notation and introduce the basic operators of the theory of Malliavin calculus. The reader is referred to [33, 34] for full details. Throughout this section, denotes a fractional Brownian motion defined on a probability space . Namely, is a centered Gaussian process with covariance function , where
[TABLE]
We denote by the Hilbert space obtained by taking the completion of the space of step functions over , endowed with the inner product
[TABLE]
The mapping can be extended to a linear isometry between and the linear Gaussian subspace of generated by the process . We will denote this isometry by , for . For any integer , we denote by and the -th tensor product of , and the -th symmetric tensor product of respectively. The -th Wiener chaos, denoted by , is the closed subspace of generated by the variables
[TABLE]
where is the -th Hermite polynomial, defined by
[TABLE]
For satisfying , and such that , we define the mapping It can be extended to a linear isometry between (equipped with the norm ) and (equipped with the -norm).
From now on, we assume that coincides with the -field generated by . By the celebrated chaos decomposition theorem, every element belonging to the space of -measurable, square-integrable random variables can be written as
[TABLE]
for some unique sequence such that . Notice that for every 2-dimensional centered Gaussian vector satisfying , we can find elements such that and . Consequently, by the isometry property of , we have that for all ,
[TABLE]
In what follows, for every integer , we will denote by
[TABLE]
the projection over the -th Wiener chaos . In addition, we denote by the expectation of . Let denote the set of all cylindrical random variables of the form
[TABLE]
where is an infinitely differentiable function with compact support and are step functions defined over . In the sequel, we refer to the elements of as “smooth random variables”. For every , the Malliavin derivative of order of with respect to is the element of defined by
[TABLE]
For and , the space denotes the closure of with respect to the norm , defined by
[TABLE]
The operator can be consistently extended to the space .
Let denote the space of square integrable random variables with values in . A random element belongs to the domain of the divergence operator , denoted by , if and only if it satisfies
[TABLE]
where is a constant only depending on . If , then the random variable is defined by the duality relationship
[TABLE]
which holds for every . The divergence satisfies the property that for all and belonging to the domain of such that , the -valued random variable belongs to the domain of and
[TABLE]
The reader is referred to [34, Proposition 1.3.3] for a proof of this identity. The operator is the unbounded operator from to given by the formula
[TABLE]
It is the infinitesimal generator of the Ornstein-Uhlenbeck semigroup , which is defined as follows
[TABLE]
Moreover, for any one has
[TABLE]
We also define the operator by
[TABLE]
Notice that is a bounded operator and satisfies for every , so that acts as a pseudo-inverse of . Assume that is an independent copy of such that are defined in the product space . Given a random variable , we can write , where is a measurable mapping from to , determined -a.s. Then, for every we have the Mehler formula
[TABLE]
where denotes the expectation with respect to . The operator can be expressed in terms of , as follows
[TABLE]
From (2.4)-(2.6) it follows that if for some and such that , then
[TABLE]
Consequently, we deduce from (2.3) that for all and all differentiable functions such that , the random variables and satisfy
[TABLE]
2.2. Properties of the covariance of Gaussian vectors
We next present some estimations for the increments of and identities for the determinant of covariance matrix of Gaussian vectors. We start with estimates that will be repeatedly used throughout the paper.
Lemma 2.1**.**
For all , there exists a constant only depending on , such that for all and satisfying ,
[TABLE]
Proof.
Since , we have that and have disjoint supports and
[TABLE]
which gives (2.10). To show (2.9), we observe that
[TABLE]
Using either that, if and all ,
[TABLE]
or that, if and ,
[TABLE]
the desired conclusion (2.9) follows. ∎
Next we describe some properties of the conditional variances of general Gaussian vectors. In the sequel, for all and all non-negative definite matrices , will denote the determinant of and will denote the centered Gaussian kernel of dimension with covariance , defined by
[TABLE]
Let be a centered Gaussian vector of dimension and covariance matrix , defined in . Denote by the -algebra generated by . If is a -measurable, square integrable random variable and is a subalgebra of , the conditional variance of given is the random variable defined by
[TABLE]
In the case where is generated by random variables , we will use the notation instead of . It is well known that in the case where are jointly Gaussian, the conditional variance is deterministic. Consequently, by using the fact that for every -algebras and satisfying , we have that
[TABLE]
In addition, the determinant of can be represented as
[TABLE]
This identity can be easily obtained by first expressing the probability density of as the product of the conditional densities of its components, and then evaluating at zero the resulting decomposition.
Finally we recall the sectorial local non-determinism property for the fractional Brownian motion, which states that there exists a constant , only depending on , such that for all and ,
[TABLE]
where .
2.3. Fourier representation for the derivatives of the fBm
In Lemma 5.5, it is proved as well that the local time and its derivatives can be represented as
[TABLE]
meaning that, as , the sequence , converges in to . Notice that the type of limit appearing in the representation (2.14) belongs to the class of functions of the form
[TABLE]
where and is such that is absolutely integrable over for all , and the limit (2.15) exists in the sense. For convenience on the notation, we will denote the limit of (2.15) simply by
[TABLE]
We will often require bounds on the -norms of expressions of the form (2.16). These type of estimations can be obtained in the following way: for a given , we can write
[TABLE]
where is the covariance matrix of and , and . Thus, provided that is integrable over , by the dominated convergence theorem we have that
[TABLE]
Taking this discussion into consideration, in the sequel we will adopt the notation (2.16) for describing the limit (2.15) and use the formula (2.17) for describing the associated moment of order 2.
We are now ready for the proofs Theorems 1.5 and 1.9, which will be presented in the following two sections.
3. Proof of Theorem 1.5
Suppose that . In the sequel, for every integrable function , we denote by its Fourier transform.
The proofs of (1.13)-(1.16) rely on a suitable decomposition of the process , which we describe next. By the Fourier inversion formula, for all we have that
[TABLE]
Thus, using the fact that
[TABLE]
we get that
[TABLE]
As a consequence,
[TABLE]
Using (3) as well as the Fourier representation (2.14) of , we get that
[TABLE]
Let us define and \sigma_{i,s}^{2}:=\text{Var}[\Delta_{i,s}X]=\big{(}s-\frac{i-1}{n}\big{)}^{2H}. The difference of exponentials of the first term in the right hand side can be written as
[TABLE]
which by (3), leads to
[TABLE]
where
[TABLE]
Notice that the decomposition (3.5) reduces the problem of proving (1.13) to finding bounds for the -norm of for fixed and .
Moreover, assume for the moment that the proof of (1.13) is concluded, and also that we have shown that the family of processes
[TABLE]
is tight in the following two cases: (i) when regarded as a collection of random elements with values in (that is, the class of càdlàg mappings on endowed with the Skorohod topology, for some ), in the case where and , and (ii) when regarded as a collection of random elements with values in (for some ), in the case where either and or . Using that the finite dimensional distributions of the process (3.10) converge to those of the zero process by (1.13), and using the classical discussion contained in [9, p. 124] (see also [47]), we can therefore conclude that:
If , then
[TABLE] 2. -
If and , then
[TABLE]
Parts (i) and (ii) of Theorem 1.5 then follow from the fact that every sequence of random variables defined in such that for some deterministic , satisfies as well the convergence .
In order to examine the tightness property we distinguish between the cases and . In the case , the property follows from Remark 1.7 (Dini’s theorem). For handling the case we proceed as follows. Let fixed. By (3.5), it suffices to show that the processes
[TABLE]
are tight for . Notice that in order to prove such property, it suffices to show that the processes , with and , are tight. To verify this, we shall use the Billingsley criterion (see [9, Theorem 12.3]), in order to reduce the problem of proving tightness for (3.11), to showing that there exist constants such that for all and ,
[TABLE]
where is some constant only depending on and , and
[TABLE]
In what follows, to keep the length of this paper within bounds we concentrate only on the case where either and , or when is arbitrary and , which are two cases representative of the difficulty.
As a summary of the discussion above, we obtain that, in order to conclude the proof of Theorem 1.5, it remains to check that, with defined as
[TABLE]
then for all , there exists a constant only depending on , and , such that the following claims hold true:
For every , and all , we have that
[TABLE] 2. -
For every and ,
[TABLE] 3. -
For every and ,
[TABLE]
for some constant depending on , but not on and .
Indeed, the estimate (1.13) follows from (3.5) and (3.17). Moreover, if and , then by an application of (- ‣ 3) with and , we obtain
[TABLE]
for and , where is a constant independent of and . Then, using the fact that , we deduce that , which by (3.18) implies that the Billingsley criterion holds for , and . Similarly, if , then by (- ‣ 3),
[TABLE]
for , where is a constant independent of and . Then, using the fact that we deduce that , which by (3.19) implies that the Billingsley criterion holds for . Finally, by applying (3.16) with , we obtain the Billingsley condition for the process in the case , regardless of the value of .
It thus remain to prove (- ‣ 3)-(3.17). For proving (3.17) in the case , we use the inequality (5.23) in Lemma 5.3, as well as the fact that , to deduce that there exists a constant , such that for all ,
[TABLE]
Recall that , so that the power of in the right hand side satisfies the inequality . Relation (3.17) then follows from (3). To prove (3.16) we combine (5.23) in Lemma 5.3 with the inequality , to write
[TABLE]
as required. This finishes the proof of (3.16) and (3.17) in the case .
Next we prove (- ‣ 3) and (3.17) in the case . Take and notice that, by (3.7),
[TABLE]
where , , . The sum above can be decomposed as
[TABLE]
where
[TABLE]
and
[TABLE]
In order to bound the term above, we proceed as follows. First we notice that the expectation appearing in the right-hand side of (3) satisfies
[TABLE]
where denote the covariance matrix
[TABLE]
and are independent copies of . In order to bound the right hand side of (3.24), we observe that if and ,
[TABLE]
We deduce from (2.9) and the fact that that there exists a constant only depending on , such that
[TABLE]
Thus, using the fact that for every and ,
[TABLE]
we obtain
[TABLE]
Therefore, by using (3), (3.24) and (3),
[TABLE]
which by equation (5.15) in Lemma 5.2, implies that
[TABLE]
Using basic calculus techniques, we can show that there exists a constant only depending on , such that for all and ,
[TABLE]
By (3) and (3.31), there exists a constant such that
[TABLE]
Next we bound . To this end, we notice that by (3),
[TABLE]
Therefore, using equation (5.16) in Lemma 5.2, we get that
[TABLE]
Thus, using the fact that every such that , satisfies the inequality
[TABLE]
for some only depending on , we obtain
[TABLE]
Combining the previous inequality with (3.31), we obtain
[TABLE]
From (3.21), (3.34) and (3.38), we obtain
[TABLE]
Relations (- ‣ 3) and (3.17) for the case follow from (3.41).
Next we prove (- ‣ 3) and (3.17) the case . By (3.8),
[TABLE]
As before, we decompose this sum as
[TABLE]
where
[TABLE]
and
[TABLE]
To bound we proceed as follows. Let denote the covariance matrix of . Using the inequality
[TABLE]
valid for every , we deduce that
[TABLE]
Therefore, using Lemma 5.2, as well as the fact that , we get
[TABLE]
Thus, using (3.31) we get that
[TABLE]
For handling the term , the Fourier transform approach does not give sharp enough bounds, so we will undo the Fourier transform procedure in the following way: first we write
[TABLE]
where and are independent copies of . Then, by (3.1),
[TABLE]
Applying Cauchy-Schwarz in the previous inequality we deduce that
[TABLE]
The two expectations in the right-hand side can be bounded in the following manner
[TABLE]
and thus,
[TABLE]
Similarly, we have that
[TABLE]
Therefore, by (3), there exist such that
[TABLE]
where in the last inequality we used the condition . Combining the previous inequality with (3.35), we obtain
[TABLE]
Thus, by (3.31) we conclude that
[TABLE]
From (3.48) and (3.52), we conclude that
[TABLE]
Relations (- ‣ 3) and (3.17) in the case are obtained by combining (3.42), (3.48) and (3.53).
It thus remain to prove (- ‣ 3) and (3.17) in the case . Notice that by (3.9),
[TABLE]
Thus, we can write
[TABLE]
where
[TABLE]
To bound the term , we notice that
[TABLE]
for every . From here it follows that
[TABLE]
Consequently, by first applying equation (5.15) in Lemma 5.2 to the right hand side of (3.56), and then the condition , we get
[TABLE]
Combining the previous inequality with (3.31), we conclude that
[TABLE]
To handle the term , we use the bound (3.55) to get
[TABLE]
Thus, proceeding as before, we can apply equation (5.16) in Lemma 5.2 as well as (3.35), to obtain the inequality
[TABLE]
Thus, by (3.31) we get
[TABLE]
Combining (3.54), (3.59) and (3.63), we obtain
[TABLE]
which gives (- ‣ 3) and (3.17) in the case . The proof is now complete.
4. Proof of Theorem 1.9
Suppose that and let be such that . Define by (3.9). Using the identity
[TABLE]
we can show that
[TABLE]
where
[TABLE]
By applying the Fourier representation (2.14) in (4.1), and then combining the resulting identity with (3.5), we obtain
[TABLE]
where , for are given as in (3.6)-(3.8).
By proceeding as in the proof of Theorem 1.5 we deduce that, in order to prove Theorem 1.9, we are left to show that if is defined as
[TABLE]
then, for all , there exists a constant only depending on , and , such that the following claims hold true:
For every , and ,
[TABLE] 2. -
For every and ,
[TABLE] 3. -
For every and ,
[TABLE]
for some constant depending on , but not on and .
As in the proof of Theorem 1.5, to verify this simplification it suffices to prove (1.20) and show that there exist constants such that for all and ,
[TABLE]
where is some constant only depending on and .
Relation (1.20) follows from (4.2) and (4.7). Moreover, if and , then by an application of (- ‣ 4) with and , we obtain
[TABLE]
for and , where is a constant independent of and . Then, using the fact that , we deduce that , which by (4.9) implies that the Billingsley condition holds for . Similarly, if , then by (- ‣ 4),
[TABLE]
for , where is a constant independent of and . Then, using the fact that we deduce that , which by (4.10) implies that the Billingsley criterion holds for . Finally, by applying (4.6) with , we obtain the Billingsley condition for the process in the case , regardless of the value of . This finishes the proof of the simplification.
It thus remain to prove (- ‣ 4)-(4.7). In the sequel, we will assume that belong to a given interval of the form , with and will denote a generic constant only depending on , and that might change from line to line. For proving (4.7) in the case , we use the inequality (5.23) in Lemma 5.3, as well as the fact that , to deduce that there exists a constant , such that for all ,
[TABLE]
Recall that , so that the power of in the right hand side of (4) satisfies the inequality
[TABLE]
Relation (4.7) then follows from (4). To prove (4.6) in the case , we split our proof into the cases and . If , we combine (5.23) in Lemma 5.3 with the inequality , to write
[TABLE]
as required. On the other hand, if , by a further application of inequality (5.23) in Lemma 5.3, we get
[TABLE]
This completes the proof of (4.6) and (4.7) in the case .
For proving (- ‣ 4) and (4.7) the case , we need to rewrite in a suitable way the random variable
[TABLE]
appearing in the definition of . This can be done as follows: using (2.1), we can write
[TABLE]
Consequently, by (3.7), , where
[TABLE]
Thus, in order to bound , it suffices to estimate and .
First we handle the term . By the identity , we have that
[TABLE]
which implies that
[TABLE]
In order to estimate we proceed as follows. Notice that by (3.7), where
[TABLE]
Therefore, in order to estimate , it suffices to analyze the terms
[TABLE]
and
[TABLE]
where , and . First we bound the right-hand side of (4). To this end, we first write
[TABLE]
where
[TABLE]
and
[TABLE]
To bound the right hand side of (4), we notice that
[TABLE]
where is the covariance matrix given by (3.25). Using (3) and the fact that , we conclude that
[TABLE]
Consequently, by (4), (4.21) and (2.9),
[TABLE]
which by equation (5.15) in Lemma 5.2, implies that
[TABLE]
Therefore, using the inequality (3.31), as well as the condition , we conclude that
[TABLE]
Similarily, from (4) and (4.21), it follows that
[TABLE]
which by equation (5.16) in Lemma 5.2, implies that
[TABLE]
Therefore, by applying (3.35) with replaced by , we get
[TABLE]
An application of the inequality (3.31) and the condition then leads to
[TABLE]
Finally, by (4.18), (4.26) and (4.31) we obtain the bound
[TABLE]
Next we bound the term . By (2.10), for all and , it holds that
[TABLE]
Thus, by (4.17),
[TABLE]
By following the same arguments as in the proof of (4.23) and (4.28), we can apply inequality (5.15) in Lemma 5.2 to the indices in the right hand side of (4.33) satisfying , and inequality (5.16) to the indices satisfying satisfying , in order to obtain
[TABLE]
Using the previous inequality and the conditions , , we obtain
[TABLE]
and
[TABLE]
Notice that due to (3.31), (4.35) and condition , the previous inequality implies that
[TABLE]
From relations (4.32), (4) and the fact that , it follows that
[TABLE]
for some constant independent of and . In addition, by (4.32) and (4.36) we get
[TABLE]
Next we proceed with the problem of bounding . To this end, we use (4.14) to write
[TABLE]
which leads to
[TABLE]
where
[TABLE]
and
[TABLE]
Notice that
[TABLE]
Thus, by (2.9) we deduce that
[TABLE]
which by equation (5.15) in Lemma 5.2, leads to
[TABLE]
On the other hand, by first applying the integration by parts
[TABLE]
in (4), and then using (4.41) and (2.9), we get
[TABLE]
which by equation (5.16) in Lemma 5.2 the condition , yields
[TABLE]
Therefore, by (3.35) with replaced by , we get
[TABLE]
Combining this inequality with (4.39) and (4), we obtain
[TABLE]
which by (3.31) gives
[TABLE]
From (4), (4.37) and (4.44), it follows that for all ,
[TABLE]
for some constant independent of and . In addition, by (4), (4.38) and (4.44),
[TABLE]
To bound , we notice by (4.14) that
[TABLE]
where
[TABLE]
and
[TABLE]
By (2.9),
[TABLE]
Thus, by equation (5.15) in Lemma 5.2,
[TABLE]
and consequently, by relation (3.31) and condition ,
[TABLE]
On the other hand, by first using the integration by parts
[TABLE]
in (4) and then applying (2.9) and equation (5.16) in Lemma 5.2 to the resulting expression, we obtain
[TABLE]
Therefore, by applying inequality (3.35) with replaced by and condition , we get
[TABLE]
and consequently, by (3.31) and condition ,
[TABLE]
Finally, by (4.47), (4.51) and (4.54), we obtain
[TABLE]
Since , from (4.46), (4.45) and (4.57), we conclude that
[TABLE]
and
[TABLE]
This finishes the proof of (- ‣ 4) and (4.7) in the case
To handle the case , we reproduce the steps of the proof of (3.53), with replaced by , in order to show that
[TABLE]
Relations (- ‣ 4) and (4.7) follow from (4.62).
To handle the case , we reproduce the proof of (3.66), with the following modifications:
the index is replaced by ; 2. -
the variable is now replaced by ; 3. -
the terms and are replaced by and respectively; 4. -
the inequality (3.55) is replaced by
[TABLE]
By doing these modifications, we can easily show that
[TABLE]
Relations (- ‣ 4) and (4.7) in the case follow from (4.65). This finishes the proof of Theorem 1.9.
5. Appendix
In this section we investigate the existence and regularity of the derivatives of the local time of a fBm, and present the proofs of the technical lemmas that were used in Sections 3 and 4.
For the rest of the section, is a fBm with Hurst parameter .
Lemma 5.1**.**
Let , and be such that for all and . Denote by the covariance matrix of , with
[TABLE]
where are independent copies of . Then, if , we have that
[TABLE]
for some constant only depending on and .
Proof.
By the generalized Hölder inequality, we have that
[TABLE]
The terms of the product in the right hand side can be written in terms of conditional variances in the following way: define and denote by the probability density of a centered Gaussian random vector with covariance . Then, if ,
[TABLE]
for some only depending on . To bound we define as the covariance matrix
[TABLE]
Then, by using (2.12), we express the determinant in the form
[TABLE]
Therefore, if denotes the adjugate matrix of , we have that
[TABLE]
Combining (5.3) with (5.4), we obtain
[TABLE]
To bound the conditional variance in the right-hand side we proceed as follows.
If , then by the local non determinism property (2.13), there exists a constant only depending on , such that
[TABLE]
On the other hand, if , then by a further application local non determinism property (2.13),
[TABLE]
Using (5), as well as the the fact that for every ,
[TABLE]
we get
[TABLE]
By (5.5), (5.6) and (5.11), we get the bound
[TABLE]
It thus remains to bound the determinant . To this end, we use (2.2) to write
[TABLE]
where for convenience, we have used the notation . Notice that if , then by the local-non determinism property (2.13) and the condition ,
[TABLE]
On the other hand, if , then by the local-non determinism property (2.13) and the inequality (5.10),
[TABLE]
Thus, using the condition , we deduce that (5.14) holds as well in the case . Relation (5.1) follows from (5.12), (5) and (5.14). ∎
As a consequence of the previous lemma, we have the following result:
Lemma 5.2**.**
Let , and be such that , and . Denote by the covariance matrix of the Gaussian vector , defined by
[TABLE]
where are independent copies of . Then, for all , there exists a constant only depending on , and the Hurst parameter , such that
- (1)
If ,
[TABLE]
where . 2. (2)
If and ,
[TABLE]
Proof.
We first prove (5.15) in the case . Suppose without loss of generality that . By applying Lemma 5.1 in the case , , and , , we have that
[TABLE]
where in the second inequality we have used the fact that for every ,
[TABLE]
Notice that if , then and , which by (5) implies that
[TABLE]
Inequality (5.15) under the condition follows by combining the previous inequality with the fact that .
To prove (5.16) under the condition , we will assume without loss of generality that , and define
[TABLE]
Notice that is an upper bound for the integral in the left-hand side of (5.16). Consequently, in order to prove (5.16) it suffices show that
[TABLE]
Using Lemma 5.1, we can check that
[TABLE]
Hence, by (5.18),
[TABLE]
Relation (5.19) follows by integrating the right-hand side of the previous inequality. ∎
The next statement is one of the main technical contributions of the paper.
Lemma 5.3**.**
Let be such that . Then, for every and , as the random variables
[TABLE]
converge in to a limit , as . The limit random variable can be written in Fourier form as
[TABLE]
where the limit in the right hand side is understood in the sense of Moreover, if , we have that
[TABLE]
where the limit is understood in the -sense. In addition, for fixed and for all and , the process obtained as the pointwise limit in of , has a modification with Hölder continuous trajectories (in the variable ) of order and
[TABLE]
for all , where is a constant independent of and .
Remark 5.4**.**
The arguments used in the proofs of Lemma 5.3 and Lemma 5.5 also show that, for every fixed and , the variance of is strictly positive. **
Proof of Lemma 5.3.
It suffices to show that, for every pair of positive sequences such that , one has that, as , the sequence
[TABLE]
converges to a finite limit, independent of the choice of . To this end, we first write , for as
[TABLE]
For , denote by the covariance matrix of and by the diagonal matrix with and . From (5.24), it follows that
[TABLE]
where , . Notice that the integrand in (5.25) converges as and satisfies
[TABLE]
Moreover, by applying inequality (5.1) in Lemma 5.2, we have that
[TABLE]
The right hand side is of the previous inequality is finite due to the condition , and thus, by the dominated convergence theorem, we conclude that converges to a limit independent of the choice of .
To show (5.21), we define , for . By applying the Fourier inversion formula to the Gaussian kernel , we can easily check that
[TABLE]
and thus,
[TABLE]
where
[TABLE]
Since the third term in the right hand side of (5.27) converges to as , it suffices to show that and converge to zero in . Proceeding as in the proof of (5.25), we can easily show that
[TABLE]
Thus, using the fact that for all , we obtain
[TABLE]
which by (5.26), leads to . By following similar arguments, we can show that
[TABLE]
The integrand of the right-hand side is bounded by , which by (5.26) is integrable over and . Thus, by the dominated convergence theorem, , as required. This finishes the proof of (5.21).
Next we prove (5.22) in the case . Using the representation (5.21), we have that
[TABLE]
Proceeding as before, we can bound this -norm as follows
[TABLE]
Let be such that . Using the inequality
[TABLE]
which is valid for all , we conclude from (5.28) that
[TABLE]
By inequality (5.1) in Lemma 5.2, there exists a constant , such that
[TABLE]
for some constant . Thus, by the condition , we have that the right hand side of (5.29) is finite, which in turn implies that
[TABLE]
as required. This finishes the proof of (5.22).
Next we prove (5.23). To this end, we select a positive sequence converging to zero and, for , we write for simplicity. We use the convergence , valid for all , to write
[TABLE]
Assume without loss of generality that . The -norm in the right hand side of the previous inequality can be estimated by using the identity (5.24), which allows us to write
[TABLE]
This leads to
[TABLE]
where and . From here we can easily obtain
[TABLE]
where denotes the covariance matrix of . Therefore, by applying Lemma 5.1 with , and , we get
[TABLE]
Thus, by changing the coordinates by , we obtain
[TABLE]
By using the bound in the integral above, we obtain
[TABLE]
which in turn leads to
[TABLE]
By expanding the product above, we can write
[TABLE]
Due to the condition , the integrals in the right-hand side of (5.33) are finite and can be computed explicitly, leading to
[TABLE]
Relation (5.23) then follows from (5.30) and (5.34).
Finally, we prove that for all , the process has a Hölder continuous modification with exponent . By the condition , we have that for all , the exponent in the right hand side of (5.23) is strictly bigger than 1. The Hölder continuity of then follows from the Kolmogorov continuity criterion. ∎
The next statement is the announced counterpart to Lemma 5.3, showing that the conditions on appearing therein are sharp.
Lemma 5.5**.**
Let be an even integer satisfying . Then,
[TABLE]
Proof.
Using (5.31), we can easily show that
[TABLE]
where denotes the covariance matrix of . In order to compute the integral over appearing in the right-hand side, we proceed as follows. First we decompose the power function in the form
[TABLE]
where and denotes the -th Hermite polynomial. Therefore, if we define as the inverse of and as the centered Gaussian kernel with covariance , we have that
[TABLE]
which by (2.1), implies that
[TABLE]
Therefore, using the fact that
[TABLE]
we obtain
[TABLE]
Using the previous identity as well as the fact that and , we conclude that
[TABLE]
which by (5.36), leads to
[TABLE]
Define as the covariance matrix of . Combining (5.37) with Fatou’s lemma, and the fact that for all , we deduce that
[TABLE]
Thus, to prove (5.35), it suffices to find a divergent lower bound for the integral in the left-hand side. To this end, define
[TABLE]
and notice that by (2.2), for every , we have that and
[TABLE]
Thus, by (5),
[TABLE]
Notice that there exists a small ball contained in with center in the diagonal of , which forces the integral in the left-hand side to be divergent due to the condition . Relation (5.35) then follows from (5.39).
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Aït-Sahalia, Y., and Park, J. Y. (2016). Bandwidth selection and asymptotic properties of local nonparametric estimators in possibly nonstationary continuous-time models. Journal of Econometrics 192 , 119-138.
- 2[2] Akonom, J. (1993). Comportement asymptotique du temps d’occupation du processus des sommes partielles. Ann. Inst. H. Poincaré Probab. Statist. 29 , 57–81.
- 3[3] Altmeyer. R. (2017). Estimating occupation time functionals. Preprint.
- 4[4] Ayache, A., Wu, D. and Xiao, Y. (2008). Joint continuity of the local times of fractional Brownian sheets. Ann. Inst. Henri Poincaré Probab. Stat. 44 , 727–748.
- 5[5] Bandi, F.M., and Moloche, G. (2018). On the functional estimation of multivariate diffusion processes. Econometric Theory 34 (4), 896-946
- 6[6] Berman, S. (1970). Gaussian Processes with Stationary Increments: Local Times and Sample Function Properties. Ann. Math. Statist. 41 (4), 1260-1272.
- 7[7] Berman, S. (1973). Local nondeterminism and local times of Gaussian processes. Indiana Univ. Math. J. 23 , 69–94.
- 8[8] Berman, S. (1969). Harmonic Analysis of Local Times and Sample Functions of Gaussian Processes. Transactions of the American Mathematical Society , 143 , 269-281.
