Clustering of Markov chain exceedances

From MaRDI portal
Publication:373538

DOI10.3150/12-BEJSP08zbMATH Open1284.60106arXiv1210.2314OpenAlexW2093049857MaRDI QIDQ373538FDOQ373538


Authors: David Zeber, Sidney I. Resnick Edit this on Wikidata


Publication date: 17 October 2013

Published in: Bernoulli (Search for Journal in Brave)

Abstract: The tail chain of a Markov chain can be used to model the dependence between extreme observations. For a positive recurrent Markov chain, the tail chain aids in describing the limit of a sequence of point processes Nn,ngeq1, consisting of normalized observations plotted against scaled time points. Under fairly general conditions on extremal behaviour, Nn converges to a cluster Poisson process. Our technique decomposes the sample path of the chain into i.i.d. regenerative cycles rather than using blocking argument typically employed in the context of stationarity with mixing.


Full work available at URL: https://arxiv.org/abs/1210.2314




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Clustering of Markov chain exceedances

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