IDEAS home Printed from https://ideas.repec.org/a/bla/jtsera/v17y1996i5p511-531.html
   My bibliography  Save this article

Optimal Prediction Of Catastrophes In Autoregressive Moving‐Average Processes

Author

Listed:
  • A. Svensson
  • J. Holst
  • R. Lindquist
  • G. Lindgren

Abstract

. This paper presents an optimal predictor of level crossings, catastrophes, for autoregressive moving‐average processes, and investigates the performance of the predictor. The optimal catastrophe predictor is the predictor that gives a minimal number of false alarms for a fixed detection probability. As a tool for evaluating, comparing and constructing the predictors a method using operating characteristics, i.e. the probability of correct alarm and the probability of detecting a catastrophe for the predictor, is used. An explicit condition for the optimal catastrophe predictor based on linear prediction of future process values is given and compared with a naive catastrophe predictor, which alarms when the predicted process values exceed a given level, and with some different approximations of the optimal predictor. Simulations of the different algorithms are presented, and the performance is shown to agree with the theoretical results. All results indicate that the optimal catastrophe predictor is far better than the naive predictor. They also show that it is possible to construct an approximate catastrophe predictor requiring fewer computations without losing too much of the optimal predictor performance.

Suggested Citation

  • A. Svensson & J. Holst & R. Lindquist & G. Lindgren, 1996. "Optimal Prediction Of Catastrophes In Autoregressive Moving‐Average Processes," Journal of Time Series Analysis, Wiley Blackwell, vol. 17(5), pages 511-531, September.
  • Handle: RePEc:bla:jtsera:v:17:y:1996:i:5:p:511-531
    DOI: 10.1111/j.1467-9892.1996.tb00291.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1467-9892.1996.tb00291.x
    Download Restriction: no

    File URL: https://libkey.io/10.1111/j.1467-9892.1996.tb00291.x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Petropoulos, Fotios & Apiletti, Daniele & Assimakopoulos, Vassilios & Babai, Mohamed Zied & Barrow, Devon K. & Ben Taieb, Souhaib & Bergmeir, Christoph & Bessa, Ricardo J. & Bijak, Jakub & Boylan, Joh, 2022. "Forecasting: theory and practice," International Journal of Forecasting, Elsevier, vol. 38(3), pages 705-871.
      • Fotios Petropoulos & Daniele Apiletti & Vassilios Assimakopoulos & Mohamed Zied Babai & Devon K. Barrow & Souhaib Ben Taieb & Christoph Bergmeir & Ricardo J. Bessa & Jakub Bijak & John E. Boylan & Jet, 2020. "Forecasting: theory and practice," Papers 2012.03854, arXiv.org, revised Jan 2022.
    2. Pasquale Cirillo & Jürg Hüsler & Pietro Muliere, 2013. "Alarm Systems and Catastrophes from a Diverse Point of View," Methodology and Computing in Applied Probability, Springer, vol. 15(4), pages 821-839, December.
    3. Taleb, Nassim Nicholas & Bar-Yam, Yaneer & Cirillo, Pasquale, 2022. "On single point forecasts for fat-tailed variables," International Journal of Forecasting, Elsevier, vol. 38(2), pages 413-422.
    4. Nassim Nicholas Taleb & Yaneer Bar-Yam & Pasquale Cirillo, 2020. "On Single Point Forecasts for Fat-Tailed Variables," Papers 2007.16096, arXiv.org.
    5. M. Antunes & M. A. Amaral Turkman & K. F. Turkman, 2003. "A Bayesian Approach to Event Prediction," Journal of Time Series Analysis, Wiley Blackwell, vol. 24(6), pages 631-646, November.
    6. Halfdan Grage & Jan Holst & Georg Lindgren & Mietek Saklak, 2010. "Level Crossing Prediction with Neural Networks," Methodology and Computing in Applied Probability, Springer, vol. 12(4), pages 623-645, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jtsera:v:17:y:1996:i:5:p:511-531. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0143-9782 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.