zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Efficient order selection algorithms for integer-valued ARMA processes. (English) Zbl 1224.62053
P. Neal and T. Subba Rao [ibid. 28, No. 1, 92–110 (2007; Zbl 1164.62049)] presented a Markov chain Monte Carlo (MCMC) algorithm for obtaining samples from the posterior distributions of parameters of a general INARMA(p,q) process with known orders p and q. For an excellent review of integer-valued time-series, and in particular integer-valued ARMA (INARMA) models, see E. McKenzie [D.N. Shanbhag et al. (eds), Stochastic processes: Modelling and simulation. Amsterdam: North-Holland, Handb. Stat. 21, 573–606 (2003; Zbl 1064.62560)]. One of the main limitations of the algorithm of Neal and Subba Rao is that there is assumed that p and q are known/fixed. The authors of this article propose two approaches for treating p and q as parameters in the model. The first is an extension of the MCMC algorithm of Neal and Subba Rao. They present an efficient reversible jump (RJ)MCMC algorithm (introduced by P.J. Green [Biometrika 82, No. 4, 711–732 (1995; Zbl 0861.62023)]) for inference on the orders p and q of the INARMA(p,q) model. The algorithm is shown to be very successful at detecting the correct order for simulated data sets and to produce good results for real-life data sets. Furthermore, the algorithm freely moves between the INARMA(p,q) and the sub-models INAR(p) and INMA(q). An alternative to MCMC is given in the form of the EM algorithm for determining the order of an integer-valued autoregressive INAR(p) process. This algorithm performs very similar to the MCMC algorithm.
MSC:
62M10Time series, auto-correlation, regression, etc. (statistics)
65C05Monte Carlo methods
65C60Computational problems in statistics