Clustering of large deviations in moving average processes: the long memory regime
From MaRDI portal
Abstract: We investigate how large deviations events cluster in the framework of an infinite moving average process with light-tailed noise and long memory. The long memory makes clusters larger, and the asymptotic behaviour of the size of the cluster turns out to be described by the first hitting time of a randomly shifted fractional Brownian motion with drift.
Recommendations
- Large deviations of \(\ell^p\)-blocks of regularly varying time series and applications to cluster inference
- Clustering behavior of finite variance partial sum processes
- Clustering of linearly interacting diffusions and universality of their long-time limit distribution
- Large Deviations of Poisson Cluster Processes
- Extremal clustering under moderate long range dependence and moderately heavy tails
- Clustering of discretely observed diffusion processes
- Large deviations for moving average processes
Cites work
Cited in
(5)- Clustering of large deviations in moving average processes: the short memory regime
- Large deviations of \(\ell^p\)-blocks of regularly varying time series and applications to cluster inference
- Long strange segments, ruin probabilities and the effect of memory on moving average processes
- The effect of memory on functional large deviations of infinite moving average processes
- Clustering of large deviations events in heavy-tailed moving average processes: the catastrophe principle in the short-memory case
This page was built for publication: Clustering of large deviations in moving average processes: the long memory regime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6171667)
