# Asymptotic Normality of the Estimators for Fractional Brownian Motions with Discrete Data

Authors: Lin Sun; Xiaojian Yu; Xuewei Guan; Qinghao Meng
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

This paper deals with the problem of estimating the Hurst parameter in the fractional Brownian motion when the Hurst index is greater than one half. The estimation procedure is built upon the marriage of the autocorrelation approach and the maximum likelihood approach. The asymptotic properties of the estimators are presented. Using the Monte Carlo experiments, we compare the performance of our method to existing ones, namely, R/S method, variations estimators, and wavelet method. These comparative results demonstrate that the proposed approach is effective and efficient.


---

## Body

## 1. Introduction

It is well-known that many time series, in diverse fields of application, may exhibit the phenomenon of long-memory or long-range dependence. As a result, time series with long- memory are currently used as stochastic models in various applications including telecommunications, hydrodynamics, economics, and environment. Moreover, applications of long-memory are found in areas as diverse as energy market analysis [1], neurosciences and other biological applications [2], and more traditional financial analysis and statistical theory [3–6]. We refer to the monographs Beran [7] and Rao [8] for complete expositions on theoretical and practical aspects of long-memory processes.In the literature, there exist many stochastic processes which exhibit long-memory property. The most popular self-similar stochastic process that exhibits long-range dependence is of course the fractional Brownian motion (fBm), which is a well-known Gaussian self-similar stochastic process with stationary increments. In fact, up to a multiplicative constant, the fBm is the only Gaussian process with these two properties. Obviously, if some phenomenon can be modeled by fBm, the estimation of the Hurst parameter in fBm is an important problem. In other words, to avoid using an arbitrary value of the unknown Hurst parameter of fBm, we should estimate the Hurst exponent. This leads to a demand for rigorous estimation procedures for fBm, which is the aim of this paper.Actually, there are several estimation procedures for obtaining the Hurst parameter for fBm (see, e.g., [9]). One of the estimators worth mentioning is the celebrated rescaled range analysis (R/S analysis) since it is very popular among researchers until today. In fact, there are many other methods available in the literature for estimating the Hurst exponent. For example, variance-time analysis, Higuchi’s approach, correlogram method, periodogram method, Whittle estimator, wavelet method, and Detrended fluctuation analysis method. Recently, Chronopoulou and Viens [10] proposed a new estimator of the Hurst parameter based on the discrete variations. Actually, some comparisons of these estimation methods have also been investigated in that paper. Taqqu et al. [11] stated that the Whittle method is better than the classical methods using the empirical study while Abry and Veitch [12] showed that the wavelet method is better than the Whittle method. For a general comparison of Fourier and wavelet approach, see Faÿ et al. [9].As far as the estimation is concerned, there is not yet a perfect method that is agreed by all researchers. Each method has its own drawbacks and cannot be used as a sole estimator in all cases. For more detailed discussions, see the work by Beran [7]. In this paper, for estimating the Hurst coefficient in fBm, we present a new estimation procedure, which is built upon the marriage of the autocorrelation approach and the maximum likelihood approach. Specifically, when H
∈
(
1
/
2,3
/
4
], we present the asymptotic normality of the estimator borrowing the idea of Hosking [13]. Moreover, when H
∈
(
3
/
4,1
), we propose the asymptotic normality of the maximum likelihood estimator under strictly weaker conditions than those employed by Lai [14]. We also describe the numerical implementation based on our method and compare the performance of our method with the other known approaches, namely, R/S method, variations estimators, and wavelet method.The remainder of this paper is organized as follows. In Section2, we give a brief description of the key result and present the asymptotic distributions of our estimators. In Section 3, the performance of the proposed estimator is illustrated by some numerical experiments. Finally, Section 4 draws the concluding remarks. All technical details are relegated to the appendix.


## 2. The Estimators Based on Discrete Observations

With the dramatic increase of the importance of application of long-memory in time series, the fBM model has been successfully applied in many fields of economics, finance, physics, chemistry, medicine, and environmental studies. Indeed, when fBm is used to describe some phenomena, a crucial problem is how to identify the Hurst parameter. Thus, the parameter estimation problem for the Hurst parameter was of great interest and became a challenging theoretical problem in the past decade. In what follows, we consider the problem of estimating the Hurst index in fBm.Now, let us recall that a fractional Brownian motionB
t
H with the Hurst coefficient H, defined on a complete probability space (
Ω
,
ℱ
,
𝒫
), is a centered Gaussian process. Its law is thus characterized by its covariance function, which is given by
(1)
𝔼
[
B
t
H
B
s
H
]
=
R
H
(
t
,
s
)
=
1
2
(
s
2
H
+
t
2
H
-
|
s
-
t
|
2
H
)
,
t
≥
0
,
s
≥
0
,where𝔼
[
B
t
H
]
=
0 and B
0
H
=
0 and H
∈
(
0,1
) denotes the long-memory parameter. Moreover, let X
=
(
B
1
,
B
2
,
…
,
B
N
)
t be the column vector of this observed time series at instances t
i
=
i, where the superscript t denotes the transpose of a vector.


### 2.1. The Estimator When1
/
2
<
H
≤
3
/
4

In this subsection, we develop the estimator of the Hurst parameter using the autocorrelation function.From (1), we can see that the covariance can be written as R
1
/
2
(
t
,
s
)
=
min
⁡
(
s
,
t
) for H
=
1
/
2, and the process B
1
/
2 is an ordinary Brownian motion. In this case the increments of the process in disjoint intervals are independent. However, for H
≠
1
/
2, the increments are not independent. Set Y
k
=
B
k
H
-
B
k
-
1
H
,
k
≥
1. Then {
Y
k
,
k
≥
1
} is a Gaussian stationary sequence with unit variance and autocovariance function
(2)
ρ
(
k
)
=
𝔼
[
Y
n
+
k
Y
n
]
=
1
2
(
|
k
-
1
|
2
H
-
2
|
k
|
2
H
+
|
k
+
1
|
2
H
)
,
k
∈
ℤ
.Moreover, straightforward computations show that(3)
ρ
(
k
)
~
H
(
2
H
-
1
)
|
k
|
2
H
-
1
,ask
→
∞.Therefore, the autocovariance function is nonsummable forH
>
1
/
2. This phenomenon is called long-range dependence, indicating (relatively) a slow decay of the covariance function. Since Y
k is exactly second-order self-similar, we have from (2) that
(4)
ρ
(
1
)
=
2
2
H
-
1
-
1
.Thus, we can solve forH to get
(5)
H
^
=
1
2
[
1
+
log
⁡
2
(
1
+
ρ
(
1
)
)
]
.Now, given dataY
1
,
…
,
Y
N, let
(6)
μ
^
N
=
1
N
∑
i
=
1
N
‍
Y
i
,
γ
^
N
(
k
)
=
1
N
∑
i
=
1
N
-
k
‍
(
Y
i
-
μ
^
N
)
(
Y
i
+
k
-
μ
^
N
)
,
σ
^
N
2
=
γ
^
N
(
0
)
,
ρ
^
N
(
k
)
=
γ
^
N
(
k
)
σ
^
N
2denote the sample mean, the sample covariance, the sample variance, and the sample autocorrelation, respectively. Based on (4), we can write the estimator for the Hurst parameter in fBm as
(7)
H
^
=
1
2
[
1
+
log
⁡
2
(
1
+
ρ
^
N
(
1
)
)
]
.To assess the performance of the proposed estimate, we appeal to the following result due to Hosking [13].Theorem 1.
LetY
k
=
B
k
H
-
B
k
-
1
H
,
k
≥
1 be an exactly second-order self-similar Gaussian process, that is, a fractional Gaussian noise. Assume in (2) that 0
<
H
≤
3
/
4. Then for a large sample size N, ρ
N
(
1
) is approximately 𝒩
(
μ
N
,
σ
N
2
), where
(8)
μ
N
=
ρ
(
1
)
-
(
1
-
ρ
(
1
)
)
N
2
H
-
2
,
σ
N
2
=
1
N
{
(
1
+
3
ρ
2
(
1
)
)
+
2
∑
k
=
1
∞
‍
[
(
1
+
2
ρ
2
(
1
)
)
ρ
2
(
k
)
+
2
∑
k
=
1
∞
‍
+
ρ
(
k
-
1
)
ρ
(
k
+
1
)
+
2
∑
k
=
1
∞
‍
(
1
+
3
ρ
2
(
1
)
)
-
4
ρ
(
1
)
ρ
(
k
-
1
)
ρ
(
k
)
]
}
,
when H
∈
(
0,3
/
4
) and
(9)
σ
N
2
=
log
⁡
N
N
[
2
H
(
2
H
-
1
)
(
1
+
ρ
(
1
)
)
]
2
,
when H
=
3
/
4.Proof.
This is a special case of Hosking [13].


### 2.2. The Estimator When3
/
4
<
H
<
1

In what follows, we deal with the problem of estimating the Hurst index in fBm when3
/
4
<
H
<
1. The technique we employed here is the maximum likelihood method. The reason for choosing this approach is that this technique has been applied efficiently in a large set. Since the fBm is Gaussian the log-likelihood for the discrete observations X
=
(
B
1
,
B
2
,
…
,
B
N
)
t may be explicitly computed. Borrowing the idea of Lai [14], we can obtain the exact maximum likelihood estimator of the Hurst parameter for the fBm. However, since our assumptions are slightly different from those in Lai [14], we present the detailed derivations and make some comparisons.Note that for anyi, B
i
h is Gaussian. Thus the joint probability density function of X is
(10)
f
N
(
X
,
H
)
=
(
2
π
)
-
N
/
2
|
Γ
H
|
-
1
/
2
exp
⁡
(
-
1
2
X
t
Γ
H
-
1
X
)
,
where
(11)
Γ
H
=
[
Cov
[
B
i
H
,
B
j
H
]
]
i
,
j
=
1,2
,
…
,
N
=
1
2
(
i
2
H
+
j
2
H
-
|
i
-
j
|
2
H
)
i
,
j
=
1,2
,
…
,
N
.As a consequence, the log-likelihood function ofXis given as
(12)
L
N
(
X
;
H
)
=
ln
⁡
f
N
(
X
;
H
)
=
-
N
2
ln
⁡
(
2
π
)
-
1
2
ln
⁡
(
|
Γ
H
|
)
-
1
2
X
t
Γ
H
-
1
X
.Moreover, letH
^ be the maximum likelihood estimator of H. Then, based on Taylor expansion we have
(13)
L
N
′
(
X
;
H
^
)
=
0
=
L
N
′
(
X
;
H
)
+
L
N
′′
(
X
;
H
~
)
(
H
^
-
H
)
,
where H
~ is a random point between H
^ and H; the single prime ′ and the double prime ′′ denote the first and the second derivatives with respect to H, respectively. From Lai [14], we have the following result.Lemma 2.
ForH
∈
(
0,1
), the expectation of the first derivative of the log-likelihood function, L
N
(
X
;
H
), is zero and the variance is (
1
/
2
)
Tr
⁡
(
[
Γ
H
-
1
Γ
H
′
]
2
).Below we will establish the asymptotic distribution forH. First we list some technical conditions.Assumption 3.
Letλ
max
⁡
(
A
) denote the largest eigenvalue of the matrix A. Then one assumes that λ
max
⁡
(
Γ
H
)
=
o
(
N
H
+
1
/
4
ln
⁡
N
).Actually, we should verify the feasibility of Assumption3.Proposition 4.
Assumption3 is reasonable when H
∈
(
3
/
4,1
)Proof.
First, noting that the lower bound for the largest eigenvalue ofΓ
H can be obtained from the result of Walker and Mieghem [15], we have
(14)
λ
max
⁡
(
Γ
H
)
≥
∑
i
,
j
=
1
N
a
i
j
N
≥
N
C
l
,
where a
i
j are the coefficients and C
l is the minimum element of the matrix Γ
H.
On the other hand, we obtain the higher bound for the largest eigenvalue ofΓ
H by the Gerschgorin Circle Theorem (see [16]: Theorem 8.1
.
3, P395)
(15)
λ
max
⁡
(
Γ
H
)
≤
N
2
H
+
1
C
r
,
with C
r being a positive constant.
Consequently, we obtain(16)
λ
max
⁡
(
Γ
H
)
∈
[
N
C
l
,
N
2
H
+
1
C
r
]
.
From (16), it is obvious that Assumption 3 is practicable when H
≥
3
/
4.We are now ready to state the key result, whose proof is postponed to the appendix.Theorem 5.
Suppose that Assumption3 is satisfied and H
∈
(
3
/
4,1
). Then the maximum likelihood estimator H
^ of the parameter H is approximately normally distributed such that
(17)
Tr
(
[
Γ
H
-
1
Γ
H
′
]
2
)
2
(
H
^
-
H
)
→
ℒ
𝒩
(
0,1
)
asN tends to infinity, where →
ℒ denotes the convergence in distribution.


## 2.1. The Estimator When1
/
2
<
H
≤
3
/
4

In this subsection, we develop the estimator of the Hurst parameter using the autocorrelation function.From (1), we can see that the covariance can be written as R
1
/
2
(
t
,
s
)
=
min
⁡
(
s
,
t
) for H
=
1
/
2, and the process B
1
/
2 is an ordinary Brownian motion. In this case the increments of the process in disjoint intervals are independent. However, for H
≠
1
/
2, the increments are not independent. Set Y
k
=
B
k
H
-
B
k
-
1
H
,
k
≥
1. Then {
Y
k
,
k
≥
1
} is a Gaussian stationary sequence with unit variance and autocovariance function
(2)
ρ
(
k
)
=
𝔼
[
Y
n
+
k
Y
n
]
=
1
2
(
|
k
-
1
|
2
H
-
2
|
k
|
2
H
+
|
k
+
1
|
2
H
)
,
k
∈
ℤ
.Moreover, straightforward computations show that(3)
ρ
(
k
)
~
H
(
2
H
-
1
)
|
k
|
2
H
-
1
,ask
→
∞.Therefore, the autocovariance function is nonsummable forH
>
1
/
2. This phenomenon is called long-range dependence, indicating (relatively) a slow decay of the covariance function. Since Y
k is exactly second-order self-similar, we have from (2) that
(4)
ρ
(
1
)
=
2
2
H
-
1
-
1
.Thus, we can solve forH to get
(5)
H
^
=
1
2
[
1
+
log
⁡
2
(
1
+
ρ
(
1
)
)
]
.Now, given dataY
1
,
…
,
Y
N, let
(6)
μ
^
N
=
1
N
∑
i
=
1
N
‍
Y
i
,
γ
^
N
(
k
)
=
1
N
∑
i
=
1
N
-
k
‍
(
Y
i
-
μ
^
N
)
(
Y
i
+
k
-
μ
^
N
)
,
σ
^
N
2
=
γ
^
N
(
0
)
,
ρ
^
N
(
k
)
=
γ
^
N
(
k
)
σ
^
N
2denote the sample mean, the sample covariance, the sample variance, and the sample autocorrelation, respectively. Based on (4), we can write the estimator for the Hurst parameter in fBm as
(7)
H
^
=
1
2
[
1
+
log
⁡
2
(
1
+
ρ
^
N
(
1
)
)
]
.To assess the performance of the proposed estimate, we appeal to the following result due to Hosking [13].Theorem 1.
LetY
k
=
B
k
H
-
B
k
-
1
H
,
k
≥
1 be an exactly second-order self-similar Gaussian process, that is, a fractional Gaussian noise. Assume in (2) that 0
<
H
≤
3
/
4. Then for a large sample size N, ρ
N
(
1
) is approximately 𝒩
(
μ
N
,
σ
N
2
), where
(8)
μ
N
=
ρ
(
1
)
-
(
1
-
ρ
(
1
)
)
N
2
H
-
2
,
σ
N
2
=
1
N
{
(
1
+
3
ρ
2
(
1
)
)
+
2
∑
k
=
1
∞
‍
[
(
1
+
2
ρ
2
(
1
)
)
ρ
2
(
k
)
+
2
∑
k
=
1
∞
‍
+
ρ
(
k
-
1
)
ρ
(
k
+
1
)
+
2
∑
k
=
1
∞
‍
(
1
+
3
ρ
2
(
1
)
)
-
4
ρ
(
1
)
ρ
(
k
-
1
)
ρ
(
k
)
]
}
,
when H
∈
(
0,3
/
4
) and
(9)
σ
N
2
=
log
⁡
N
N
[
2
H
(
2
H
-
1
)
(
1
+
ρ
(
1
)
)
]
2
,
when H
=
3
/
4.Proof.
This is a special case of Hosking [13].


## 2.2. The Estimator When3
/
4
<
H
<
1

In what follows, we deal with the problem of estimating the Hurst index in fBm when3
/
4
<
H
<
1. The technique we employed here is the maximum likelihood method. The reason for choosing this approach is that this technique has been applied efficiently in a large set. Since the fBm is Gaussian the log-likelihood for the discrete observations X
=
(
B
1
,
B
2
,
…
,
B
N
)
t may be explicitly computed. Borrowing the idea of Lai [14], we can obtain the exact maximum likelihood estimator of the Hurst parameter for the fBm. However, since our assumptions are slightly different from those in Lai [14], we present the detailed derivations and make some comparisons.Note that for anyi, B
i
h is Gaussian. Thus the joint probability density function of X is
(10)
f
N
(
X
,
H
)
=
(
2
π
)
-
N
/
2
|
Γ
H
|
-
1
/
2
exp
⁡
(
-
1
2
X
t
Γ
H
-
1
X
)
,
where
(11)
Γ
H
=
[
Cov
[
B
i
H
,
B
j
H
]
]
i
,
j
=
1,2
,
…
,
N
=
1
2
(
i
2
H
+
j
2
H
-
|
i
-
j
|
2
H
)
i
,
j
=
1,2
,
…
,
N
.As a consequence, the log-likelihood function ofXis given as
(12)
L
N
(
X
;
H
)
=
ln
⁡
f
N
(
X
;
H
)
=
-
N
2
ln
⁡
(
2
π
)
-
1
2
ln
⁡
(
|
Γ
H
|
)
-
1
2
X
t
Γ
H
-
1
X
.Moreover, letH
^ be the maximum likelihood estimator of H. Then, based on Taylor expansion we have
(13)
L
N
′
(
X
;
H
^
)
=
0
=
L
N
′
(
X
;
H
)
+
L
N
′′
(
X
;
H
~
)
(
H
^
-
H
)
,
where H
~ is a random point between H
^ and H; the single prime ′ and the double prime ′′ denote the first and the second derivatives with respect to H, respectively. From Lai [14], we have the following result.Lemma 2.
ForH
∈
(
0,1
), the expectation of the first derivative of the log-likelihood function, L
N
(
X
;
H
), is zero and the variance is (
1
/
2
)
Tr
⁡
(
[
Γ
H
-
1
Γ
H
′
]
2
).Below we will establish the asymptotic distribution forH. First we list some technical conditions.Assumption 3.
Letλ
max
⁡
(
A
) denote the largest eigenvalue of the matrix A. Then one assumes that λ
max
⁡
(
Γ
H
)
=
o
(
N
H
+
1
/
4
ln
⁡
N
).Actually, we should verify the feasibility of Assumption3.Proposition 4.
Assumption3 is reasonable when H
∈
(
3
/
4,1
)Proof.
First, noting that the lower bound for the largest eigenvalue ofΓ
H can be obtained from the result of Walker and Mieghem [15], we have
(14)
λ
max
⁡
(
Γ
H
)
≥
∑
i
,
j
=
1
N
a
i
j
N
≥
N
C
l
,
where a
i
j are the coefficients and C
l is the minimum element of the matrix Γ
H.
On the other hand, we obtain the higher bound for the largest eigenvalue ofΓ
H by the Gerschgorin Circle Theorem (see [16]: Theorem 8.1
.
3, P395)
(15)
λ
max
⁡
(
Γ
H
)
≤
N
2
H
+
1
C
r
,
with C
r being a positive constant.
Consequently, we obtain(16)
λ
max
⁡
(
Γ
H
)
∈
[
N
C
l
,
N
2
H
+
1
C
r
]
.
From (16), it is obvious that Assumption 3 is practicable when H
≥
3
/
4.We are now ready to state the key result, whose proof is postponed to the appendix.Theorem 5.
Suppose that Assumption3 is satisfied and H
∈
(
3
/
4,1
). Then the maximum likelihood estimator H
^ of the parameter H is approximately normally distributed such that
(17)
Tr
(
[
Γ
H
-
1
Γ
H
′
]
2
)
2
(
H
^
-
H
)
→
ℒ
𝒩
(
0,1
)
asN tends to infinity, where →
ℒ denotes the convergence in distribution.


## 3. Simulation Studies

In this section, we conduct Monte Carlo simulations to study the performance of our estimator and compare our estimator with existing methods (the simulation in this paper has been implemented in the Matlab language. Readers should contact the authors if they are interested in obtaining the code of this study). Although there are many approaches available for estimating the Hurst parameter, here we compare some of these methods using the simulated time series. In particular, we consider the R/S, the variations estimators, the wavelet method, and our estimators. First, for a fixed time-steph
=
1
/
12, we generate the fBm for different values of the parameters H and for different sample sizes: N = 50 and 100. Moreover, for each case we consider s
=
100 independent realizations. Thus, for a given estimation method we obtain s
=
100as the estimated values for H. We calculate
(18)
H
^
=
1
s
∑
i
=
1
s
‍
H
i
,
where H
i are the estimated values for a single realization. We calculate the standard deviation (S.D.)
(19)
S
.
D
.
=
1
s
-
1
∑
i
=
1
s
‍
(
H
i
-
H
-
)
2
,whereH
- is the mean over all the realizations and the mean- square error (MSE)
(20)
MSE
=
1
s
∑
i
=
1
s
‍
(
H
i
-
H
)
2
,
where H is the value of the parameter that we have used to generate the model.Using this way we can obtain approximate values for the standard deviation and the mean-squares error of the estimators. These results are important because they are necessary to investigate the performances of the estimators. Simulation results are summarized in Tables1 and 2 with the mean, the standard deviation (S.D.), and the mean- square error (MSE) of these estimators. The CPU times (in seconds), which are the average, are also presented in these tables (all the procedures were programmed using a PC with 2.4 GHz Intel Duo Core CPU and 2-GB RAM).Table 1
The estimation results of comparative methods for sample sizeN
=
50.
Estimation method
Statistic
True values ofH
0.5600
0.6200
0.8500
0.9200
R/S method
Mean
0.50506
0.59232
0.82667
0.87692
S.D.
0.62322
0.43601
0.48195
0.51479
MSE
0.62564
0.43689
0.48251
0.51659
CPU time
13
15
18
20
Variations estimators
Mean
0.59451
0.65676
0.89267
0.92050
S.D.
0.12365
0.23050
0.23739
0.15369
MSE
0.12838
0.23341
0.24119
0.15369
CPU time
3
5
4
6
Wavelet method
Mean
0.58500
0.63520
0.87150
0.92963
S.D.
0.04265
0.02518
0.06251
0.09654
MSE
0.04944
0.02941
0.06610
0.09702
CPU time
22
27
28
28
Our method
Mean
0.56667
0.62905
0.85507
0.92102
S.D.
0.03319
0.03092
0.01350
0.01325
MSE
0.03385
0.03222
0.01442
0.01329
CPU time
3
3
5
5Table 2
The estimation results of comparative methods for sample sizeN
=
100.
Estimation method
Statistic
True values ofH
0.5600
0.6200
0.8500
0.9200
R/S method
Mean
0.53625
0.60581
0.83751
0.89032
S.D.
0.37218
0.32670
0.36258
0.36521
MSE
0.37294
0.32701
0.36280
0.36641
CPU time
50
48
49
50
Variations estimators
Mean
0.58002
0.63370
0.86261
0.93143
S.D.
0.01606
0.01952
0.01910
0.03162
MSE
0.02567
0.02385
0.02289
0.03362
CPU time
21
18
19
22
Wavelet method
Mean
0.56497
0.62951
0.86232
0.91931
S.D.
0.01268
0.01497
0.05436
0.07484
MSE
0.01362
0.01774
0.05574
0.07484
CPU time
100
108
112
118
Our method
Mean
0.56003
0.62003
0.85003
0.92007
S.D.
0.00214
0.00967
0.01470
0.00948
MSE
0.00215
0.00968
0.01472
0.00949
CPU time
15
13
21
24From these numerical computations, we can conclude that the simulated mean converges to the true value rapidly and the bias tends quickly to zero when the sample size increases. Indeed, by carefully observing Tables1 and 2, we can see that the mean values obtained by our method and wavelet method are closer to the true values than those obtained based on R/S method and variation approach. Moreover, both the S.D. and the MSE obtained by our method and the wavelet method are smaller than those obtained based on R/S method and variation approach. Furthermore, it is interesting to see that our approach and wavelet method have the same accuracy and bias when the number of sample paths is large enough. Hence both methods are efficient. However, the most important finding is that the computation time costed by our approach is lower than that by the wavelet method. Therefore, our method is effective and efficient. In summary, the Monte Carlo simulations verify our theory and indicate that our estimators perform reasonably well in finite samples.We next investigate the asymptotic distribution ofH
^ and when N is not so large. Here, the chosen parameters are H
=
0.60, 0.70, 0.80, 0.90 and we take N = 120 and h = 1/12 (i.e., T
=
10). We just perform 100 Monte Carlo simulations of the sample paths generated by the process of fBm. The results are presented in Figure 1.Histograms of the statisticH
^ for (a) H
=
0.60, (b) H
=
0.70, (c) H
=
0.80, and (d) H
=
0.90.
(a)
(b)
(c)
(d)From Figure1, we can see that the normal approximations of the distributions of the Hurst parameter H based on H
^ are reasonable even when N is not so large. This confirms our theoretical analysis: the convergence of the distributions of these two estimators is fast. In conclusion, our simulation results show that our estimators perform well since the estimating results match the chosen parameters exactly.


## 4. Conclusion

Research on estimating the Hurst parameters of fBm has been ongoing in the econometric and statistical literatures for more than two decades. But the subject has received its greatest attention in the last decade, as researchers in empirical finance have sought to use fBm to capture the long-range dependency of the prices of financial assets. This paper considered the inference problem for fBm based on the marriage of the autocorrelation approach and the maximum likelihood approach. The main contribution of this paper was in the establishment of asymptotic normality when the Hurst parameter satisfiedH
∈
(
1
/
2,1
). This paper therefore extended the Lai [14] seminal contribution, which was done under strong conditions. Finally, we also showed the performance of our method to existing ones and illustrated that the proposed approach is effective and efficient. Certainly, for a future study, to improve the methodology it is required to use different schemes of estimation with a higher order of convergence. The field is therefore of growing importance for both theorists and practitioners.



---

*Source: 323091-2014-02-23.xml*