The construction and properties of assortative configuration graphs

DOI10.1007/978-1-4939-6969-2_11zbMATH Open1409.91262arXiv1512.03084OpenAlexW2289860860MaRDI QIDQ4604872FDOQ4604872

Authors: T. R. Hurd 

Publication date: 6 March 2018

Published in: Recent Progress and Modern Challenges in Applied Mathematics, Modeling and Computational Science (Search for Journal in Brave)

Abstract: In the new field of financial systemic risk, the network of interbank counterparty relationships can be described as a directed random graph. In "cascade models" of systemic risk, this "skeleton" acts as the medium through which financial contagion is propagated. It has been observed in real networks that such counterparty relationships exhibit negative assortativity, meaning that a bank's counterparties are more likely to have unlike characteristics. This paper introduces and studies a general class of random graphs called the assortative configuration model, parameterized by an arbitrary node-type distribution P and edge-type distribution Q. The first main result is a law of large numbers that says the empirical edge-type distributions converge in probability to Q. The second main result is a formula for the large N asymptotic probability distribution of general graphical objects called "configurations". This formula exhibits a key property called "locally tree-like" that in simpler models is known to imply strong results of percolation theory on the size of large connected clusters. Thus this paper provides the essential foundations needed to prove rigorous percolation bounds and cascade mappings in assortative networks.

Full work available at URL: https://arxiv.org/abs/1512.03084

Recommendations

• Resilience to contagion in financial networks
• Inhomogeneous financial networks and contagious links
• Financial contagion in a stochastic block model
• Systemic risk through contagion in a core-periphery structured banking network
• Construction of directed assortative configuration graphs

zbMATH Keywords

skeletonsystemic riskLaplace methodassortativityconfiguration graphpercolation theorybanking networklocally tree-likelarge graph asymptoticsrandom graph simulation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Credit risk (91G40) Financial applications of other theories (91G80)

Cites Work

• Title not available (Why is that?)
• A critical point for random graphs with a given degree sequence
• Title not available (Why is that?)
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Random graphs.
• The probability that a random multigraph is simple
• Directed random graphs with given degree distributions
• Contagion! Systemic risk in financial networks
• Double cascade model of financial crises
• Construction of directed assortative configuration graphs

Cited In (3)

• Construction of directed assortative configuration graphs
• Generating maximally disassortative graphs with given degree distribution
• Brief synopsis of the scientific career of T. R. Hurd

This page was built for publication: The construction and properties of assortative configuration graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604872)