Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-13T03:03:01.360Z Has data issue: false hasContentIssue false

BLOCK BOOTSTRAP HAC ROBUST TESTS: THESOPHISTICATION OF THE NAIVEBOOTSTRAP

Published online by Cambridge University Press:  08 March 2011

Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper studies the properties of naive blockbootstrap tests that are scaled by zero frequencyspectral density estimators (long-run varianceestimators). The naive bootstrap is a bootstrapwhere the formula used in the bootstrap world tocompute standard errors is the same as the formulaused on the original data. Simulation evidence showsthat the naive bootstrap can be much more accuratethan the standard normal approximation. The largerthe HAC bandwidth, the greater the improvement. Thisimprovement holds for a large number of popularkernels, including the Bartlett kernel, and it holdswhen the independent and identically distributed(i.i.d.) bootstrap is used and yet the data areserially correlated. Using recently developedfixed-b asymptotics for HACrobust tests, we provide theoretical results thatcan explain the finite sample patterns. We show thatthe block bootstrap, including the special case ofthe i.i.d. bootstrap, has the same limitingdistribution as the fixed-basymptotic distribution. For the special case of alocation model, we provide theoretical results thatsuggest the naive bootstrap can be more accuratethan the standard normal approximation depending onthe choice of the bandwidth and the number of finitemoments in the data. Our theoretical results lay thefoundation for a bootstrap asymptotic theory that isan alternative to the traditional approach based onEdgeworth expansions.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2011