Abstract

New notions of tail and nontail dependence are used to characterize separately extremal and nonextremal information, including tail log-exceedances and events, and tail-trimmed levels. We prove that near epoch dependence (McLeish, 1975; Gallant and White, 1988) andL0-approximability (Pötscher and Prucha, 1991) are equivalent for tail events and tail-trimmed levels, ensuring a Gaussian central limit theory for important extreme value and robust statistics under general conditions. We apply the theory to characterize the extremal and nonextremal memory properties of possibly very heavy-tailed GARCH processes and distributed lags. This in turn is used to verify Gaussian limits for tail index, tail dependence, and tail-trimmed sums of these data, allowing for Gaussian asymptotics for a new tail-trimmed least squares estimator for heavy-tailed processes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.