IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-2856-1_72.html
   My bibliography  Save this book chapter

Bilinear (p, 0, 1, 1) Model and its Consistent Identification

In: Computing Science and Statistics

Author

Listed:
  • Jian Liu

    (University of British Columbia and Institute of Applied Mathematics, Academy of Science)

  • Zhao-Guo Chen

    (University of British Columbia and Institute of Applied Mathematics, Academy of Science)

Abstract

This paper is concerned with the BL(p, 0, 1, 1) model $$\sum_{j=0}^{p}a_jx(t-j)=e(t)+bx(t-1)e(t-1), \left\{e(t)\right\}$$ are iid, $$Ee(t)=0,Ee(t)^2=\sigma ^2$$ A concept of weak irreducibility is introduced. It is shown that the bilinear model can be expressed as an ARMA(p, 1) model in the sense of weak stationarity provided that weak irreducibility is satisfied. Using this expression we prove that the moment estimates of a j are unique and consistent. If, in addition, e(t) is JV(0, σ 2) or its first few order moment structure are known a prior, using up to the third order moments, b and σ 2 can also be estimated consistently. Furthermore, these estimates are shown to be asymptotically normal and have a convergence rate of O(ln ln N/N)1/2, where N is the number of observations. In contrast, the usual MLE estimates of the parameters have not been justified to have such asymptotic properties without assuming the finiteness of any order moments of the bilinear series and their infinite linear combinations. Finally, based on the ARMA expression, a consistent indentification procedure for the order p is proposed. Though the model discussed here is somewhat specialized, we hope that the ideas demonstrated here could highlight the possibility of making consistent inference without first solving the higher order moment problem.

Suggested Citation

  • Jian Liu & Zhao-Guo Chen, 1992. "Bilinear (p, 0, 1, 1) Model and its Consistent Identification," Springer Books, in: Connie Page & Raoul LePage (ed.), Computing Science and Statistics, pages 443-445, Springer.
  • Handle: RePEc:spr:sprchp:978-1-4612-2856-1_72
    DOI: 10.1007/978-1-4612-2856-1_72
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-1-4612-2856-1_72. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.