The purpose of this paper is to propose a semiparametric estimator for the tail index of Pareto-type random truncated data that improves the existing ones in terms of mean square error. Moreover, we establish its consistency and asymptotic normality.
To construct a root mean squared error (RMSE)-reduced estimator of the tail index, the authors used the semiparametric estimator of the underlying distribution function given by Wang (1989). This allows us to define the corresponding tail process and provide a weak approximation to this one. By means of a functional representation of the given estimator of the tail index and by using this weak approximation, the authors establish the asymptotic normality of the aforementioned RMSE-reduced estimator.
In basis on a semiparametric estimator of the underlying distribution function, the authors proposed a new estimation method to the tail index of Pareto-type distributions for randomly right-truncated data. Compared with the existing ones, this estimator behaves well both in terms of bias and RMSE. A useful weak approximation of the corresponding tail empirical process allowed us to establish both the consistency and asymptotic normality of the proposed estimator.
A new tail semiparametric (empirical) process for truncated data is introduced, a new estimator for the tail index of Pareto-type truncated data is introduced and asymptotic normality of the proposed estimator is established.
1. Introduction
Let , i = 1, …, N ≥ 1 be a sample from a couple of independent positive random variables (rv’s) defined over a probability space , with continuous distribution functions (df’s) F and G, respectively. Suppose that X is right-truncated by Y, in the sense that Xi is only observed when Xi ≤ Yi. Thus, let us denote , i = 1, …, n to be the observed data, as copies of a couple of dependent rv’s corresponding to the truncated sample , i = 1, …, N, where n = nN is a random sequence of discrete rv’s. By the weak law of large numbers, we have
where the notation stands for the convergence in probability. The constant p corresponds to the probability of observed sample which is supposed to be non-null, otherwise nothing is observed. The truncation phenomena frequently occurs in medical studies, when one wants to study the length of survival after the start of the disease: if Y denotes the elapsed time between the onset of the disease and death, and if the follow-up period starts X units of time after the onset of the disease then, clearly, X is right-truncated by Y. For concrete examples of truncated data in medical treatments one refers, among others, to Refs. [1, 2]. Truncated data schemes may also occur in many other fields, namely actuarial sciences, astronomy, demography and epidemiology, see for instance the textbook of [3].
From [4] the marginal df’s F* and G* corresponding to the joint df of are given by
By the previous first equation, we derive a representation of the underlying df F as follows:
which will be for a great interest thereafter. In the sequel, we are dealing with the concept of regular variation. A function φ is said to be regularly varying at infinity with negative index − 1/η, notation , if
for s > 0. This relation is known as the first-order condition of regular variation and the corresponding uniform convergence is formulated in terms of “Potter’s inequalities” as follows: for any small ϵ > 0, there exists t0 > 0 such that for any t ≥ t0 and s ≥ 1, we have
See for instance Proposition B.1.9 (assertion 5, page 367) in Ref. [5]. The second-order condition (see Ref. [6] expresses the rate of the convergence above. For any x > 0, we have
where τ < 0 denotes the second-order parameter and A is a function tending to zero and not changing signs near infinity with regularly varying absolute value with positive index τ/η. A function φ that satisfies assumption is denoted . We now have enough material to tackle the main goal of the paper. To begin, let us assume that the tails of both df’s F and G are regularly varying. That is
Under this assumption, [4] showed that
where
For further details on the proof of this statement one refers to Ref. [7] (Lemma A1). The estimation of the tail index γ1 was recently addressed for the first time in Ref. [4] where the authors used equation to propose an estimator to γ1 as a ratio of Hill estimators [8] of the tail indices γ and γ2. These estimators are based on the top order statistics Xn−k:n ≤ … ≤ Xn:n and Yn−k:n ≤ … ≤ Yn:n pertaining to the samples and respectively. The sample fraction k = kn being a sequence of integers such that, kn → ∞ and kn/n → 0 as n → ∞. The asymptotic normality of the given estimator is established in Ref. [9]. By using a Lynden-Bell integral, [10] proposed the following estimator for the tail index γ1:
for a given deterministic threshold u > 0, where
is the popular nonparametric maximum likelihood estimator of cdf F introduced in the well-known work [11]; with
Independently, [7] used a Woodroofe integral with a random threshold, to derive the following estimator
where
is the so-called Woodroofe’s nonparametric estimator [12] of df F. To improve the performance of , [13, 14], respectively, proposed a Kernel-smoothed and a reduced-bias versions of this estimator and established their consistency and asymptotic normality. It is worth mentioning that Lynden-Bell integral estimator with a random threshold u = Xn−k:n becomes
In a simulation study, [15] compared this estimator with . They pointed out that both estimators have similar behaviors in terms of biases and mean squared errors.
Recall that the nonparametric Lynden-Bell estimator was constructed on the basis of the fact that F and G are both unknown. In this paper, we are dealing with the situation when F is unknown but G is parametrized by a known model Gθ, , d ≥ 1 having a density gθ with respect to Lebesgue measure. [2] considered this assumption and introduced a semiparametric estimator for df F defined by
where and
denoting the conditional maximum likelihood estimator (CMLE) of θ, which is consistent and asymptotically normal, see for instance Ref. [16]. On the other hand, [2] showed that is an uniformly consistent estimator over the x-axis and established, under suitable regularity assumptions, its asymptotic normality. [2, 17] pointed out that the semiparametric estimate has greater efficiency uniformly over the x-axis. In the light of a simulation study, the authors suggest that the semiparametric estimate is a better choice when parametric information of the truncation distribution is available. Since the apparition of this estimation method many papers are devoted to the statistical inference with truncation data, see for instance Refs. [18–22] and [23].
Motivated by the features of the semiparametric estimation, we next propose a new estimator for γ1 by means of a suitable functional of . We start our construction by noting that from Theorem 1.2.2 in de [5]; the first-order condition (for F) implies that
In other words, γ1 may viewed as a functional , for a large t, where
Replacing F by and letting t = Xn−k:n yield
as new estimator for γ1. Observe that
which may be rewritten into
On the other hand, equals
Hence,
Thereby, the form of our new estimator is
The asymptotic behavior of will be established by means of the following tail empirical process
This method was already used to establish the asymptotic behavior of Hill’s estimator for complete data [5]; page 162) that we will adapt to the truncation case. Indeed, by using an integration by parts and a change of variables of the integral , one gets
and therefore
Thus, for a suitable weighted weak approximation to , we may easily deduce the consistency and asymptotic normality of . This process may also contribute to the goodness-of-fit test to fitting heavy-tailed distributions via, among others, the Kolmogorov–Smirnov and Cramér–von Mises type statistics
More precisely, these statistics are used when testing the null hypothesis H0: “both F and G are heavy-tailed” versus the alternative one H1: “at least one of F and G is not heavy-tailed”, that is H0: “ holds” versus H1: “ does not hold”. This problem has been already addressed by Refs. [24, 25] in the case of complete data. The (uniform) weighted weak convergence of and the asymptotic normality of , stated below, will be of great interest to establish the limit distributions of the aforementioned test statistics. This is out of the scope of this paper whose remainder is structured as follows. In Section 2, we present our main results which consist in the consistency and asymptotic normality of estimator . The performance of the proposed estimator is checked by simulation in Section 3. An application to a real dataset composed of induction times of AIDS diseases is given in Section 4. The proofs are gathered in Section 5. A useful lemma and its proof are postponed to Appendix.
2. Main results
The regularity assumptions, denoted , concerning the existence, consistency and asymptotic normality of the CLME estimator , given in , are discussed in Ref. [16]. Here, we only state additional conditions on df Gθ corresponding to Pareto-type models which are required to establish the asymptotic behavior of our newly estimator .
For each fixed y, the function is continuously differentiable of partial derivatives , j = 1, …, d.
.
, as y → ∞, for any ϵ > 0.
For common Pareto-type models, one may easily check that there exist some constants aj ≥ 0, cj and dj, such that , for all large x. Then one may consider that the assumptions are not very restrictive and they may be acceptable in the extreme value theory.
Assume that and satisfying the assumptions , and suppose that γ1 < γ2. Then on the probability space , there exists a standard Wiener process such that, for any small 0 < ϵ < 1/2, we have
Applying this weak approximation, we establish both consistency and asymptotic normality of our new estimator , that we state in the following Theorem.
Under the assumptions of Theorem 2.1, we have
3. Simulation study
In this section, we will perform a simulation study in order to compare the finite sample behavior of our new semiparametric estimator , given in , with Woodrofee and Lynden-Bell integral estimators and , given respectively in and . The truncation and truncated distributions functions F and G will be chosen among the following two models:
Burr distribution with right-tail function:
Fréchet distribution with right-tail function:
The simulation study is being made in fours scenarios following to the choice of the underlying df’s F and Gθ:
Burr truncated by Burr ; with
Fréchet truncated by Fréchet ; with θ = γ2
Fréchet truncated by Burr ; with
Burr truncated by Fréchet ; with θ = γ2
To this end, we fix δ = 1/4 and choose the values 0.6 and 0.8 for γ1 and 55% and 90% for the portions of observed truncated data given in so that the assumption γ1 < γ2 stated in Theorem 2.1 holds. In other words, the values of p have to be greater than 50%. For each couple , we solve the equation to get the pertaining γ2-value, which we summarize as follows:
For each scenario, we simulate 1000 random samples of size N = 300 and compute the root mean squared error (RMSE) and the absolute bias (ABIAS) corresponding to each estimator , and . The comparison is done by plotting the ABIAS and RMSE as functions of the sample fraction k which varies from 2 to 120. This range is chosen so that it contains the optimal number of upper extremes k* used in the computation of the tail index estimate. There are many heuristic methods to select k*, see for instance Ref. [26]; here we use the algorithm proposed by Ref. [27] in page 137, which is incorporated in the R software “Xtremes” package. Note that the computation the CMLE of θ is made by means of the syntax ”maxLik” of the MaxLik R software package. The optimal sample fraction k* is defined, in this procedure, by
for suitable constant 0 ≤ ω ≤ 1/2, where corresponds to an estimator of tail index γ, based on the i upper order statistics, of a Pareto-type model. We observed, in our simulation study, that ω = 0.3 allows better results both in terms of bias and RMSE. It is worth mentioning that making N vary did not provide notable findings; therefore, we kept the size N fixed. The finite sample behaviors of the above-mentioned estimators are illustrated in Figures 1–8. The overall conclusion is that the biases of three estimators are almost equal, however, in the case of medium truncation , the RMSE of our new semiparametric is clearly the smallest compared that of and . Actually, the medium truncation situation is the most frequently encountered in real data, while the strong truncation remains, up to our knowledge, theoretical. In this sense, we may consider that the semiparametric estimator is more efficient than the two other ones. We point out that the two estimators and have almost the same behavior which actually was noticed before by Ref. [15]. The optimal sample fractions and estimate values of the tail index obtained through the three estimators are given in Tables 1–4.
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Absolute bias (left two panels) and RMSE (right two panels) of (black) and (red) and (blue), corresponding to two situations of scenario (top two panels) and (bottom two panels) based on 1000 samples of size 300
Optimal sample fractions and estimate values of the tail index γ1 = 0.6 based on 1,000 samples of size 300 for the four scenarios with p = 0.55
| k* | k* | k* | ||||
|---|---|---|---|---|---|---|
| S1 | 44 | 0.600 | 41 | 0.599 | 40 | 0.600 |
| S2 | 18 | 0.601 | 17 | 0.600 | 16 | 0.597 |
| S3 | 21 | 0.601 | 20 | 0.601 | 19 | 0.599 |
| S4 | 30 | 0.603 | 27 | 0.600 | 25 | 0.598 |
| k* | k* | k* | ||||
|---|---|---|---|---|---|---|
| S1 | 44 | 0.600 | 41 | 0.599 | 40 | 0.600 |
| S2 | 18 | 0.601 | 17 | 0.600 | 16 | 0.597 |
| S3 | 21 | 0.601 | 20 | 0.601 | 19 | 0.599 |
| S4 | 30 | 0.603 | 27 | 0.600 | 25 | 0.598 |
Optimal sample fractions and estimate values of the tail index γ1 = 0.6 based on 1,000 samples of size 300 for the four scenarios with p = 0.9
| k* | k* | k* | ||||
|---|---|---|---|---|---|---|
| S1 | 82 | 0.610 | 82 | 0.611 | 82 | 0.611 |
| S2 | 37 | 0.640 | 37 | 0.640 | 37 | 0.640 |
| S3 | 46 | 0.633 | 37 | 0.625 | 37 | 0.625 |
| S4 | 52 | 0.610 | 52 | 0.610 | 52 | 0.610 |
| k* | k* | k* | ||||
|---|---|---|---|---|---|---|
| S1 | 82 | 0.610 | 82 | 0.611 | 82 | 0.611 |
| S2 | 37 | 0.640 | 37 | 0.640 | 37 | 0.640 |
| S3 | 46 | 0.633 | 37 | 0.625 | 37 | 0.625 |
| S4 | 52 | 0.610 | 52 | 0.610 | 52 | 0.610 |
Optimal sample fractions and estimate values of the tail index γ1 = 0.8 based on 1,000 samples of size 300 for the four scenarios with p = 0.55
| k* | k* | k* | ||||
|---|---|---|---|---|---|---|
| S1 | 59 | 0.799 | 57 | 0.800 | 54 | 0.799 |
| S2 | 21 | 0.803 | 21 | 0.803 | 20 | 0.799 |
| S3 | 24 | 0.802 | 22 | 0.798 | 22 | 0.801 |
| S4 | 51 | 0.799 | 52 | 0.800 | 50 | 0.801 |
| k* | k* | k* | ||||
|---|---|---|---|---|---|---|
| S1 | 59 | 0.799 | 57 | 0.800 | 54 | 0.799 |
| S2 | 21 | 0.803 | 21 | 0.803 | 20 | 0.799 |
| S3 | 24 | 0.802 | 22 | 0.798 | 22 | 0.801 |
| S4 | 51 | 0.799 | 52 | 0.800 | 50 | 0.801 |
Optimal sample fractions and estimate values of the tail index γ1 = 0.8 based on 1,000 samples of size 300 for the four scenarios with p = 0.9
| k* | k* | k* | ||||
|---|---|---|---|---|---|---|
| S1 | 90 | 0.804 | 90 | 0.806 | 90 | 0.807 |
| S2 | 34 | 0.845 | 34 | 0.846 | 34 | 0.846 |
| S3 | 40 | 0.831 | 40 | 0.831 | 40 | 0.831 |
| S4 | 71 | 0.814 | 71 | 0.814 | 71 | 0.815 |
| k* | k* | k* | ||||
|---|---|---|---|---|---|---|
| S1 | 90 | 0.804 | 90 | 0.806 | 90 | 0.807 |
| S2 | 34 | 0.845 | 34 | 0.846 | 34 | 0.846 |
| S3 | 40 | 0.831 | 40 | 0.831 | 40 | 0.831 |
| S4 | 71 | 0.814 | 71 | 0.814 | 71 | 0.815 |
4. Real data example
In this section, we give an application to the AIDS data set, available in the “DTDA” R package and the textbook of [28] (page 19) and already used by Ref. [1]. The data present the infection and induction times for n = 258 adults who were infected with HIV virus and developed AIDS by June 30, 1986. The variable of interest here is the time of induction T of the disease duration which elapses between the date of infection M and the date M + T of the declaration of the disease. The sample (T1, M1), …, (Tn, Mn) are taken between two fixed dates: “0” and “8”, i.e. between April 1, 1978, and June 30, 1986. The initial date “0” denotes an infection occurring in the three months: from April 1, 1978, to June 30, 1978. Let us assume that M and T are the observed rv’s, corresponding to the underlying rv’s M and T, given by the truncation scheme 0 ≤ M + T ≤ 8, which in turn may be rewritten into
where S≔8 − T. To work within the framework of the present paper, let us make the following transformations:
where ϵ = 0.05 so that the two denominators be non-null. Thus, in view of , we have X ≤ Y, which means that X is randomly right-truncated by Y. Thereby, for the given sample (T1, M1), …, (Tn, Mn), from , the previous transformations produce a new one (X1, Y1), …, (Xn, Yn) from .
Let us now denote by F and G the df’s of the underling rv’s X and Y corresponding to the truncated rv’s X and Y, respectively. By using parametric likelihood methods, [29] fits both df’s of M and S by the two-parameter Weibull model, this implies that the df’s of F and G by may be fitted by two-parameter Fréchet model, namely , x > 0, a > 0, r > 0, hence both F and G are heavy-tailed. The estimated parameters corresponding to the fitting of df G are a0 = 0.004 and r0 = 2.1, see also [1] page 520. Thus, one may consider that df G is known and equals , where . By using the Thomas and Reiss algorithm, given above, we compute the optimal sample fraction k* corresponds to the tail index estimator of df F is γ1. We find
The well-known Weissman estimator [30] of the high quantile, , corresponding to the underling df F is given by
where and Fn is the semiparametric estimator of df F of X given in . From the values , we get . Let us now compute the high quantile of T based on the original data, T1, …, Tn. Recall that and , this implies that , this means that 1/qv − 8 + ϵ is the high quantile of T, which corresponds to the end-time tend that we want to estimate. Thereby , the value the end time of induction of AIDS is: 8 years, 4 months and 24 days.
5. Proofs
5.1 Proof of Theorem 2.1
Let us first notice that the semiparametric estimator of df F given in may be rewritten into
and , where denotes the usual empirical df pertaining to the observed sample X1, …, Xn. It is worth mentioning that by using the strong law of large numbers (almost surely) as n → ∞, where (see e.g. Lemma 3.2 in Ref. [2]. On the other hand from equation , we deduce that , it follows that because we already assumed that G ≡ Gθ. Next we use the distribution tail
and its empirical counterpart
We begin by decomposing , for x > 1, into the sum of
and
Our goal is to provide a weighted weak approximation to the tail empirical process . Let , i = 1, …, n be a sequence of independent and identically distributed rv’s. Recall that both df’s F and Gθ are assumed to be continuous, this implies that F* is continuous as well, therefore , this means that are uniformly distributed on . Let us now define the corresponding uniform tail empirical process
where
denotes the tail empirical df pertaining to the sample . In view of Proposition 3.1 of [31], there exists a Wiener process W such that for every 0 ≤ ϵ < 1/2,
Let us fix a sufficiently small 0 < ϵ < 1/2. We will successively show that, under the first-order conditions of regular variation , we have, uniformly on x ≥ 1, for all large n:
and
while
and
Throughout the proof, without loss of generality, we assume that aϵ ≡ ϵ, for any constant a > 0. We point out that all the rest terms of the previous approximations are negligible in probability, uniformly on x > 1. Let us begin by the term which may be made into
Applying the mean value theorem (for several variables) to function , yields
where is such that is between θi and , for i = 1, …, d, therefore
Recall that by assumptions and both and are regularly varying with the same index and, on the other hand, and w > 1 imply that . Applying Pooter’s inequalities , we get
it follows that
Under some regularity assumptions, [16] stated that is asymptotically a centered multivariate normal rv, which implies that and thus . On the other hand, by the law of large numbers as n → ∞, then we may readily show that as n → ∞ as well. Note that since is a consistent estimator of θ then is too. Then by using the fact that and both conditions and , we show readily that
and . In view of Lemma A1 in Ref. [7], we infer that , thus
where
Making use of representation , we write
Once again by using the routine manipulations of Potter’s inequalities, we show that the first integral in is equal to
An integration by parts to the previous integral yields
Recall that from,we have , then
uniformly on w > 1. Therefore, the previous quantity reduces into
Thereby the first expression between two brackets in (5.30) equals . Let us consider the second factor in (5.30). By similar arguments as used for the first factor, we show that
multiplied by , uniformly on x > 1. From Lemma 7.1, we have
which implies that the previous expression equals , thus and therefore
By assumption k/n → 0, it follows that which meets the result of (5.30). Let now consider the second term which may be rewritten into
In view of Potter’s inequalities, it is clear that
and
Smirnov’s lemma (see, e.g. Lemma 2.2.3 in Ref. [5] with the fact that imply that , hence . Therefore,
On the other hand, using an integration by parts yields
where
and
By using the change of variables , it is easy to verify that
Observe that
where and Un are the tail empirical df given in (5.24). Thereby,
with αn being the tail empirical process defined in (5.23). Let us decompose the previous integral into
By applying weak approximation (5.25), we get
Observe that , thereby
It is easy to check that , then once again by means of Pooter’s inequality, we show that , therefore
By using an elementary integration, we get
By replacing γ by its by its expression given in (1.8), we end up with
The term Rn may be decomposed into
It is clear that
It is ready to check, by using the change of variables , that the previous first factor between the curly brackets equals
From Lemma 3.2 in Ref. [31] , for any 0 < δ < 1/2, then since , as n → ∞, we infer that
for all large n. On the other hand, we already pointed out above that
which implies that the second factor is equal to
which after integration yields
Recall that from formula (1.8), we have γ2/γ > 1, then by using the mean value theorem and Pooter’s inequalities, we get . The second term Rn2 may be decomposed into
From Proposition B.1.10 in Ref. [5], we have with high probability,
this means that , as n → ∞. This implies by using Levy’s modulus of continuity of the Wiener process (see, e.g. Theorem 1.1.1 in Ref. [32]) that
with high probability. By using the fact that log s < ϵs−ϵ, for s ↓ 0 together with inequality (5.31), we show that
uniformly on , it follows that
Recall that the assumption γ1 < γ2 together with equation 1/γ = 1/γ1 + 1/γ2, imply that , thus , therefore . Then we showed that
hence
It is clear that
then
By using similar arguments, we end up with
therefore, we omit further details. Finally, we have
Let us now focus on the term . From the latter approximation, we infer that
which implies that
In other words, we have
The regular variation of and (5.33) together imply that
For the fourth term , we write
From (5.34) the first factor of the previous equation equals . On the other hand, the change of variables yields
Since , then we easily show that
it follows that as well. Therefore,
Hence, we have
By assumption, satisfies the second-order condition of regular variation (1.5), this means that for
for any x > 0, where ρ1 < 0 is the second-order parameter and A is . The uniform inequality corresponding to says: there exist t0 > 0, such that for any t > t0, we have
see for instance assertion (2.3.23) of Theorem 2.3.9 in Ref. [5]. It is easy to check that the latter inequality implies that
Recall that and notice that as n → ∞, then in view of the regular variation of A, we infer that . On the other hand, by assumption is asymptotically bounded, therefore
To summarize, at this stage, we showed that
where . By using a change of variables, we show that sum of the first three terms equals the Gaussian process stated in Theorem 2.1. Recall that γ1 < γ2 and
then it is easy to verify that . It follows that
uniformly on x > 1, therefore
for any sample 0 < ϵ < 1/2, which completes the proof of Theorem 2.1.
5.2 Proof of Theorem 2.2
From the representation , we write
where
and
Using Theorem 2.1 yields . Since, then it is easy to show that , it follows that . Using an elementary integration, we get which tends to zero as n → ∞, because ak → ∞ and is regularly varying with negative index. Therefore, , as n → ∞ which gives the first result of Theorem. To establish the asymptotic normality, we write
where
and
Note that is a centered Gaussian process and by using the assumption , we end up with
By elementary calculations (we omit the details), we show that
6. Conclusion
On the basis of a semiparametric estimator of the underlying distribution function, we proposed a new estimation method to the tail index of Pareto-type distributions for randomly right-truncated data. Compared with the existing ones, this estimator behaves well both in terms of bias and RMSE. A useful weak approximation of the corresponding tail empirical process allowed us to establish both the consistency and asymptotic normality of the proposed estimator.
The authors are indebted to the reviewers for their pertinent remarks and valuable suggestions that led to a real improvement of the paper.
References
Further reading
Appendix
For any small ϵ > 0, we have
Let be the uniform empirical df pertaining to the sample , i = 1, …, n, of independent and identically distributed uniform rv’s. It is clear that, for an arbitrary x, we have almost surely. From Assertion 7 in Ref. [33] (page 415), uniformly on 1/n ≤ t ≤ 1, this implies that
On the other hand, by applying Potter’s inequalities (1.4) to , we get








