Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T16:10:50.203Z Has data issue: false hasContentIssue false

Maxima and exceedances of stationary Markov chains

Published online by Cambridge University Press:  01 July 2016

Holger Rootzén*
Affiliation:
University of Copenhagen
*
∗ Present address: Department of Mathematical Statistics, University of Lund and Lund Institute of Technology, Box 118, S-221 00 Lund, Sweden.

Abstract

Recent work by Athreya and Ney and by Nummelin on the limit theory for Markov chains shows that the close connection with regeneration theory holds also for chains on a general state space. Here this is used to study extremal behaviour of stationary (or asymptotically stationary) Markov chains. Many of the results center on the ‘clustering’ of extremes of adjacent values of the chains. In addition one criterion for convergence of extremes of general stationary sequences is derived. The results are applied to waiting times in the GI/G/1 queue and to autoregressive processes.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1988 

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