We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Efficient order selection algorithms for intege...
View graph of relations

« Back

Efficient order selection algorithms for integer valued ARMA processes

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>01/2009
<mark>Journal</mark>Journal of Time Series Analysis
Number of pages18
<mark>Original language</mark>English


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.