When banks borrow from and lend to each other, a default by one can cascade through the interbank network. Eisenberg & Noe (2001) formulated this as a fixed-point problem: find a clearing vector $p^* = (p_1^*, \ldots, p_n^*)$ where each bank pays its obligations pro-rata up to its available resources. The mapping is monotone, so a unique greatest clearing vector exists and can be computed by iteration. This is the foundational model of financial-network contagion, the framework behind Basel’s SIFI assessments and regulatory stress-testing.
A network of $n$ financial institutions. Bank $i$ has:
A clearing payment vector $p^* \in [0, \bar{p}]$ satisfies: every bank pays pro-rata with what it has (own assets plus payments received from others), up to its total liabilities:
Eisenberg & Noe proved the operator $\Phi(p)_i = \min\{\bar{p}_i, e_i + \sum_j \pi_{ji} p_j\}$ is monotone non-decreasing and maps $[0, \bar{p}]$ into itself, so by Tarski’s fixed-point theorem there is a greatest clearing vector. The algorithm fictitious default computes it in $O(n^3)$:
p ← p-bar
repeat:
solve linear system assuming default set D, clear to obtain p
D' ← {i : p_i < p-bar_i}
if D' == D: return p
else: D ← D'
Equivalently, the clearing vector solves the LP:
The number of defaults $|\{i : p_i^* < \bar{p}_i\}|$ is the primary contagion statistic. Shortfall $\sum_i (\bar{p}_i - p_i^*)$ captures aggregate loss. Glasserman-Young (2015) show that amplification from network linkages is often modest relative to direct losses, which pushed the regulatory literature toward fire-sale and liquidity-based contagion channels.
Circular layout. Green nodes = solvent, red = defaulted. Edge thickness = exposure. Click-and-change the shock slider to watch contagion propagate. Bank labels show recovery $p_i^*/\bar p_i$.