IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v44y2015i10p2059-2078.html
   My bibliography  Save this article

Autoregressive Order Identification for VAR Models with Non Constant Variance

Author

Listed:
  • Hamdi Raïssi

Abstract

The identification of the lag length for vector autoregressive (VAR) models by mean of Akaike information criterion (AIC${\textit{AIC}}$), partial autoregressive, and correlation matrices (PAM and PCM hereafter) is studied in the framework of processes with time-varying variance. It is highlighted that the use of the standard tools is not justified in such a case. As a consequence considering the adequate expression of the likelihood of the model and the adaptive estimator of the autoregressive parameters, we propose new identifying tools. More precisely we approximate the correct AIC${\textit{AIC}}$ for VAR models with time-varying variance using an adaptive AIC${\textit{AIC}}$. It is found that the adaptive AIC${\textit{AIC}}$ is robust to the presence of unconditional heteroscedasticity. Corrected confidence bounds are proposed for the usual PAM and PCM obtained from the ordinary least squares (OLS) estimation. We also use the unconditional variance structure of the innovations to develop adaptive PAM and PCM. Noting that the adaptive estimator is more accurate than the usual OLS estimator, it is underlined that the adaptive PAM and PCM have a greater ability than the OLS PAM and PCM for detecting unnecessary large lag length for VAR models. Monte Carlo experiments show that the adaptive AIC${\textit{AIC}}$ selects satisfactorily the correct autoregressive order of VAR processes. An illustrative application using US international finance data is presented.

Suggested Citation

  • Hamdi Raïssi, 2015. "Autoregressive Order Identification for VAR Models with Non Constant Variance," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 44(10), pages 2059-2078, May.
  • Handle: RePEc:taf:lstaxx:v:44:y:2015:i:10:p:2059-2078
    DOI: 10.1080/03610926.2013.773763
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2013.773763?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

    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:lstaxx:v:44:y:2015:i:10:p:2059-2078. 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/lsta .

    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.