Abstract
The upcrossings index \(0\le \eta \le 1,\) as a measure of the degree of local dependence in the upcrossings of a high level by a stationary process, plays, together with the extremal index \(\theta ,\) an important role in extreme events modelling. For stationary processes, verifying a long range dependence condition, upcrossings of high thresholds in different blocks can be assumed asymptotically independent and therefore blocks estimators for the upcrossings index can be easily constructed using disjoint blocks. In this paper we focus on the estimation of the upcrossings index via the blocks method and properties such as consistency and asymptotic normality are studied. Besides this new estimation approach for this parameter, we also enlarge its family of runs estimators and improve estimation within this class by providing an empirical way of checking local dependence conditions that control the clustering of upcrossings. We compare the performance of a range of different estimators for \(\eta \) and illustrate the methods using simulated data and financial data.
Similar content being viewed by others
References
Ancona-Navarrete MA, Tawn JA (2000) A comparison of methods for estimating the extremal index. Extremes 3(1):5–38
Alpuim M (1989) An extremal Markovian sequence. J Appl Prob 26:219–232
Chernick M, Hsing T, McCormick W (1991) Calculating the extremal index for a class of stationary sequences. Adv Appl Prob 23:835–850
Curto JD, Pinto JC, Tavares GN (2009) Modelling stock markets’ volatility using GARCH models with normal, student’s t and stable Paretian distributions. Stat Papers 50:311–321
Davis RA, Resnick SI (1989) Basic properties and prediction of max-ARMA processes. Adv Appl Prob 21:781–803
Ferreira H (1994) Multivariate extreme values in T-periodic random sequences under mild oscillation restrictions. Stoch Process Appl 49:111–125
Ferreira H (2006) The upcrossing index and the extremal index. J Appl Prob 43:927–937
Ferreira H (2007) Runs of high values and the upcrossings index for a stationary sequence. In: Proceedings of the 56th Session of the ISI
Ferreira M, Ferreira H (2012) On extremal dependence: some contributions. Test 21(3):566–583
Ferro C, Segers J (2003) Inference for clusters of extreme values. J R Stat Soc B 65:545–556
Frahm G, Junker M, Schmidt R (2005) Estimating the tail-dependence coefficient: properties and pitfalls. Insurance 37:80–100
Gomes M (1993) On the estimation of parameters of rare events in environmental time series. In: Barnett V, Turkman K (eds) Statistics for the environment 2: water related issues. Wiley, Chichester, pp 225–241
Hsing T, Hüsler J, Leadbetter MR (1988) On the exceedance point process for a stationary sequence. Prob Theory Rel Fields 78:97–112
Hsing T (1991) Estimating the parameters of rare events. Stoch Process Appl 37(1):117–139
Klar B, Lindner F, Meintanis SG (2012) Specification tests for the error distribution in Garch models. Comput Stat Data Anal 56(11):3587–3598
Leadbetter MR (1983) Extremes and local dependence in stationary processes. Z Wahrsch verw Gebiete 65:291–306
Leadbetter MR, Nandagopalan S (1989) On exceedance point process for stationary sequences under mild oscillation restrictions. In: Hüsler J, Reiss D (eds) Extreme value theory: proceedings, oberwolfach \(1987\). Springer, New York, pp 69–80
Neves M, Gomes MI, Figueiredo F, Gomes D (2015) Modeling extreme events: sample fraction adaptive choice in parameter estimation. J Stat Theory Pract 9(1):184–199
Northrop PJ (2015) An efficient semiparametric maxima estimator of the extremal index. Extremes 18(4):585–603
Robert CY, Segers J, Ferro C (2009) A sliding blocks estimator for the extremal index. Electron J Stat 3:993–1020
Scarrott C, MacDonald A (2012) A review of extreme value threshold estimation and uncertainty quantification. REVSTAT—Stat J 10:33–60
Sebastião J, Martins AP, Pereira L, Ferreira H (2010) Clustering of upcrossings of high values. J Stat Plann Inference 140:1003–1012
Sebastião J, Martins AP, Ferreira H, Pereira L (2013) Estimating the upcrossings index. Test 22(4):549–579
Süveges M (2007) Likelihood estimation of the extremal index. Extremes 10:41–55
Volkonski VA, Rozanov YA (1959) Some limit theorems for random function I. Theory Probab Appl 4:178–197
Acknowledgements
We acknowledge the support from research unit “Centro de Matemática e Aplicações” of the University of Beira Interior, through the research Project UID/MAT/00212/2013. The authors are thankful to the referee for for their insightful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Appendix A: Proofs for section 2
Appendix A: Proofs for section 2
1.1 Proof of Theorem 1
Let us consider the sample \(X_1,\ldots , X_{[n/c_n]},\) divided into \(k_n/c_n\) disjoint blocks. We can then apply the arguments used in Lemma 2.1 of Ferreira (2006) and conclude that
Now, from the definition of the upcrossings index \(\eta \) we have \(P(\widetilde{N}_{[n/c_n]}(v_n)=0)\xrightarrow [n\rightarrow +\infty ]{} e^{-\eta \nu },\) hence applying logarithms on both sides of (5.1), (2.4) follows immediately.
For the conditional mean number of upcrossings in each block, we have from (2.4) and the definition of the thresholds \(v_n\)
which completes the proof since \(k_nr_n\sim n.\)\(\square \)
1.2 Proof of Theorem 2
It suffices to show that
and
(5.2) follows immediately from Theorem 1 since
To show (5.3), lets start by noting that Theorem 2 of Hsing (1991) holds for \(\widehat{\widetilde{\pi }}_n(j;v_n)\) and \(\widetilde{\pi }_n(j;v_n),\) if \(Y_{n1},\) the number of exceedances of \(v_n\) in a block of size \(r_n,\) is replaced by \(\widetilde{N}_{r_n}(v_n).\) The proof now follows from considering \(\alpha =1\) and \(T(j)=j{1\mathrm{I}}_{\{j\ge 1\}}\) in this theorem for \(\widetilde{N}_{r_n}(v_n)\) and verifying that conditions (a), (c) and (d) of this theorem follow from the assumptions of Theorem 1, (2) and (3), (b) follows from Theorem 1 and (e) from the fact that
\(\square \)
1.3 Proof of Theorem 3
From Cramer-Wald’s Theorem we know that a necessary and sufficient condition for (2.5) to hold is that for any \(a, b\in {\mathrm{I}R}\)
We shall therefore prove (5.4). For this, lets consider
and note that
Now, since (5.5) holds, to show (5.4) we have to prove the following
Lets first prove (5.6). The summands in \(\sum _{i=1}^{k_n}(aU_{r_n-l_n}^{(i)}(v_n)+b{1\mathrm{I}}_{\{U_{r_n-l_n}^{(i)}(v_n)>0\}})\) are functions of indicator variables that are at least \(l_n\) time units apart from each other, therefore for each \(t\in {\mathrm{I}R}\)
where, \(\mathrm {i}\) is the imaginary unit, from repeatedly using a result in Volkonski and Rozanov (1959) and the triangular inequality. Now, since condition \(\Delta (v_n)\) holds for \(\mathbf{{X}}\) (5.10) tends to zero and so we can assume that the summands are i.i.d.. Therefore, in order to apply Lindberg’s Central Limit Theorem we need to verify that
since \(\frac{k_n}{c_n}E^2[U_{r_n-l_n}(v_n)]\xrightarrow [n\rightarrow +\infty ]{}0,\) and Lindberg’s Condition
with \(U_{r_n-l_n}(v_n)=U_{r_n-l_n}^{(1)}(v_n).\)
From the definition of \(\widetilde{N}_{r_n}^{(i)}(v_n)\) and \(V_{l_n}^{(i)}(v_n)\) and assumption (2) we have that
with \(V_{r_n}(v_n)=V_{r_n}^{(1)}(v_n).\) Now, by Cauchy-Schwarz’s inequality
thus
On the other hand, since \(k_n(r_n-l_n)\sim n,\) Theorem 1 implies that
Furthermore, by definition (2.3)
(5.14)-(5.16) prove (5.11) and since Lindberg’s Condition follows immediately from assumption (1), (5.6) is proven.
Finally, since Theorem 1 of Hsing (1991) holds for \(\widetilde{N}_{r_n}(v_n),\) it implies (5.7) and (5.8) because \(\frac{k_n}{c_n}E[V_{l_n}^2(v_n)]\xrightarrow [n\rightarrow +\infty ]{}0\) by (5.13) and
by Theorem 1 and (5.15). This concludes the proof. \(\square \)
1.4 Proof of Corollary 1
Since \(\eta _n\xrightarrow [n\rightarrow +\infty ]{}\eta ,\) by Theorem 1, \(\frac{k_n}{c_n}E[\widetilde{N}_{r_n}(v_n)]\xrightarrow [n\rightarrow +\infty ]{}\nu ,\) and \(c_n^{-1}\sum _{i=1}^{k_n}(\widetilde{N}_{r_n}^{(i)}(v_n) -E[\widetilde{N}_{r_n}^{(i)}(v_n)])\xrightarrow [n\rightarrow +\infty ]{P}0,\) by Theorem 1 of Hsing (1991) which holds for \(\widetilde{N}{r_n}^{(i)}(v_n),\) the result now follows from the fact that
and Theorem 3. \(\square \)
1.5 Proof of Theorem 4
Since (5.2) holds, we only need to show that
Lets start by noting that for \(v_n^{(\tau )}\) such that \(P(X_1>v_n^{(\tau )})\sim c_n\tau /n\) as \(n\rightarrow +\infty \) and \(\epsilon >0\) we have
(5.18) proves condition b) of Theorem 3 in Hsing (1991) which holds for \(\widetilde{N}_{r_n}(v_n),\) where \(T(j)=j{1\mathrm{I}}_{\{j\ge 1\}}.\) The other conditions have been verified in the proof of Theorem 2 as well as the conditions of Corollary 2.4 in Hsing (1991) for \(\widetilde{N}_{r_n}(v_n).\) Therefore (5.17) holds, completing the proof. \(\square \)
Rights and permissions
About this article
Cite this article
Martins, A.P., Sebastião, J.R. Methods for estimating the upcrossings index: improvements and comparison. Stat Papers 60, 1317–1347 (2019). https://doi.org/10.1007/s00362-017-0876-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00362-017-0876-x
Keywords
- Upcrossings index
- Blocks estimators
- Runs estimators
- Dependence conditions
- Consistency and asymptotic normality