In this paper, the authors applied the empirical likelihood method, which was originally proposed by Owen, to the copula moment based estimation methods to take advantage of its properties, effectiveness, flexibility and reliability of the nonparametric methods, which have limiting chi-square distributions and may be used to obtain tests or confidence intervals. The authors derive an asymptotically normal estimator of the empirical likelihood based on copula moment estimation methods (ELCM). Finally numerical performance with a simulation experiment of ELCM estimator is studied and compared to the CM estimator, with a good result.
In this paper we applied the empirical likelihood method which originally proposed by Owen, to the copula moment based estimation methods.
We derive an asymptotically normal estimator of the empirical likelihood based on copula moment estimation methods (ELCM). Finally numerical performance with a simulation experiment of ELCM estimator is studied and compared to the CM estimator, with a good result.
In this paper we applied the empirical likelihood method which originally proposed by Owen 1988, to the copula moment based estimation methods given by Brahimi and Necir 2012. We derive an new estimator of copula parameters and the asymptotic normality of the empirical likelihood based on copula moment estimation methods.
1. Introduction
One of the main topics in multivariate statistical analysis is the statistical inference on the dependence parameter θ. Many researchers investigated the copula parameter estimation, namely the methods of concordance [1, 2] fully and the pseudo maximum likelihood [3], inference function of margins [4, 5], minimum distance [6] and recently the copula moment and L-moment based estimation methods given in [7, 8].
In this paper we applied the empirical likelihood method to the copula moment based estimation methods which originally proposed by [9–11]. Several authors investigated the empirical likelihood see for instance [12–16].
The advantage of this method is that the empirical likelihood has both effectiveness and flexibility of the likelihood method, and reliability of the non-parametric methods, and it helps us to construct confidence intervals without estimating the asymptotic variance, so the complexity of the asymptotic variance for some estimator especially the CM based estimators and the construction of non-parametric confidence intervals via estimating the asymptotic variance is usually inaccurate.
2. Empirical likelihood for CM based estimation method
We consider the Archimedean copula family defined by , where is a twice differentiable function called the generator, satisfying: , , for any and . The notation ϕ−1 stands for the inverse function of ϕ. Archimedean copulas are easy to construct and have nice properties. A variety of known copula families belong to this class, including the models of Gumbel, Clayton, Frank, …(see, Table 4.1 in [17], p. 116).
Let , , be the df of rv , where , then the kth-moment , called copula moment, of rv given in [7] as the expectation of , that is
Equation (2.1) may be rewritten into:
Suppose now, for unknown , that ϕ = ϕθ, it follows that C = Cθ, KC = Kθ and , that is
from Theorem 4.3.4 in [17] we have for any , , it follows that the corresponding density is . Therefore (2.1), may be rewritten into
In terms of ϕθ.
The non-parametric likelihood of distribution function KC of rv is defined by
Where . We restrict KC to the one having the probability
on each observation Ui. By a simple calculation, we find the maximizer of the non-parametric likelihood (2.3) turns to be the empirical distribution function , placing probability 1/n on each observation. Therefore, similar to the parametric case, non-parametric likelihood ratio of KC to the maximizer is defined by:
Suppose now that we are interested in a parameter , C = Cθ and KC ≔ Kθ that the parameter θ satisfies the following equations
where
is a vector-valued function, called estimating function. Let the sample from random vector , we define the corresponding joint empirical df by
with , and the marginal empirical df’s pertaining to the sample , from rv Xj, by
According to [18]; the empirical copula function is defined by
where denotes the empirical quantile function pertaining to df Fjn. For each j = 1, …, d, we compute , then set
and for each k = 1, …, r, we compute
By substitution of Mk by and solving system (2.4) in θ we obtain the solution , called the CM estimator for .
Assume that the following assumptions hold.
- (1)
is the unique zero of the mapping which is defined from to , where
- (2)
is differentiable with respect to θ with the Jacobean matrix denoted by
is continuous both in u and θ, and the Euclidean norm is dominated by a dCθ -integrable function .
- (3)
The r × r matrix is non-singular.
Assume that assumptions hold. Then with probability tending to one as n → ∞, the solution converges to θ0. Moreover
See [7].□
Now we define the empirical likelihood ratio function for θ by
where p = (p1, …, pn). This is the maximum of the non-parametric likelihood ratio with the restriction that the mean of the estimating function is zero under the distribution Kθ.
Let, for k = 1, …, r
and
where is defined in (2.9). Then, the empirical likelihood evaluated at θ is defined as
Since the ’s depend on Cθ, for an unknown θ, we replace them by the ’s. Therefore, an estimated the empirical likelihood evaluated at θ is defined by
Now, by introducing a vector of Lagrange multipliers , to find the optimal pi’s i.e. maximizing
So, setting gives
Therefore, the equation gives γ = −n. Then, pi is given by
We have the problem that all the solutions p1,k, p2,k, …, pn,k, λk and γ are not obtained in a closed form. Note that for k = 1, 2, …, r: , subject to attains its maximum n−n at pi,k = 1/n. So we define the empirical likelihood ratio for θ as
and the corresponding empirical log-likelihood ratio is defined as
where the vector λ is the solution of the system of r equations given by
Since (2.11) is an implicit function of λ, we may solve (2.11) with respect to λ by the iterative procedure such as the Newton-Raphson optimization method or a simple grid search.
Assume conditions – hold. Then the limiting distribution of is a scaled chi-square distribution with r degrees of freedom, that is,
3. Illustrative example and simulation study
We consider the transformed Gumbel copula given by
which is also a two-parameter Archimedean copula with generator . Here then r = 2, and . By an elementary calculation we get the kth CM:
In particular the first two CM’s are
Then
and
Then
and
where the vector satisfies two equations given by
Finally, we get
To evaluate and compare the performance of empirical likelihood for CM’s estimator is called the empirical likelihood copula moment (ELCM) estimator with the CM’s and PML’s estimator, a simulation study is carried out by considering the above example of bivariate Gumbel copula family Cα,β. The evaluation of the performance is based on the bias and the RMSE defined as follows:
where is an estimator (from the considered method) of θ from the ith samples for R generated samples from the underlying copula. In both parts, we selected R = 1000. To assess the improvement in the bias and RMSE of the estimators we repeat the following steps:
Step 1: For a given sample from random vector , we define the corresponding joint empirical df by
with . For each j = 1, …, d, compute (2.8).
Step 2: Solve the following system for k = 1, …, r,
The obtained solution .
For different sample sizes n with n = 50, 100, 200, 500 with increasing sample size and a large set of parameters of the true copula Cα,β. The choice of the true values of the parameter has to be meaningful, in the sense that each couple of parameters assigns a value of one of the dependence measure, that is weak, moderate and strong dependence. The selected values of the true parameters are summarized in Table 1, the results are summarized in Table 2.
The true parameters of transformed gumbel copula used for the simulation study
| τ | α | β | |
|---|---|---|---|
| Weak | 0.01 | 0.1 | 1.059 |
| Moderate | 0.5 | 0.5 | 1.600 |
| Strong | 0.8 | 0.9 | 3.450 |
| τ | α | β | |
|---|---|---|---|
| Weak | 0.01 | 0.1 | 1.059 |
| Moderate | 0.5 | 0.5 | 1.600 |
| Strong | 0.8 | 0.9 | 3.450 |
Bias and RMSE of ELCM estimator of two-parameter transformed gumbel copula
| n | τ = 0.01 | τ = 0.5 | τ = 0.8 | CPU | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| α = 0.1 | β = 1.059 | α = 0.5 | β = 1.6 | α = 0.9 | β = 3.45 | ||||||||
| Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | ||
| 50 | 0.047 | 0.103 | 0.024 | 0.138 | 0.033 | 0.118 | 0.012 | 0.213 | 0.036 | 0.113 | 0.073 | 0.349 | 1.462 hours |
| 100 | 0.023 | 0.088 | 0.022 | 0.100 | 0.019 | 0.057 | 0.009 | 0.126 | 0.021 | 0.071 | 0.014 | 0.294 | 3.025 hours |
| 200 | 0.009 | 0.079 | 0.011 | 0.057 | 0.007 | 0.046 | 0.008 | 0.097 | 0.004 | 0.064 | 0.026 | 0.105 | 4.710 hours |
| 500 | 0.003 | 0.035 | 0.009 | 0.040 | 0.001 | 0.029 | 0.003 | 0.092 | 0.002 | 0.018 | 0.007 | 0.112 | 7.221 hours |
| n | τ = 0.01 | τ = 0.5 | τ = 0.8 | CPU | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| α = 0.1 | β = 1.059 | α = 0.5 | β = 1.6 | α = 0.9 | β = 3.45 | ||||||||
| Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | ||
| 50 | 0.047 | 0.103 | 0.024 | 0.138 | 0.033 | 0.118 | 0.012 | 0.213 | 0.036 | 0.113 | 0.073 | 0.349 | 1.462 hours |
| 100 | 0.023 | 0.088 | 0.022 | 0.100 | 0.019 | 0.057 | 0.009 | 0.126 | 0.021 | 0.071 | 0.014 | 0.294 | 3.025 hours |
| 200 | 0.009 | 0.079 | 0.011 | 0.057 | 0.007 | 0.046 | 0.008 | 0.097 | 0.004 | 0.064 | 0.026 | 0.105 | 4.710 hours |
| 500 | 0.003 | 0.035 | 0.009 | 0.040 | 0.001 | 0.029 | 0.003 | 0.092 | 0.002 | 0.018 | 0.007 | 0.112 | 7.221 hours |
4. Comments and conclusions
From Table 2, by considering three dependence cases: weak (τ = 0.01), moderate (τ = 0.5) and strong (τ = 0.8), the performance of the ELCM estimator remains quite good in small sample size. We show that the ELCM estimator is performs better than the CM based estimator in large one. Moreover, in time-consuming point of view, we observe that for a sample size n = 30 with N = 1000 replications, the central processing unit (CPU) time to apply ELCM method took 1.442 hours, which takes approximately the same time with the PLM method and is relatively big to the CM method, which is measured in seconds 22.013. For only one replication, the CPU times (in seconds), for different sample sizes, are summarized as follows: (n, CPU) = (30, 5.2613), (100, 10.891), (200, 16.965), (500, 25.995), (see Table 3). Which opens the door to new applications in copulas estimation framework.
Bias and RMSE of ELCM, CM and PML estimators of two-parameter transformed gumbel copula
| τ = 0.01 | τ = 0.5 | τ = 0.8 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| α = 0.1 | β = 1.059 | α = 0.5 | β = 1.6 | α = 0.9 | β = 3.45 | |||||||
| Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | |
| n = 50 | ||||||||||||
| ELCM | 0.049 | 0.093 | 0.028 | 0.137 | 0.031 | 0.101 | 0.031 | 0.229 | 0.039 | 0.109 | 0.088 | 0.356 |
| CM | −0.075 | 0.224 | 0.042 | 0.121 | −0.078 | 0.452 | 0.061 | 0.326 | −0.061 | 0.742 | −0.251 | 1.051 |
| PML | −0.059 | 0.098 | −0.324 | 0.333 | 0.060 | 0.299 | −0.273 | 0.482 | −0.052 | 0.525 | 0.241 | 1.011 |
| n = 100 | ||||||||||||
| ELCM | 0.023 | 0.087 | 0.021 | 0.103 | 0.021 | 0.077 | 0.029 | 0.111 | 0.031 | 0.073 | 0.016 | 0.299 |
| CM | −0.035 | 0.234 | −0.010 | 0.130 | −0.025 | 0.494 | 0.014 | 0.353 | −0.022 | 0.721 | 0.197 | 0.881 |
| PML | −0.049 | 0.051 | −0.466 | 0.470 | −0.061 | 0.231 | −0.327 | 0.433 | 0.014 | 0.300 | 0.319 | 0.731 |
| n = 200 | ||||||||||||
| ELCM | 0.011 | 0.057 | 0.015 | 0.064 | 0.013 | 0.045 | 0.013 | 0.099 | 0.017 | 0.069 | 0.027 | 0.109 |
| CM | −0.020 | 0.121 | 0.011 | 0.100 | 0.029 | 0.367 | −0.015 | 0.257 | −0.025 | 0.551 | 0.155 | 0.704 |
| PML | −0.041 | 0.038 | −0.282 | 0.285 | −0.081 | 0.164 | −0.304 | 0.469 | −0.022 | 0.157 | −0.018 | 0.227 |
| n = 500 | ||||||||||||
| ELCM | 0.005 | 0.037 | 0.007 | 0.044 | 0.009 | 0.031 | 0.009 | 0.091 | 0.011 | 0.010 | 0.012 | 0.101 |
| CM | −0.010 | 0.102 | 0.008 | 0.046 | −0.014 | 0.233 | 0.011 | 0.120 | −0.011 | 0.301 | −0.063 | 0.423 |
| PML | −0.040 | 0.061 | −0.203 | 0.210 | −0.046 | 0.100 | −0.302 | 0.225 | −0.019 | 0.244 | 0.028 | 0.200 |
| τ = 0.01 | τ = 0.5 | τ = 0.8 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| α = 0.1 | β = 1.059 | α = 0.5 | β = 1.6 | α = 0.9 | β = 3.45 | |||||||
| Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | Bias | RMSE | |
| n = 50 | ||||||||||||
| ELCM | 0.049 | 0.093 | 0.028 | 0.137 | 0.031 | 0.101 | 0.031 | 0.229 | 0.039 | 0.109 | 0.088 | 0.356 |
| CM | −0.075 | 0.224 | 0.042 | 0.121 | −0.078 | 0.452 | 0.061 | 0.326 | −0.061 | 0.742 | −0.251 | 1.051 |
| PML | −0.059 | 0.098 | −0.324 | 0.333 | 0.060 | 0.299 | −0.273 | 0.482 | −0.052 | 0.525 | 0.241 | 1.011 |
| n = 100 | ||||||||||||
| ELCM | 0.023 | 0.087 | 0.021 | 0.103 | 0.021 | 0.077 | 0.029 | 0.111 | 0.031 | 0.073 | 0.016 | 0.299 |
| CM | −0.035 | 0.234 | −0.010 | 0.130 | −0.025 | 0.494 | 0.014 | 0.353 | −0.022 | 0.721 | 0.197 | 0.881 |
| PML | −0.049 | 0.051 | −0.466 | 0.470 | −0.061 | 0.231 | −0.327 | 0.433 | 0.014 | 0.300 | 0.319 | 0.731 |
| n = 200 | ||||||||||||
| ELCM | 0.011 | 0.057 | 0.015 | 0.064 | 0.013 | 0.045 | 0.013 | 0.099 | 0.017 | 0.069 | 0.027 | 0.109 |
| CM | −0.020 | 0.121 | 0.011 | 0.100 | 0.029 | 0.367 | −0.015 | 0.257 | −0.025 | 0.551 | 0.155 | 0.704 |
| PML | −0.041 | 0.038 | −0.282 | 0.285 | −0.081 | 0.164 | −0.304 | 0.469 | −0.022 | 0.157 | −0.018 | 0.227 |
| n = 500 | ||||||||||||
| ELCM | 0.005 | 0.037 | 0.007 | 0.044 | 0.009 | 0.031 | 0.009 | 0.091 | 0.011 | 0.010 | 0.012 | 0.101 |
| CM | −0.010 | 0.102 | 0.008 | 0.046 | −0.014 | 0.233 | 0.011 | 0.120 | −0.011 | 0.301 | −0.063 | 0.423 |
| PML | −0.040 | 0.061 | −0.203 | 0.210 | −0.046 | 0.100 | −0.302 | 0.225 | −0.019 | 0.244 | 0.028 | 0.200 |
5. Proofs
5.1 Proof of Theorem 2.2
For the proof we need the following Lemmas
Follows straightaway from Theorem 2.1, see [7].
(1) From the law of large number, it follows that
So we can write
We have
Hence . It follows
The proof of Lemma 5.2 is completed.□
As showing in [19]; for k = 1, 2, …, r,
Now applying Taylor’s expansion to , we have
Note that from (2.11), for k = 1, 2, …, r
From, Lemma 5.2 it follows that for k = 1, 2, …, r
By (5.15) we get
Note that
then
Therefore, it follows from (5.14) and Lemmas 5.1 and (5.16) that
The proof of Theorem 2.2 is completed.
The authors are indebted to an anonymous referee for valuable remarks and suggestions.
