English

Transformed-Linear Innovations Algorithm for Modeling and Forecasting of Time Series Extremes

Statistics Theory 2023-09-20 v1 Statistics Theory

Abstract

The innovations algorithm is a classical recursive forecasting algorithm used in time series analysis. We develop the innovations algorithm for a class of nonnegative regularly varying time series models constructed via transformed-linear arithmetic. In addition to providing the best linear predictor, the algorithm also enables us to estimate parameters of transformed-linear regularly-varying moving average (MA) models, thus providing a tool for modeling. We first construct an inner product space of transformed-linear combinations of nonnegative regularly-varying random variables and prove its link to a Hilbert space which allows us to employ the projection theorem, from which we develop the transformed-linear innovations algorithm. Turning our attention to the class of transformed linear MA(\infty) models, we give results on parameter estimation and also show that this class of models is dense in the class of possible tail pairwise dependence functions (TPDFs). We also develop an extremes analogue of the classical Wold decomposition. Simulation study shows that our class of models captures tail dependence for the GARCH(1,1) model and a Markov time series model, both of which are outside our class of models.

Keywords

Cite

@article{arxiv.2309.10061,
  title  = {Transformed-Linear Innovations Algorithm for Modeling and Forecasting of Time Series Extremes},
  author = {Nehali Mhatre and Daniel Cooley},
  journal= {arXiv preprint arXiv:2309.10061},
  year   = {2023}
}

Comments

17 pages, 3 figures

R2 v1 2026-06-28T12:25:18.263Z