Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
416979 | Computational Statistics & Data Analysis | 2011 | 10 Pages |
Abstract
The finite-sample size and power properties of bootstrapped likelihood ratio system cointegration tests are investigated via Monte Carlo simulations when the true lag order of the data generating process is unknown. Recursive bootstrap schemes are employed which differ in the way in which the lag order is chosen. The order is estimated by minimizing different information criteria and by combining the corresponding order estimates. It is found that, in comparison to the standard asymptotic likelihood ratio test based on an estimated lag order, bootstrapping can lead to improvements in small samples even when the true lag order is unknown, while the power loss is moderate.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Christian Kascha, Carsten Trenkler,