Maxima and exceedances of stationary Markov chains
- 1 March 1988
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 20 (02) , 371-390
- https://doi.org/10.1017/S000186780001702X
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.Keywords
This publication has 16 references indexed in Scilit:
- A Markov chain approach to periodic queuesJournal of Applied Probability, 1987
- Sojourns and Extremes of Stationary ProcessesThe Annals of Probability, 1982
- Limit Theorems for Extreme Values of Chain-Dependent ProcessesThe Annals of Probability, 1975
- Level-crossing problems for random processesIEEE Transactions on Information Theory, 1973
- Extreme value theory for a class of discrete distributions with applications to some stochastic processesJournal of Applied Probability, 1970
- On the limit distribution of the maximum of a random number of independent random variablesActa Mathematica Hungarica, 1964
- Limit Theorems for the Maximum Term in Stationary SequencesThe Annals of Mathematical Statistics, 1964
- Limiting Distribution of the Maximum of a Diffusion ProcessThe Annals of Mathematical Statistics, 1964
- Limiting Distribution of the Maximum Term in Sequences of Dependent Random VariablesThe Annals of Mathematical Statistics, 1962
- The First Passage Problem for a Continuous Markov ProcessThe Annals of Mathematical Statistics, 1953