2010 | OriginalPaper | Buchkapitel
Best attainable rates of convergence for the estimation of the memory parameter
verfasst von : Philippe Soulier
Erschienen in: Dependence in Probability and Statistics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The purpose of this note is to prove a lower bound for the estimation of the memory parameter of a stationary long memory process. The memory parameter is defined here as the index of regular variation of the spectral density at 0. The rates of convergence obtained in the literature assume second order regular variation of the spectral density at zero. In this note, we do not make this assumption, and show that the rates of convergence in this case can be extremely slow. We prove that the logperiodogram regression (GPH) estimator achieves the optimal rate of convergence for Gaussian long memory processes.