IDEAS home Printed from https://ideas.repec.org/p/aiz/louvar/2024011.html
   My bibliography  Save this paper

A Recursive Method for Fractional Hawkes Intensities and the Potential Approach of Credit Risk

Author

Listed:
  • Ketelbuters, John John

    (Université catholique de Louvain, LIDAM/ISBA, Belgium)

  • Hainaut, Donatien

    (Université catholique de Louvain, LIDAM/ISBA, Belgium)

Abstract

This article explores the potential approach for credit risk, which is an alternative to structural and reduced models. In the context of credit risk, it consists in assuming that the survival probability of a company is equal to the ratio of the expected value of a supermartingale divided by its initial value. This approach, that was previously used for modeling the term structure of interest rates, is extended by the use of a fractional self-exciting process, or fractional Hawkes process. This is a self-exciting process that is time-changed by the inverse of an alpha-stable subordinator. A self-exciting process allows to take into account the clustering of economic events such as defaults, whereas the time-change allows to properly fit highly convex survival probability curves. We derive a new recursive method that allows to compute all the moments of a self-exciting process intensity, as well as its time-changed counterpart. We show that this method can be used to approximate the survival probabilities in the potential approach. More specifically, we prove that the approximation converges and we provide a bound on the numerical error. Finally, we calibrate the model and show that it allows to properly fit survival probability curves that are highly convex.

Suggested Citation

  • Ketelbuters, John John & Hainaut, Donatien, 2024. "A Recursive Method for Fractional Hawkes Intensities and the Potential Approach of Credit Risk," LIDAM Reprints ISBA 2024011, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
  • Handle: RePEc:aiz:louvar:2024011
    Note: In: Journal of Computational and Applied Mathematics, 2024
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:aiz:louvar:2024011. 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: Nadja Peiffer (email available below). General contact details of provider: https://edirc.repec.org/data/isuclbe.html .

    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.