Paper: arXiv 2410.07222
Authors: Lukas Gonon, Thilo Meyer-Brandis, Niklas Weber
Abstract
This paper investigates systemic risk measures for stochastic financial networks of explicitly modelled bilateral liabilities. We extend the notion of systemic risk measures from Biagini, Fouque, Fritelli and Meyer-Brandis (2019) to graph structured data. In particular, we focus on an aggregation function that is derived from a market clearing algorithm proposed by Eisenberg and Noe (2001). In this setting, we show the existence of an optimal random allocation that distributes the overall minimal bailout capital and secures the network. We study numerical methods for the approximation of systemic risk and optimal random allocations. We propose to use permutation equivariant architectures of neural networks like graph neural networks (GNNs) and a class that we name (extended) permutation equivariant neural networks ((X)PENNs). We compare their performance to several benchmark allocations. The main feature of GNNs and (X)PENNs is that they are permutation equivariant with respect to the underlying graph data. In numerical experiments we find evidence that these permutation equivariant methods are superior to other approaches.
Complexity vs Empirical Score
- Math Complexity: 8.5/10
- Empirical Rigor: 6.0/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper utilizes advanced mathematical concepts including stochastic analysis, graph theory, convex optimization, and theoretical properties of neural networks (universal approximation, permutation equivariance), which drives the high math complexity score. While it includes a dedicated ‘Numerical Experiments’ section with empirical comparisons, the methodology is primarily algorithmic and relies on synthetic/idealized network simulations rather than real-market data pipelines, placing it in the high-math, high-rigour quadrant.
Research Flowchart
flowchart TD A["Research Goal:<br>Compute Systemic Risk<br>for Financial Networks"] --> B["Input Data:<br>Stochastic Bilateral Liabilities<br>& Graph Structure"] B --> C["Methodology:<br>Extend Systemic Risk Measures<br>using Graph Neural Networks"] C --> D["Core Process:<br>Eisenberg-Noe Market Clearing<br>with Permutation Equivariance"] D --> E["Optimization:<br>Find Minimal Bailout Capital<br>& Optimal Random Allocation"] E --> F["Comparison:<br>vs. Benchmark Allocations"] F --> G["Key Findings:<br>GNNs & (X)PENNs Outperform<br>Other Approaches"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes using permutation equivariant neural network architectures, specifically graph neural networks (GNNs) and extended permutation‑equivariant neural networks (X)PENNs, to approximate optimal random bailout allocations in stochastic financial networks.
Source sentence
We propose to use permutation equivariant architectures of neural networks like graph neural networks (GNNs) and a class that we name (extended) permutation equivariant neural networks ((X)PENNs). we characterise what we call permutation-equivariant node-labelling functions and, mo-tivated by this result, propose the neural network architecture of (X)PENNs.
Assumes 3
- Assumption 2.10 on the aggregation function, which includes properties such as concavity and boundedness, holds for the total payment shortfall based on the Eisenberg‑Noe clearing mechanism. model
Source sentence
For an overview of network reconstruction techniques see for example [4]. • Under certain conditions on the aggregation function (Assumption 2.10), which in particular include aggregation functions based on the contagion model of Eisenberg and Noe, such as the total payment shortfall, we show that the systemic risk measure is well-defined. Property (i) of Assumption 2.10 is trivially fulfilled by the total payment
- Mild regularity assumptions ensure the existence of a measurable target function Hc that yields an optimal allocation for any fixed bailout capital. statistical
Source sentence
We further derive a reformulation of the systemic risk measure that allows us to construct an iterative algorithm for its numerical approximation. • Under mild assumptions, we show that there exists a measurable target function Hc : RN × RN×N → RN such that Hc(A, L) is an optimal allocation of the fixed bailout capital c ∈R. Due to its measura-bility, this allows for approximation via neural networks. • Furthermore,
- The Eisenberg‑Noe market‑clearing mechanism is used as the basis for the aggregation functions considered. market
Source sentence
2.3 Eisenberg–Noe clearing mechanism Now, we present the market clearing mechanism from the seminal work of Eisenberg and Noe [28]. Even though our systemic risk measures are defined in terms of general aggregation functions, our main focus in this paper is on aggregation functions based on the Eisenberg–Noe clearing mechanism.
Data
- Synthetic cascade and star networks synthetic unknown
Source sentence
Each respective dataset contains realisations with N ∈{10, 20, 50, 100} nodes. Specifically, for every i ∈1, . . . , N, each dataset contains two distinct realisations of the network GN: One realisation is a default cascade.
Costs
Not applicable
Finds 5
- Existence of an optimal random allocation that distributes the minimal bailout capital and secures the network is established. theoretical
Source sentence
In this setting, we show the existence of an optimal random allocation that distributes the overall minimal bailout capital and secures the network. In particular, we show existence of “optimal” random bailout capital allocations and investigate their properties from a theoretical point of view.
- In numerical experiments, XPENN, PENN, and GNN outperform other benchmark models, with XPENN showing a slight advantage. performance
Source sentence
In the ER and CP networks, XPENN, PENN, and GNN are the best models, with XPENN maintaining a slight advantage compared to the others.
- Permutation‑equivariant benchmark models (Level‑1, Linear, Default) work but are less effective than the neural network approaches. performance
Source sentence
The permutation-equivariant benchmarks Level-1, Linear, and Default work, but cannot provide as effective capital allocations.
- FNN, FNN(L), Constant, and Uniform models do not yield satisfactory bailout allocation results. performance
Source sentence
FNN, FNN(L), Constant, and Uniform do not yield satisfactory results.
- For the CPf network, FNN and FNN(L) can be useful and even outperform GNN, while PENN, XPENN, and GNN remain strong performers. performance
Source sentence
In the CPf network, the results suggest again, that for a fixed interbank structure – besides PENN, XPENN, and GNN – the models FNN, FNN(L), and even Constant are useful, with FNN and FNN(L) even outperforming GNN.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 31 related papers). Coverage is partial, so this is neither replication nor refutation.
1 paper in the archive
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.