Computer-intensive rate estimation, diverging statistics and scanning
Abstract
A general rate estimation method is proposed that is based on studying the in-sample evolution of appropriately chosen diverging/converging statistics. The proposed rate estimators are based on simple least squares arguments, and are shown to be accurate in a very general setting without requiring the choice of a tuning parameter. The notion of scanning is introduced with the purpose of extracting useful subsamples of the data series; the proposed rate estimation method is applied to different scans, and the resulting estimators are then combined to improve accuracy. Applications to heavy tail index estimation as well as to the problem of estimating the long memory parameter are discussed; a small simulation study complements our theoretical results.
Cite
@article{arxiv.0710.5004,
title = {Computer-intensive rate estimation, diverging statistics and scanning},
author = {Tucker McElroy and Dimitris N. Politis},
journal= {arXiv preprint arXiv:0710.5004},
year = {2009}
}
Comments
Published in at http://dx.doi.org/10.1214/009053607000000064 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)