Estimation for a non-stationary semi-strong GARCH(1,1) model with heavy-tailed errors

O. Linton, J. Pan, H. Wang

Research output: Contribution to journalArticlepeer-review

32 Citations (Scopus)
120 Downloads (Pure)

Abstract

This paper studies the estimation of a semi-strong GARCH(1,1) model when it does not have a stationary solution, where semi-strong means that we do not require the errors to be independent over time. We establish necessary and su±cient conditions for a semi-strong GARCH(1,1) process to have a unique stationary solution. For the non-stationary semi-strong GARCH(1,1) model, we prove that a local minimizer of the least absolute deviations (LAD) criterion converges at the rate p n to a normal distribution under very mild moment conditions for the errors. Furthermore, when the distributions of the errors are in the domain of attraction of a stable law with the exponent · 2 (1; 2), it is shown that the asymptotic distribution of the Gaussian quasi-maximum likelihood estimator (QMLE) is non-Gaussian but is some stable law with the exponent · 2 (0; 2). The asymptotic distribution is di±cult to estimate using standard parametric methods. Therefore, we propose a percentile-t subsampling bootstrap method to do inference when the errors are independent and identically distributed, as in Hall and Yao (2003). Our result implies that the least absolute deviations estimator (LADE) is always asymptotically normal regardless of whether there exists a stationary solution or not even when the errors are heavy-tailed. So the LADE is more appealing when the errors are heavy-tailed. Numerical results lend further support to our theoretical results.
Original languageEnglish
Pages (from-to)1-28
Number of pages28
JournalEconometric Theory
Volume26
Issue number1
DOIs
Publication statusPublished - Feb 2010

Keywords

  • garch
  • stationary solution
  • model
  • mathematics
  • statistics

Fingerprint

Dive into the research topics of 'Estimation for a non-stationary semi-strong GARCH(1,1) model with heavy-tailed errors'. Together they form a unique fingerprint.

Cite this