Paper: arXiv 2305.17285

Authors: Andrea Gabrielli, Valentina Macchiati, Diego Garlaschelli

Abstract

The structure of many financial networks is protected by privacy and has to be inferred from aggregate observables. Here we consider one of the most successful network reconstruction methods, producing random graphs with desired link density and where the observed constraints (related to the market size of each node) are replicated as averages over the graph ensemble, but not in individual realizations. We show that there is a minimum critical link density below which the method exhibits an `unreconstructability’ phase where at least one of the constraints, while still reproduced on average, is far from its expected value in typical individual realizations. We establish the scaling of the critical density for various theoretical and empirical distributions of interbank assets and liabilities, showing that the threshold differs from the critical densities for the onset of the giant component and of the unique component in the graph. We also find that, while dense networks are always reconstructable, sparse networks are unreconstructable if their structure is homogeneous, while they can display a crossover to reconstructability if they have an appropriate core-periphery or heterogeneous structure. Since the reconstructability of interbank networks is related to market clearing, our results suggest that central bank interventions aimed at lowering the density of links should take network structure into account to avoid unintentional liquidity crises where the supply and demand of all financial institutions cannot be matched simultaneously.

Complexity vs Empirical Score

  • Math Complexity: 7.5/10
  • Empirical Rigor: 3.0/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper involves heavy statistical mechanics, random graph theory, and scaling analysis, indicating high mathematical complexity. It relies primarily on theoretical modeling and empirical data for validation but lacks the backtest-ready implementation details typical of quantitative finance strategies.

Research Flowchart

  flowchart TD
  A["Research Goal:<br>Identify Critical Density for Network Reconstruction"] --> B["Methodology:<br>Analyze Reconstruction Method<br>using Graph Ensembles"]
  B --> C["Data/Inputs:<br>Interbank Asset/Liability Distributions<br>(Theoretical & Empirical)"]
  C --> D["Computational Process:<br>Simulate Networks &<br>Measure Constraint Deviations"]
  D --> E{"Outcome:"}
E --> F["Unreconstructable Phase<br>Sparse/Homogeneous Networks<br>High Constraint Deviation"]
  E --> G["Reconstructable Phase<br>Dense or Heterogeneous/Core-Periphery<br>Constraints Matched"]
  F & G --> H["Final Finding:<br>Network Structure Matters for<br>Liquidity Interventions"]

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 introduces the concept of reconstructability for financial network reconstruction and analyzes the critical link density threshold that separates reconstructable from unreconstructable regimes.

Source sentence
Here we consider one of the most successful network reconstruction methods, producing random graphs with desired link density and where the observed constraints (related to the market size of each node) are replicated as averages over the graph ensemble, but not in individual realizations. In this work we introduce the problem of reconstructability of the network under ensemble methods.

Assumes 6

  • The problem is framed within undirected networks, interpreting each link as the bilateral exposure. model
    Source sentence
    While these relationships are clearly directional, for simplicity in this paper we will frame the problem within the context of undirected networks, where we interpret each link as representing the bilateral exposure (the sum of the exposure in both directions) between two nodes.
  • Outgoing and incoming link weight sums (total interbank assets and liabilities) are observable and used as node strength constraints. data
    Source sentence
    Individual links are unobservable, while the sum of the outgoing link weights and the sum of the incoming link weights for each node are both observable, as they represent the total interbank assets and the total interbank liabilities that can be derived from the balance sheet of the corresponding institution.
  • Sparse network regime is defined by a link density scaling d(z) ≃ kN with finite k > 1. model
    Source sentence
    This implies that a choice for z could be z = zsparse where zsparse is such that d(zsparse) ≃k N , k > 1 (4) with k finite. Clearly, the value zsparse realizing the above condition depends on the entire strength sequence, and in general on the strength distribution when N →∞.
  • Empirical strengths are generated by i.i.d. sampling from a fixed probability density f(s) that does not depend on N. statistical
    Source sentence
    To calculate mini=1,N{s∗ i } as a function of N, we assume that the N values {s∗ i }N i=1 of the empirical strength are realized via sampling N times (in an i.i.d. manner) from some probability density function f(s). The same results can be derived more rigorously by analysing the large N convergence of the probability distribution of the random variable WSL (whose possible realized values will be denoted as wSL).
Show 2 more
  • Link weights are deterministic functions of the observable margins when a link is realized. model
    Source sentence
    In the simplest specifications of the model [7,15], the link weights are deterministic functions of the observable margins: if the link is realized, the random variable wij is assigned a value s∗ i s∗ j 2W ∗pij(z), otherwise it is given a zero value.
  • The strength distribution f(s) is assumed to be independent of network size N (sparse networks with 2W* = N). statistical
    Source sentence
    The same results can be derived more rigorously by analysing the large N convergence of the probability distribution of the random variable WSL (whose possible realized values will be denoted as wSL).

Data

  • Bankscope dataset · Bureau Van Dijk Bankscope fundamentals commercial
    2006-2013 · 119 anonymized European banks
    Source sentence
    Our dataset consists of a subset of N = 119 anonymized European banks that were publicly traded between 2006 and 2013 [21]. For each of the N banks and each year t in the data, we have access Critical density for network reconstruction 17 10 1 10 3 10 5 10 7 Total Assets 2007 (mil USD) 10 1 10 0 10 1 10 2 10 3 10 4 10 5 10 6 10 7 Interbank Assets 2007 (mil USD) 10 1 10 3 10 5 10 7 Total Assets 2007 (mil USD) 10 1 10

Costs

Not applicable The paper reports no trading or execution result.

Finds 5

  • There exists a minimum critical link density below which the reconstruction method enters an unreconstructability phase, where constraints are reproduced on average but not in typical individual realizations. theoretical
    Source sentence
    We show that there is a minimum critical link density below which the method exhibits an `unreconstructability' phase where at least one of the constraints, while still reproduced on average, is far from its expected value in typical individual realizations.
  • Dense networks are always reconstructable, whereas sparse homogeneous networks are always unreconstructable. theoretical
    Source sentence
    We also find that, while dense networks are always reconstructable, sparse networks are unreconstructable if their structure is homogeneous, while they can display a crossover to reconstructability if they have an appropriate core-periphery or heterogeneous structure.
  • Introducing heterogeneity via a core‑periphery structure can restore reconstructability in sparse networks. theoretical
    Source sentence
    3.2 Core-periphery structure We now consider a less trivial setting where we introduce some heterogeneity in the network in the form of a core-periphery structure, where nodes in the core have a larger strength and nodes in the periphery have a smaller strength. The presence of a core-periphery structure has been documented in real financial networks [17,18,19,20].
  • The scaling of the critical density differs from the thresholds for the emergence of a giant component or a unique component in the graph. theoretical
    Source sentence
    We establish the scaling of the critical density for various theoretical and empirical distributions of interbank assets and liabilities, showing that the threshold differs from the critical densities for the onset of the giant component and of the unique component in the graph.
  • Empirical analysis on the Bankscope data confirms the presence of two regimes (reconstructable and unreconstructable) depending on network size, strength distribution details, and the decay parameter β. other
    Source sentence
    Realistic situations typically fall into one of those two cases. The next Section provides an empirical example that confirms this picture.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 15 related papers). Coverage is partial, so this is neither replication nor refutation.

Cited by 3 papers in the archive (1 by independent authors): Evolution and determinants of firm-level systemic risk in … (uses its method or data)

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.