IDEAS home Printed from https://ideas.repec.org/a/taf/japsta/v35y2008i6p601-615.html
   My bibliography  Save this article

Optimal lag-length choice in stable and unstable VAR models under situations of homoscedasticity and ARCH

Author

Listed:
  • R. Scott Hacker
  • Abdulnasser Hatemi-J

Abstract

The performance of different information criteria – namely Akaike, corrected Akaike (AICC), Schwarz–Bayesian (SBC), and Hannan–Quinn – is investigated so as to choose the optimal lag length in stable and unstable vector autoregressive (VAR) models both when autoregressive conditional heteroscedasticity (ARCH) is present and when it is not. The investigation covers both large and small sample sizes. The Monte Carlo simulation results show that SBC has relatively better performance in lag-choice accuracy in many situations. It is also generally the least sensitive to ARCH regardless of stability or instability of the VAR model, especially in large sample sizes. These appealing properties of SBC make it the optimal criterion for choosing lag length in many situations, especially in the case of financial data, which are usually characterized by occasional periods of high volatility. SBC also has the best forecasting abilities in the majority of situations in which we vary sample size, stability, variance structure (ARCH or not), and forecast horizon (one period or five). frequently, AICC also has good lag-choosing and forecasting properties. However, when ARCH is present, the five-period forecast performance of all criteria in all situations worsens.

Suggested Citation

  • R. Scott Hacker & Abdulnasser Hatemi-J, 2008. "Optimal lag-length choice in stable and unstable VAR models under situations of homoscedasticity and ARCH," Journal of Applied Statistics, Taylor & Francis Journals, vol. 35(6), pages 601-615.
  • Handle: RePEc:taf:japsta:v:35:y:2008:i:6:p:601-615
    DOI: 10.1080/02664760801920473
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/02664760801920473
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/02664760801920473?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Lists

    This item is featured on the following reading lists, Wikipedia, or ReplicationWiki pages:
    1. Векторна авторегресія in Wikipedia Ukranian
    2. مدل بردارهای خودبرگشتی in Wikipedia Persian
    3. Vektör otoregresyon in Wikipedia Turkish

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:japsta:v:35:y:2008:i:6:p:601-615. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/CJAS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.