IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v51y2022i14p4638-4652.html
   My bibliography  Save this article

On the behavior of the high order stop-loss transform for convolutions with some applications

Author

Listed:
  • Idir Arab
  • Milto Hadjikyriakou
  • Paulo Eduardo Oliveira

Abstract

High order stop-loss transforms provide a risk measure that enables some flexibility on the weight given to high or low values of the risk. We interpret stop-loss transforms as iterated distributions and prove a recursive representation for risks expressed as convolutions. We apply this to the case of gamma distributions with integer shape parameter, the Erlang distributions, proving that high order stop-loss transforms are equivalent to the tails of the exponential distribution. The latter result is also extended to general gamma distributions. Furthermore, we prove that this equivalence to exponential tails does not hold in general, by proving that the stop-loss transform for a Weilbull distribution degenerates, unless, of course, in the exponential case.

Suggested Citation

  • Idir Arab & Milto Hadjikyriakou & Paulo Eduardo Oliveira, 2022. "On the behavior of the high order stop-loss transform for convolutions with some applications," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(14), pages 4638-4652, July.
  • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:14:p:4638-4652
    DOI: 10.1080/03610926.2020.1818101
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1818101
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2020.1818101?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:lstaxx:v:51:y:2022:i:14:p:4638-4652. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.