IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.04529.html

Low-rank and graphon limits for dynamic threshold distress contagion in heterogeneous financial networks

Author

Listed:
  • Pengbin Feng

Abstract

We study a recoverable dynamic distress model for financial institutions connected by a weighted directed exposure network. Counterparty distress affects losses through cumulative occupation time, so institutions may subsequently recover. A \(K\)-factor representation of exposures, interpreted as a small number of dominant transmission channels, reduces the \(N\)-institution system exactly to \(K\) macroscopic feedback coordinates. For bounded Lipschitz losses, we prove Wasserstein stability of the reduced dynamics and aligned \(L^1\) stability of the corresponding directed-kernel equation, obtaining quantitative error bounds that separate finite-population and kernel-approximation effects. We then address the economically natural hard-threshold rule, whose discontinuity creates solution-selection and stability problems. For every bounded nonnegative directed kernel, we construct a canonical greatest cumulative-distress solution and show that it is selected by vanishing positive-side regularization. An Osgood condition controlling the mass near the distress threshold along a reference solution yields uniqueness, one-sided stability, finite-network and low-rank approximation guarantees, and convergence under sampled latent labels. Nonnegative rank-one examples show that this condition is sharp for uniqueness among criteria based only on threshold-layer mass. Numerical experiments illustrate the reduction and selection mechanisms. Using public data from the 2025 EBA transparency exercise, we construct sovereign-exposure factors and evaluate the associated sensitivity bounds.

Suggested Citation

  • Pengbin Feng, 2026. "Low-rank and graphon limits for dynamic threshold distress contagion in heterogeneous financial networks," Papers 2608.04529, arXiv.org, revised Aug 2026.
  • Handle: RePEc:arx:papers:2608.04529
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.04529
    File Function: Latest version
    Download Restriction: no
    ---><---

    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:arx:papers:2608.04529. 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    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.