Clearing in Liability Networks via Sheaves on Directed Hypergraphs

arxiv: 2605.15778 · v1 · submitted 2026-05-15 · 💱 q-fin.MF · math.CT

Clearing in Liability Networks via Sheaves on Directed Hypergraphs

Robert Ghrist This is my paper

Pith reviewed 2026-05-19 17:58 UTC · model grok-4.3

classification 💱 q-fin.MF math.CT

keywords liability networkssheavesdirected hypergraphsclearing configurationsfinite limitsEisenberg-Noe modelfinancial mathematics

0 comments p. Extension

The pith

Liability clearing configurations are precisely the global sections of a sheaf on a directed hypergraph.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that clearing configurations in liability networks correspond exactly to the global sections of a liability sheaf defined on a directed hypergraph. Hyperedges in this graph separate the distribution of payments from the collection of receipts. These global sections are given by the equalizer of the identity and the clearing operator formed by composing collective distribution and aggregation maps. The construction is functorial with respect to finite-limit-preserving functors on the coefficient category, which induces isomorphisms on the clearing solutions and recovers models such as Eisenberg-Noe as special cases while organizing existence and computation results via lattice and continuity properties.

Core claim

Clearing configurations are precisely the global sections of this sheaf, and the global-section object is canonically the equalizer of the identity and a clearing operator Φ=A∘D factored into collective distribution D and aggregation A; an institution-edge duality identifies it equivalently with the equalizer of the dual operator D∘A on the edge side. This identifies liability clearing as a finite-limit construction in the ambient data category. The construction is functorial under change of coefficient category: a Clearing Invariance Theorem shows that a finite-limit-preserving functor compatible with constraint subobjects induces a canonical isomorphism on global-section objects, enabling

What carries the argument

liability sheaf on a directed hypergraph whose global sections are clearing configurations realized as the equalizer of the identity and the clearing operator Φ = A ∘ D

If this is right

Existence of clearing sections and a complete-lattice structure on them follow from Tarski's theorem when global elements form a complete lattice.
Scott continuity yields convergent Kleene iteration for computing clearing sections.
An acyclic underlying graph admits a unique clearing section computed in finitely many steps with no order or metric assumptions.
Banach's theorem on global elements yields uniqueness of the clearing section under metric contraction.
The Eisenberg-Noe model and lattice liability networks arise directly as special cases.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The functoriality result lets clearing outcomes be compared directly when switching between different models of payment data without re-computing solutions.
The hypergraph-plus-sheaf representation may extend to time-dependent or multi-period liability networks by varying the base space.
Categorical tools for computing equalizers or limits could supply new algorithms for large-scale clearing problems in practice.

Load-bearing premise

That a decorated liability network can be represented as a directed hypergraph whose hyperedges separate payment distribution from receipt collection, and that the coefficient category admits finite limits together with constraint subobjects compatible with a finite-limit-preserving functor.

What would settle it

An explicit liability network whose clearing configurations do not equal the global sections of the associated sheaf or violate the equalizer property with respect to the clearing operator.

read the original abstract

We associate to a decorated liability network a liability sheaf on a directed hypergraph whose hyperedges separate the distribution of payments from the collection of receipts. Clearing configurations are precisely the global sections of this sheaf, and the global-section object is canonically the equalizer of the identity and a clearing operator $\Phi=A\circ D$ factored into collective distribution $D$ and aggregation $A$; an institution-edge duality identifies it equivalently with the equalizer of the dual operator $D\circ A$ on the edge side. This identifies liability clearing as a finite-limit construction in the ambient data category. The construction is functorial under change of coefficient category: a Clearing Invariance Theorem shows that a finite-limit-preserving functor compatible with constraint subobjects induces a canonical isomorphism on global-section objects, enabling uniform comparison of clearing problems across categories of payment data. Existence, uniqueness, and iterative computation of clearing sections are organized by the structure carried on payment objects: Tarski's theorem yields existence and a complete-lattice structure under complete-lattice global elements; Scott continuity refines this to convergent Kleene iteration; an acyclic underlying graph admits a unique clearing section in finitely many steps with no order or metric hypothesis; and Banach's theorem on global elements yields uniqueness under metric contraction. The Eisenberg--Noe model and lattice liability networks arise as special cases.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Liability clearing gets framed as sheaf global sections with a functorial invariance theorem, but the constraint subobject compatibility needs explicit checks to back the uniform comparison claim.

read the letter

Bob, the core move here is to decorate a liability network as a directed hypergraph, build a liability sheaf on it, and identify clearing configurations with the global sections. Those sections are the equalizer of the identity and the operator Φ = A ∘ D, where D handles collective distribution and A does aggregation; the dual version on the edge side gives the same object. This turns clearing into a finite-limit construction in the coefficient category, and the paper adds a Clearing Invariance Theorem saying that finite-limit-preserving functors compatible with the constraint subobjects induce isomorphisms on the global-section objects. Special cases recover Eisenberg-Noe and lattice liability networks, while Tarski, Kleene iteration, Banach contraction, and acyclic-graph arguments organize existence, uniqueness, and computation. The construction is direct from the network data, so it avoids obvious circularity. The hyperedge separation of distribution from collection is a clean modeling choice that makes the sheaf axioms work without extra machinery. The duality between institutions and edges is a useful symmetry that the earlier models did not emphasize. The overall organization around standard theorems is efficient and gives a uniform language for different payment-data categories. The soft spot is exactly the one the stress-test note flags. The invariance result rests on constraint subobjects (non-negativity, bounds) being preserved by the functors that change coefficients. The abstract asserts compatibility, but without explicit verification for the usual target categories, such as mapping real-valued payments to lattice-valued ones, the isomorphism on clearing objects could fail in practice. If the full paper supplies concrete checks or counter-examples ruled out, that gap closes; otherwise the uniform comparison across data categories is weaker than stated. This is not a load-bearing contradiction, just a place where more detail would strengthen the main theorem. The paper is for people already comfortable with sheaves and limits who want to see them applied to payment networks, or for finance modelers looking for a single framework that covers several existing ones. A reader interested in categorical methods for economic networks will find the setup useful even if they do not adopt the full language. It shows clear engagement with the fixed-point literature and the prior clearing models. I would send it to peer review. The novelty in the sheaf construction and the invariance statement is real, and the work is organized enough that referees can give targeted feedback on the functor details and examples.

Referee Report

2 major / 2 minor

Summary. The manuscript associates to a decorated liability network a liability sheaf on a directed hypergraph whose hyperedges separate payment distribution from receipt collection. Clearing configurations are identified with the global sections of this sheaf, which are canonically the equalizer of the identity and the clearing operator Φ = A ∘ D (factored into collective distribution D and aggregation A), with an institution-edge duality giving an equivalent equalizer for the dual operator D ∘ A. A Clearing Invariance Theorem asserts that finite-limit-preserving functors compatible with constraint subobjects induce canonical isomorphisms on global-section objects. Existence, uniqueness, and iterative computation follow from Tarski, Kleene, and Banach theorems on the payment objects, with the Eisenberg–Noe model and lattice liability networks recovered as special cases.

Significance. If the sheaf axioms, equalizer characterizations, and functor compatibility are verified, the work supplies a finite-limit description of clearing that unifies existing models and enables uniform comparison across coefficient categories (real-valued, lattice-valued, metric). The explicit recovery of the Eisenberg–Noe model and the organization of existence/uniqueness results via standard theorems constitute concrete strengths.

major comments (2)

[Abstract / Clearing Invariance Theorem] Abstract and the statement of the Clearing Invariance Theorem: the claim that a finite-limit-preserving functor compatible with constraint subobjects induces a canonical isomorphism on global-section objects is load-bearing for the functoriality result, yet the manuscript supplies no explicit verification that the subobjects encoding non-negativity and payment bounds are preserved (or mapped to the corresponding subobjects) under the functors that would change coefficients, e.g., from real-valued to lattice-valued payments. Without this, the invariance theorem does not deliver the asserted uniform comparison.
[Sheaf construction and coefficient category] The weakest assumption noted in the construction—that a decorated liability network can be represented as a directed hypergraph whose hyperedges separate distribution from collection, and that the coefficient category admits finite limits together with compatible constraint subobjects—requires a concrete check that the chosen subobjects remain subobjects after application of any finite-limit-preserving functor; failure here would invalidate the induced isomorphism on global sections.

minor comments (2)

[Notation and examples] A small worked example of a liability network, its directed hypergraph, the resulting sheaf, and the explicit equalizer computation would clarify the separation of D and A and the global-section identification.
[Existence and uniqueness results] Ensure that all invocations of Tarski’s theorem, Kleene iteration, and Banach’s fixed-point theorem are accompanied by precise statements of the hypotheses that are verified for the payment objects in each case.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments, which help clarify the presentation of the Clearing Invariance Theorem and the underlying assumptions in the sheaf construction. We address each major comment point by point below.

read point-by-point responses

Referee: [Abstract / Clearing Invariance Theorem] Abstract and the statement of the Clearing Invariance Theorem: the claim that a finite-limit-preserving functor compatible with constraint subobjects induces a canonical isomorphism on global-section objects is load-bearing for the functoriality result, yet the manuscript supplies no explicit verification that the subobjects encoding non-negativity and payment bounds are preserved (or mapped to the corresponding subobjects) under the functors that would change coefficients, e.g., from real-valued to lattice-valued payments. Without this, the invariance theorem does not deliver the asserted uniform comparison.

Authors: We agree that the manuscript would benefit from an explicit verification of subobject preservation to fully support the functoriality claim. In the revised version we add a dedicated paragraph (immediately following the statement of the Clearing Invariance Theorem) that checks the images of the non-negativity and payment-bound subobjects under the relevant finite-limit-preserving functors, including the change-of-coefficients functor from real-valued to lattice-valued payments. This verification confirms that the compatibility condition holds and that the induced map on global sections remains an isomorphism. revision: yes
Referee: [Sheaf construction and coefficient category] The weakest assumption noted in the construction—that a decorated liability network can be represented as a directed hypergraph whose hyperedges separate distribution from collection, and that the coefficient category admits finite limits together with compatible constraint subobjects—requires a concrete check that the subobjects remain subobjects after application of any finite-limit-preserving functor; failure here would invalidate the induced isomorphism on global sections.

Authors: The referee is correct that the construction presupposes the stability of the constraint subobjects under finite-limit-preserving functors. We have inserted an explicit lemma in the revised manuscript that verifies this stability for the chosen subobjects (non-negativity and payment bounds) in any coefficient category satisfying the stated hypotheses. The lemma shows that the subobjects are preserved, thereby ensuring the induced isomorphism on global sections is well-defined. revision: yes

Circularity Check

0 steps flagged

No circularity: liability clearing constructed as sheaf equalizer from network data and standard category theory

full rationale

The paper defines a liability sheaf on a directed hypergraph directly from the decorated network, with hyperedges separating distribution D and aggregation A. Clearing configurations are then identified as the global sections, canonically the equalizer of id and Φ = A ∘ D (and dually D ∘ A). This is a definitional modeling step using finite-limit constructions in the coefficient category, not a reduction of any output to fitted inputs or self-referential quantities. No load-bearing self-citations, uniqueness theorems imported from the authors' prior work, or ansatzes smuggled via citation appear in the derivation chain. Special cases such as the Eisenberg-Noe model arise by restriction of the general construction rather than being presupposed. The Clearing Invariance Theorem follows from functoriality of the equalizer under finite-limit-preserving functors compatible with constraint subobjects, which is verified within the ambient category theory rather than by circular appeal to the target result. The overall derivation is self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 2 invented entities

The paper introduces new structures (liability sheaf, clearing operator) that rest on standard category-theoretic assumptions rather than empirical fitting or prior fitted constants.

axioms (1)

domain assumption The ambient data category has finite limits and constraint subobjects compatible with finite-limit-preserving functors.
Invoked for the finite-limit construction of global sections and the Clearing Invariance Theorem.

invented entities (2)

liability sheaf no independent evidence
purpose: To encode consistency conditions for clearing configurations on the hypergraph.
Newly defined to associate the decorated liability network with global sections.
clearing operator Φ = A ∘ D no independent evidence
purpose: To characterize clearing configurations as equalizers or fixed points.
Constructed from the distribution map D and aggregation map A.

pith-pipeline@v0.9.0 · 5757 in / 1492 out tokens · 62963 ms · 2026-05-19T17:58:04.227533+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

33 extracted references · 33 canonical work pages · 1 internal anchor

[1]

2, 564–608

Daron Acemoglu, Asuman Ozdaglar, and Alireza Tahbaz-Salehi,Systemic risk and stability in financial networks, American Economic Review105(2015), no. 2, 564–608

work page 2015
[2]

4, 625–636

Kartik Anand, Ben Craig, and Goetz von Peter,Filling in the blanks: Network structure and interbank contagion, Quantitative Finance15(2015), no. 4, 625–636

work page 2015
[3]

Anton Ayzenberg, Thomas Gebhart, German Magai, and Grigory Solomadin,Sheaf theory: From deep geometry to deep learning, 2025, arXiv:2502.15476

work page arXiv 2025
[4]

Tathagata Banerjee, Alex Bernstein, and Zachary Feinstein,Dynamic clearing and contagion in finan- cial networks, EuropeanJournalofOperationalResearch321(2025), no.2, 664–675, arXiv:1801.02091

work page arXiv 2025
[5]

4, 617–636

Tathagata Banerjee and Zachary Feinstein,Impact of contingent payments on systemic risk in financial networks, Mathematics and Financial Economics13(2019), no. 4, 617–636

work page 2019
[6]

2, 1387–1409, arXiv:2005.09066

Shane Barratt and Stephen Boyd,Multi-period liability clearing via convex optimal control, Optimiza- tion and Engineering24(2022), no. 2, 1387–1409, arXiv:2005.09066

work page arXiv 2022
[7]

364, Schloss Dagstuhl, 2026, pp

Leander Besting, Martin Hoefer, and Lars Huth,Computing Tarski fixed points in financial networks, 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026), LIPIcs, vol. 364, Schloss Dagstuhl, 2026, pp. 14:1–14:18

work page 2026
[8]

Alain Bretto,Hypergraph Theory: an Introduction, Mathematical Engineering, Springer, 2013

work page 2013
[9]

Calafiore, Giulia Fracastoro, and Anton V

Giuseppe C. Calafiore, Giulia Fracastoro, and Anton V. Proskurnikov,Clearing payments in dynamic financial networks, Automatica158(2023), 111299

work page 2023
[10]

2, 473–502, arXiv:2103.10872

,Optimal clearing payments in a financial contagion model, SIAM Journal on Financial Math- ematics15(2024), no. 2, 473–502, arXiv:2103.10872

work page arXiv 2024
[11]

Agostino Capponi and Peng-Chu Chen,Systemic risk mitigation in financial networks, Journal of Economic Dynamics and Control58(2015), 152–166

work page 2015
[12]

Jean-Jacques Herings,Uniqueness of clearing payment matrices in financial net- works, Mathematics of Operations Research49(2024), no

Péter Csóka and P. Jean-Jacques Herings,Uniqueness of clearing payment matrices in financial net- works, Mathematics of Operations Research49(2024), no. 1, 232–250

work page 2024
[13]

Sheaves, Cosheaves and Applications

Justin Curry,Sheaves, Cosheaves and Applications, Ph.D. thesis, University of Pennsylvania, 2014, arXiv:1303.3255. 28 ROBERT GHRIST

work page internal anchor Pith review Pith/arXiv arXiv 2014
[14]

B. A. Davey and H. A. Priestley,Introduction to lattices and order, 2 ed., Cambridge University Press, 2002

work page 2002
[15]

36, Curran Associates, Inc., 2023, arXiv:2309.17116, pp

Iulia Duta, Giulia Cassarà, Fabrizio Silvestri, and Pietro Liò,Sheaf hypergraph networks, Advances in Neural Information Processing Systems, vol. 36, Curran Associates, Inc., 2023, arXiv:2309.17116, pp. 12087–12099

work page arXiv 2023
[16]

Noe,Systemic risk in financial systems, Management Science47 (2001), no

Larry Eisenberg and Thomas H. Noe,Systemic risk in financial systems, Management Science47 (2001), no. 2, 236–249

work page 2001
[17]

Jackson,Financial networks and contagion, Amer- ican Economic Review104(2014), no

Matthew Elliott, Benjamin Golub, and Matthew O. Jackson,Financial networks and contagion, Amer- ican Economic Review104(2014), no. 10, 3115–3153

work page 2014
[18]

Helmut Elsinger,Financial networks, cross holdings, and limited liability, Working Paper 156, Oester- reichische Nationalbank, 2009

work page 2009
[19]

4, 877–906

Zachary Feinstein,Obligations with physical delivery in a multilayered financial network, SIAM Journal on Financial Mathematics10(2019), no. 4, 877–906

work page 2019
[20]

5, 453–470

Prasanna Gai, Andrew Haldane, and Sujit Kapadia,Complexity, concentration and contagion, Journal of Monetary Economics58(2011), no. 5, 453–470

work page 2011
[21]

Axel Gandy and Luitgard A. M. Veraart,A Bayesian methodology for systemic risk assessment in financial networks, Management Science63(2017), no. 12, 4428–4446

work page 2017
[22]

Robert Ghrist, Julian Gould, Miguel Lopez, and Hans Riess,Clearing sections of lattice liability net- works, 2025, arXiv:2503.17836

work page arXiv 2025
[23]

Peyton Young,How likely is contagion in financial networks?, Journal of Banking & Finance50(2015), 383–399

Paul Glasserman and H. Peyton Young,How likely is contagion in financial networks?, Journal of Banking & Finance50(2015), 383–399

work page 2015
[24]

Jakob Hansen and Robert Ghrist,Toward a spectral theory of cellular sheaves, Journal of Applied and Computational Topology3(2019), 315–358

work page 2019
[25]

5, 2033–2060

,Opinion dynamics on discourse sheaves, SIAM Journal on Applied Mathematics81(2021), no. 5, 2033–2060

work page 2021
[26]

Michael Kusnetsov and Luitgard A. M. Veraart,Interbank clearing in financial networks with multiple maturities, SIAM Journal on Financial Mathematics10(2019), no. 1, 37–67

work page 2019
[27]

143, Cam- bridge University Press, 2014

Tom Leinster,Basic Category Theory, Cambridge Studies in Advanced Mathematics, vol. 143, Cam- bridge University Press, 2014

work page 2014
[28]

5, Springer, 1998

Saunders Mac Lane,Categories for the Working Mathematician, 2 ed., Graduate Texts in Mathematics, vol. 5, Springer, 1998

work page 1998
[29]

Emanuele Mule, Stefano Fiorini, Antonio Purificato, Federico Siciliano, Stefano Coniglio, and Fabrizio Silvestri,Directional sheaf hypergraph networks: Unifying learning on directed and undirected hyper- graphs, International Conference on Learning Representations, 2026, ICLR 2026; arXiv:2510.04727

work page arXiv 2026
[30]

L. C. G. Rogers and Luitgard A. M. Veraart,Failure and rescue in an interbank network, Management Science59(2013), no. 4, 882–898

work page 2013
[31]

67, Schloss Dagstuhl, 2017, pp

Steffen Schuldenzucker, Sven Seuken, and Stefano Battiston,Finding clearing payments in financial networks with credit default swaps is PPAD-complete, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), LIPIcs, vol. 67, Schloss Dagstuhl, 2017, pp. 32:1–32:20

work page 2017
[32]

Harrington, and Vidit Nanda,Quiver Laplacians and feature selection, 2024, arXiv:2404.06993

Otto Sumray, Heather A. Harrington, and Vidit Nanda,Quiver Laplacians and feature selection, 2024, arXiv:2404.06993

work page arXiv 2024
[33]

2, 285–309

Alfred Tarski,A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics 5(1955), no. 2, 285–309. Department of Mathematics and Electrical & Systems Engineering, University of Penn- syl v ania, Philadelphia, PA

work page 1955

[1] [1]

2, 564–608

Daron Acemoglu, Asuman Ozdaglar, and Alireza Tahbaz-Salehi,Systemic risk and stability in financial networks, American Economic Review105(2015), no. 2, 564–608

work page 2015

[2] [2]

4, 625–636

Kartik Anand, Ben Craig, and Goetz von Peter,Filling in the blanks: Network structure and interbank contagion, Quantitative Finance15(2015), no. 4, 625–636

work page 2015

[3] [3]

Anton Ayzenberg, Thomas Gebhart, German Magai, and Grigory Solomadin,Sheaf theory: From deep geometry to deep learning, 2025, arXiv:2502.15476

work page arXiv 2025

[4] [4]

Tathagata Banerjee, Alex Bernstein, and Zachary Feinstein,Dynamic clearing and contagion in finan- cial networks, EuropeanJournalofOperationalResearch321(2025), no.2, 664–675, arXiv:1801.02091

work page arXiv 2025

[5] [5]

4, 617–636

Tathagata Banerjee and Zachary Feinstein,Impact of contingent payments on systemic risk in financial networks, Mathematics and Financial Economics13(2019), no. 4, 617–636

work page 2019

[6] [6]

2, 1387–1409, arXiv:2005.09066

Shane Barratt and Stephen Boyd,Multi-period liability clearing via convex optimal control, Optimiza- tion and Engineering24(2022), no. 2, 1387–1409, arXiv:2005.09066

work page arXiv 2022

[7] [7]

364, Schloss Dagstuhl, 2026, pp

Leander Besting, Martin Hoefer, and Lars Huth,Computing Tarski fixed points in financial networks, 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026), LIPIcs, vol. 364, Schloss Dagstuhl, 2026, pp. 14:1–14:18

work page 2026

[8] [8]

Alain Bretto,Hypergraph Theory: an Introduction, Mathematical Engineering, Springer, 2013

work page 2013

[9] [9]

Calafiore, Giulia Fracastoro, and Anton V

Giuseppe C. Calafiore, Giulia Fracastoro, and Anton V. Proskurnikov,Clearing payments in dynamic financial networks, Automatica158(2023), 111299

work page 2023

[10] [10]

2, 473–502, arXiv:2103.10872

,Optimal clearing payments in a financial contagion model, SIAM Journal on Financial Math- ematics15(2024), no. 2, 473–502, arXiv:2103.10872

work page arXiv 2024

[11] [11]

Agostino Capponi and Peng-Chu Chen,Systemic risk mitigation in financial networks, Journal of Economic Dynamics and Control58(2015), 152–166

work page 2015

[12] [12]

Jean-Jacques Herings,Uniqueness of clearing payment matrices in financial net- works, Mathematics of Operations Research49(2024), no

Péter Csóka and P. Jean-Jacques Herings,Uniqueness of clearing payment matrices in financial net- works, Mathematics of Operations Research49(2024), no. 1, 232–250

work page 2024

[13] [13]

Sheaves, Cosheaves and Applications

Justin Curry,Sheaves, Cosheaves and Applications, Ph.D. thesis, University of Pennsylvania, 2014, arXiv:1303.3255. 28 ROBERT GHRIST

work page internal anchor Pith review Pith/arXiv arXiv 2014

[14] [14]

B. A. Davey and H. A. Priestley,Introduction to lattices and order, 2 ed., Cambridge University Press, 2002

work page 2002

[15] [15]

36, Curran Associates, Inc., 2023, arXiv:2309.17116, pp

Iulia Duta, Giulia Cassarà, Fabrizio Silvestri, and Pietro Liò,Sheaf hypergraph networks, Advances in Neural Information Processing Systems, vol. 36, Curran Associates, Inc., 2023, arXiv:2309.17116, pp. 12087–12099

work page arXiv 2023

[16] [16]

Noe,Systemic risk in financial systems, Management Science47 (2001), no

Larry Eisenberg and Thomas H. Noe,Systemic risk in financial systems, Management Science47 (2001), no. 2, 236–249

work page 2001

[17] [17]

Jackson,Financial networks and contagion, Amer- ican Economic Review104(2014), no

Matthew Elliott, Benjamin Golub, and Matthew O. Jackson,Financial networks and contagion, Amer- ican Economic Review104(2014), no. 10, 3115–3153

work page 2014

[18] [18]

Helmut Elsinger,Financial networks, cross holdings, and limited liability, Working Paper 156, Oester- reichische Nationalbank, 2009

work page 2009

[19] [19]

4, 877–906

Zachary Feinstein,Obligations with physical delivery in a multilayered financial network, SIAM Journal on Financial Mathematics10(2019), no. 4, 877–906

work page 2019

[20] [20]

5, 453–470

Prasanna Gai, Andrew Haldane, and Sujit Kapadia,Complexity, concentration and contagion, Journal of Monetary Economics58(2011), no. 5, 453–470

work page 2011

[21] [21]

Axel Gandy and Luitgard A. M. Veraart,A Bayesian methodology for systemic risk assessment in financial networks, Management Science63(2017), no. 12, 4428–4446

work page 2017

[22] [22]

Robert Ghrist, Julian Gould, Miguel Lopez, and Hans Riess,Clearing sections of lattice liability net- works, 2025, arXiv:2503.17836

work page arXiv 2025

[23] [23]

Peyton Young,How likely is contagion in financial networks?, Journal of Banking & Finance50(2015), 383–399

Paul Glasserman and H. Peyton Young,How likely is contagion in financial networks?, Journal of Banking & Finance50(2015), 383–399

work page 2015

[24] [24]

Jakob Hansen and Robert Ghrist,Toward a spectral theory of cellular sheaves, Journal of Applied and Computational Topology3(2019), 315–358

work page 2019

[25] [25]

5, 2033–2060

,Opinion dynamics on discourse sheaves, SIAM Journal on Applied Mathematics81(2021), no. 5, 2033–2060

work page 2021

[26] [26]

Michael Kusnetsov and Luitgard A. M. Veraart,Interbank clearing in financial networks with multiple maturities, SIAM Journal on Financial Mathematics10(2019), no. 1, 37–67

work page 2019

[27] [27]

143, Cam- bridge University Press, 2014

Tom Leinster,Basic Category Theory, Cambridge Studies in Advanced Mathematics, vol. 143, Cam- bridge University Press, 2014

work page 2014

[28] [28]

5, Springer, 1998

Saunders Mac Lane,Categories for the Working Mathematician, 2 ed., Graduate Texts in Mathematics, vol. 5, Springer, 1998

work page 1998

[29] [29]

Emanuele Mule, Stefano Fiorini, Antonio Purificato, Federico Siciliano, Stefano Coniglio, and Fabrizio Silvestri,Directional sheaf hypergraph networks: Unifying learning on directed and undirected hyper- graphs, International Conference on Learning Representations, 2026, ICLR 2026; arXiv:2510.04727

work page arXiv 2026

[30] [30]

L. C. G. Rogers and Luitgard A. M. Veraart,Failure and rescue in an interbank network, Management Science59(2013), no. 4, 882–898

work page 2013

[31] [31]

67, Schloss Dagstuhl, 2017, pp

Steffen Schuldenzucker, Sven Seuken, and Stefano Battiston,Finding clearing payments in financial networks with credit default swaps is PPAD-complete, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), LIPIcs, vol. 67, Schloss Dagstuhl, 2017, pp. 32:1–32:20

work page 2017

[32] [32]

Harrington, and Vidit Nanda,Quiver Laplacians and feature selection, 2024, arXiv:2404.06993

Otto Sumray, Heather A. Harrington, and Vidit Nanda,Quiver Laplacians and feature selection, 2024, arXiv:2404.06993

work page arXiv 2024

[33] [33]

2, 285–309

Alfred Tarski,A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics 5(1955), no. 2, 285–309. Department of Mathematics and Electrical & Systems Engineering, University of Penn- syl v ania, Philadelphia, PA

work page 1955