Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T02:10:23.354Z Has data issue: false hasContentIssue false

Asymptotic analysis of extremes from autoregressive negative binomial processes

Published online by Cambridge University Press:  14 July 2016

William P. McCormick*
Affiliation:
University of Georgia
You Sung Park*
Affiliation:
University of Georgia
*
∗ Postal address: Department of Statistics, University of Georgia, Athens, GA 30602, USA.
∗ Postal address: Department of Statistics, University of Georgia, Athens, GA 30602, USA.

Abstract

It is well known that most commonly used discrete distributions fail to belong to the domain of maximal attraction for any extreme value distribution. Despite this negative finding, C. W. Anderson showed that for a class of discrete distributions including the negative binomial class, it is possible to asymptotically bound the distribution of the maximum. In this paper we extend Anderson's result to discrete-valued processes satisfying the usual mixing conditions for extreme value results for dependent stationary processes. We apply our result to obtain bounds for the distribution of the maximum based on negative binomial autoregressive processes introduced by E. McKenzie and Al-Osh and Alzaid. A simulation study illustrates the bounds for small sample sizes.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable