Finite-sample size distortion of the AESTAR unit root test: GARCH, corrected variance–covariance matrix estimators and adjusted critical values

2015 ◽  
Vol 23 (5) ◽  
pp. 318-323
Author(s):  
Steve Cook
1996 ◽  
Vol 12 (4) ◽  
pp. 724-731 ◽  
Author(s):  
Jon Faust

Said and Dickey (1984,Biometrika71, 599–608) and Phillips and Perron (1988,Biometrika75, 335–346) have derived unit root tests that have asymptotic distributions free of nuisance parameters under very general maintained models. Under models as general as those assumed by these authors, the size of the unit root test procedures will converge to one, not the size under the asymptotic distribution. Solving this problem requires restricting attention to a model that is small, in a topological sense, relative to the original. Sufficient conditions for solving the asymptotic size problem yield some suggestions for improving finite-sample size performance of standard tests.


2018 ◽  
Vol 8 (2) ◽  
pp. 289-312
Author(s):  
Dane Taylor ◽  
Juan G Restrepo ◽  
François G Meyer

Abstract Covariance matrices are fundamental to the analysis and forecast of economic, physical and biological systems. Although the eigenvalues $\{\lambda _i\}$ and eigenvectors $\{\boldsymbol{u}_i\}$ of a covariance matrix are central to such endeavours, in practice one must inevitably approximate the covariance matrix based on data with finite sample size $n$ to obtain empirical eigenvalues $\{\tilde{\lambda }_i\}$ and eigenvectors $\{\tilde{\boldsymbol{u}}_i\}$, and therefore understanding the error so introduced is of central importance. We analyse eigenvector error $\|\boldsymbol{u}_i - \tilde{\boldsymbol{u}}_i \|^2$ while leveraging the assumption that the true covariance matrix having size $p$ is drawn from a matrix ensemble with known spectral properties—particularly, we assume the distribution of population eigenvalues weakly converges as $p\to \infty $ to a spectral density $\rho (\lambda )$ and that the spacing between population eigenvalues is similar to that for the Gaussian orthogonal ensemble. Our approach complements previous analyses of eigenvector error that require the full set of eigenvalues to be known, which can be computationally infeasible when $p$ is large. To provide a scalable approach for uncertainty quantification of eigenvector error, we consider a fixed eigenvalue $\lambda $ and approximate the distribution of the expected square error $r= \mathbb{E}\left [\| \boldsymbol{u}_i - \tilde{\boldsymbol{u}}_i \|^2\right ]$ across the matrix ensemble for all $\boldsymbol{u}_i$ associated with $\lambda _i=\lambda $. We find, for example, that for sufficiently large matrix size $p$ and sample size $n> p$, the probability density of $r$ scales as $1/nr^2$. This power-law scaling implies that the eigenvector error is extremely heterogeneous—even if $r$ is very small for most eigenvectors, it can be large for others with non-negligible probability. We support this and further results with numerical experiments.


2016 ◽  
Vol 33 (3) ◽  
Author(s):  
Steven Cook

Using local-to-unity detrending, the GLS-based Dickey-Fuller test has been shown to possess higher power than other available unit root tests. As a result, application of this easily implemented test has increased in recent years. In the present study the finite-sample size and power of the GLS-based Dickey-Fuller test is examined in the presence of breaks in innovation variance under the null. In contrast to the original Dickey-Fuller test which has been shown to suffer severe distortion in such circumstances, the GLS-basedtest latter exhibits robustness to all but the most extreme breaks in variance.The results derived show the GLS-based test to be more robust to variance breaks than other modified Dickey-Fuller tests previously considered in the literature.


Sign in / Sign up

Export Citation Format

Share Document