Asymptotic analysis of extremes from autoregressive negative binomial processes

From MaRDI portal





The authors extend the work of \textit{C. W. Anderson} [J. Appl. Probab. 7, 99--113 (1970; Zbl 0192.54202)] on the asymptotic behaviour of the maximum of a sequence of discrete random variates. They consider the negative binomial first order autoregression and the geometric autoregressive moving average process of the reviewer [Adv. Appl. Probab. 18, 679--705 (1986; Zbl 0603.62100)]. By establishing the validity of certain mixing conditions they show that the maximum of such processes can be bounded in the same way as that of an i.i.d. sequence. The results of a small sample simulation study are described.











This page was built for publication: Asymptotic analysis of extremes from autoregressive negative binomial processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031664)