Efficient order selection algorithms for integer‐valued ARMA processes

Víctor Enciso‐Mora, Peter Neal and T. Subba Rao

Journal of Time Series Analysis, 2009, vol. 30, issue 1, 1-18

Abstract: Abstract. We consider the problem of model (order) selection for integer‐valued autoregressive moving‐average (INARMA) processes. A very efficient reversible jump Markov chain Monte Carlo (RJMCMC) algorithm is constructed for moving between INARMA processes of different orders. An alternative in the form of the EM algorithm is given for determining the order of an integer‐valued autoregressive (INAR) process. Both algorithms are successfully applied to both simulated and real data sets.

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9892.2008.00592.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jtsera:v:30:y:2009:i:1:p:1-18

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0143-9782

Access Statistics for this article

Journal of Time Series Analysis is currently edited by M.B. Priestley

More articles in Journal of Time Series Analysis from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().