IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1412-1442.html
   My bibliography  Save this article

A Dynamic Contagion Risk Model with Recovery Features

Author

Listed:
  • Hamed Amini

    (Department of Risk Management and Insurance, Georgia State University, Atlanta, Georgia 30303)

  • Andreea Minca

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14850)

  • Agnès Sulem

    (Institut National de Recherche en Sciences et Technologies du Numérique Paris, 75589 Paris Cedex 12, France)

Abstract

We introduce threshold growth in the classical threshold contagion model, or equivalently a network of Cramér-Lundberg processes in which nodes have downward jumps when there is a failure of a neighboring node. Choosing the configuration model as underlying graph, we prove fluid limits for the baseline model, as well as extensions to the directed case, state-dependent interarrival times and the case of growth driven by upward jumps. We obtain explicit ruin probabilities for the nodes according to their characteristics: initial threshold and in- (and out-) degree. We then allow nodes to choose their connectivity by trading off link benefits and contagion risk. We define a rational equilibrium concept in which nodes choose their connectivity according to an expected failure probability of any given link and then impose condition that the expected failure probability coincides with the actual failure probability under the optimal connectivity. We show existence of an asymptotic equilibrium and convergence of the sequence of equilibria on the finite networks. In particular, our results show that systems with higher overall growth may have higher failure probability in equilibrium.

Suggested Citation

  • Hamed Amini & Andreea Minca & Agnès Sulem, 2022. "A Dynamic Contagion Risk Model with Recovery Features," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1412-1442, May.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1412-1442
    DOI: 10.1287/moor.2021.1174
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1174
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1174?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
    ---><---

    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:inm:ormoor:v:47:y:2022:i:2:p:1412-1442. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.