Financial Contagion in a Generalized Stochastic Block Model
Nils Detering, Thilo Meyer-Brandis, Konstantinos Panagiotou, Daniel, Ritter

TL;DR
This paper introduces a generalized stochastic block model for financial networks, enabling explicit calculation of systemic risk and resilience, accounting for complex block structures and shock distributions, advancing beyond previous rank one models.
Contribution
It develops a comprehensive model incorporating block structures and type-dependent parameters, providing explicit formulas for systemic damage and resilience analysis in financial networks.
Findings
Explicit systemic damage calculation from initial shocks.
Complete characterization of resilient vs. non-resilient systems.
Resilience conditions based on subnetwork analysis.
Abstract
One of the most defining features of the global financial network is its inherent complex and intertwined structure. From the perspective of systemic risk it is important to understand the influence of this network structure on default contagion. Using sparse random graphs to model the financial network, asymptotic methods turned out powerful to analytically describe the contagion process and to make statements about resilience. So far, however, they have been limited to so-called {\em rank one} models in which informally the only network parameter is the degree sequence (see (Amini et. al. 2016) and (Detering et. al. 2019) for example) and the contagion process can be described by a one dimensional fix-point equation. These networks fail to account for a pronounced block structure such as core/periphery or a network composed of different connected blocks for different countries. We…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Complex Systems and Time Series Analysis · Banking stability, regulation, efficiency
Financial Contagion in a Generalized Stochastic Block Model
Nils Detering, Thilo Meyer-Brandis, Konstantinos Panagiotou22footnotemark: 2, Daniel Ritter22footnotemark: 2 Department of Statistics and Applied Probability, University of California, Santa Barbara, CA 93106, USA. Email: [email protected] of Mathematics, University of Munich, Theresienstraße 39, 80333 Munich, Germany. Emails: [email protected], [email protected] and [email protected]
Abstract
One of the most defining features of the global financial network is its inherent complex and intertwined structure. From the perspective of systemic risk it is important to understand the influence of this network structure on default contagion. Using sparse random graphs to model the financial network, asymptotic methods turned out powerful to analytically describe the contagion process and to make statements about resilience. So far, however, they have been limited to so-called rank one models in which informally the only network parameter is the degree sequence (see [3, 20] for example) and the contagion process can be described by a one dimensional fix-point equation. These networks fail to account for a pronounced block structure such as core/periphery or a network composed of different connected blocks for different countries. We present a much more general model here, where we distinguish vertices (institutions) of different types and let edge probabilities and exposures depend on the types of both, the receiving and the sending vertex plus additional parameters. Our main result allows to compute explicitly the systemic damage caused by some initial local shock event, and we derive a complete characterisation of resilient respectively non-resilient financial systems. This is the first instance that default contagion is rigorously studied in a model outside the class of rank one models and several technical challenges arise. Moreover, in contrast to previous work, in which networks could be classified as resilient or non resilient, independent of the distribution of the shock, information about the shock becomes important in our model and a more refined resilience condition arises. Among other applications of our theory we derive resilience conditions for the global network based on subnetwork conditions only.
Keywords: systemic risk, financial contagion, inhomogeneous random graphs, weighted random graphs, directed random graphs, stochastic block model, core-periphery, assortative random graphs, counterparty dependent exposures
1 Introduction
Modern financial networks of counterparty exposures are characterized by a huge intrinsic complexity. One example for this are cross-border relations that have emerged over the last decades in the course of globalization [11, 17, 27, 35]. While the possibility of making business on an international level certainly provides benefits to single institutions by facilitating diversification and giving access to different markets [1, 4, 32, 5, 18, 21], the convoluted trans-border dependencies can also pose a great threat to the global system and increase systemic risk. The financial crisis in the years 2007/08 is a striking example of how an initially locally confined shock – the burst of the US housing bubble – had a catastrophic impact on the economy worldwide. In addition to cross-border exposures connecting various subsystems, modern financial networks also exhibit a distinctive tiered structure – usually referred to as core-periphery structure – that can arise in many different shapes; see [8] for Austria, [14] for Brazil, [16] for Germany, [23] for Italy, [31] for the Netherlands, [34] for the UK, and [2] for the European interbank network. It is an important research question to model and understand how these complex network configurations influence the stability of financial systems.
One important direct channel of systemic risk that we focus on here is default contagion. Instead of considering a concrete system configuration, we use a random graph setting to generate a whole ensemble of possible financial networks and it is assumed that the observed network is a typical member of this family. This can be achieved by calibrating the random graph’s distribution to macroscopic statistical properties of the observed network, such as the distribution of the degrees and the balance sheet exposures. Our results in this setting are then derived in terms of these global statistics only and hold for essentially the whole ensemble of random configurations. In particular, members of this family can vary significantly on a microscopic level, rendering this approach robust to local changes of the network or statistical uncertainties. Furthermore, under the premise that over time the network may change locally but keeps its global statistics, a fact that is supported empirically by [14] in the context studied here, the results are applicable also for future systems; this is a desirable property from a regulator’s point of view. Additionally, as the results for contagion in random graphs are typically derived in an asymptotic way for a large number of institutions, there is a naturally emerging notion of resilience of a network that does not depend on any arbitrarily chosen parameters such as confidence values.
Within the literature on financial networks the random graphs perspective was first introduced in [24] and carried out for the configuration model in [3]. In [29, 30] it has been extended to a version of the configuration model which allows to capture assortativity of the network. The works [19, 20] analyze default contagion on inhomogeneous random graphs. Other papers that investigate how the network structure influences contagion use for example matrix majorisation in [10] or Baysian methods in [12].
Contribution
Our paper provides a systematic analysis of the effect of complex network structures on contagion and system stability by means of random graphs. We quantify the effect that different subsystems such as core/periphery, geographical location, institutional form (bank, insurance, etc.), have on contagion in the global system and we make combined effects of global network structures and local heterogeneity explicit. Our model setup accounts for the strong complexity observed in global, tiered financial systems in contrast to previous work which has depicted only the effect of heterogeneity, measured in terms of the degree distribution of the individual institutions.
Block Model To describe different subsystems (blocks) to every vertex we assign a type and vertices with the same type form a block. Institutions of the same type could be similar in terms of business strategy or they could reside in the same country for example. In addition we assign a vector of weights to each vertex (institution) in the graph that describes the tendency to develop random edges to vertices of a certain type and thus controls the local characteristics (degree) of the vertex. Figure 1 illustrates a sample from our model with only two types (blue and green) and different weights (and as a result degrees) for vertices of the same type. Our model is a tradeoff to reflect the above mentioned characteristics of financial networks but at the same time preserve analytical tractability. In its undirected version our network skeleton model can be embedded in a general class of random graphs proposed in [7] based on possibly uncountable number of types but without weights. While we believe that in the most general model setting described in [7] a finite dimensional analytic description for the contagion processes is not possible, the combination of types and weights allows us to derive a full analytic description of the process with a multi but finite dimensional system of differential equations. To our knowledge this is the first paper that investigates such kind of process in a model outside the popular class of rank 1 models (or variants thereof) which lead to one dimensional fixpoint equations for the contagion process (see [3, 19, 20]). The resulting multivariate setting poses significant new challenges on the analytical side especially for deriving stopping criteria that ensure that contagion activity in one subsystem is not reinitiating activity in a part that has slowed down already. We mention that – especially in the statistical physics literature – one often refers to fitness of a vertex instead of type, see [9, 25, 26, 37] for example. As our model description strongly depends on the choice of vertex types (blocks), for calibration purposes one needs to draw on methods for detection of communities and core-periphery structure, which are well developed. See for instance [6, 13, 15, 22, 40, 41] respectively [28, 36].
Exposure Distributions The standard setting in the random-graph approach to default contagion is that exposure distributions only depend on the creditor banks. Just thinking of the example of a core-periphery network shows the limitations of this assumption, as liabilities between core-banks should be significantly higher than liabilities of a core-bank to a periphery-bank. In the present work we waive this assumption thus allowing for realistic exposure distributions. While this might seem like a minor additional feature, it in fact increases mathematical complexity significantly as variations in the banks exposures cannot be encoded in vertex features anymore as in previous instances in which the contagion process could be reduced to a threshold model ([3, 20]). The exposures now become an integral part of the contagion process and it is one of the technical contributions of this article to provide in a first instance an analysis of such a setting.
Analytic Results on the Final Default Fraction and Resilience Our main result in this paper is a full analytic desciption of the default contagion process in our model. Our first main result Theorem 3.4 identifies bounds for the final fraction of defaulted institutions in a system hit by some arbitrarily specified initial shock. The following informal statement summarizes the main insights from Theorem 3.4.
Mock Theorem**.**
Consider a financial network of size that was hit by some exogenous shock so that some of the banks are initially defaulted. Then under certain regularity assumptions there exist constants such that
[TABLE]
where denotes a term that vanishes as becomes large. The constants can be computed explicitly in terms of the global network statistics. In most relevant settings lower and upper bound equal ().
For large network sizes , the theorem hence determines explicitly the fraction of finally defaulted institutions in the system. As it only depends on the global network statistics the result is robust to statistical uncertainties on an institution level and stays true also for future points in time as long as macro-statistical properties of the system do not change much.
From a regulator’s viewpoint, more than merely describing the contagion process for certain shock events, it is important to understand whether today’s financial system is able to absorb possible future shocks. A common approach to this question in risk management is to choose certain parameters for the initial stress and quantiles of the final damage that are deemed admissible. Our approach for large networks, however, gives rise to a parameter-free alternative: we call a system non-resilient if the final fraction of defaulted institutions is lower bounded by a positive constant no matter how small the initial shock was.
Building on our description of the final default fraction, a second main contribution of this paper is thus to derive explicit criteria to decide whether a certain system is (non-)resilient. In contrast to the previous literature (see [3, 19, 20]) where a system was classified either as resilient or non-resilient independent of the shock that is applied it turns out that in the model studied here the distribution of the initial shock becomes relevant. Different shocks may target different subsystems and the effect varies greatly; this allows us to quantify the effect of clusters and tiers for system stability more accurately than previous work and we can investigate which network characteristics promote the spread of distress and how global cascades can be contained.
Applications Recall that the leading question we want to study in this paper is what impact the complex intertwining of modern financial networks – such as the global connectedness and the tiered structures – has on their stability. We demonstrate by several applications how the features of our model effect the course of the contagion process. First, we consider the influence of a non-resilient subsystem on a lager global system. We find that not only this non-resilient subpart may make the system as a whole non-resilient, but it can also cause severe damage to a priori resilient parts of the network. More crucially, we also find that a system consisting only of resilient subsystems may become non-resilient due to cross-type (e. g. cross-border) linkages. Therefore, we further derive criteria for resilience of the global system based on conditions for the subsystems and the connectivity between them. Finally, we consider the reshuffling of exposures in a network where originally all exposures only depend on the creditor – the exposed party – such that the new network’s exposures respect a core-periphery structure. We show that by this procedure an initially resilient system can become non-resilient, which stresses the importance of creditor and debtor dependent exposures in a model for default contagion as otherwise contagion effects are underestimated.
Outline
The paper is structured as follows: In Section 2, we introduce the random graph and describe the model for default contagion. We then derive asymptotic results on the final default fraction in Section 3. In Section 4 we discuss (non-)resilience and the corresponding criteria. We then present our applications in Section 5 and perform simulations for finite networks. Finally, we provide proofs of our results in Section 6.
2 Default Contagion on a Random Multi-type Network
We describe a model for a financial network consisting of vertices (institutions) and random directed edges between them. We usually think of an institution as a bank in an interbank network and of a directed edge going from institution to as a financial exposure of which emanates from , for example by an outstanding interbank-loan from to . Our model accounts for two more features. First, we assign exposures to the edges representing the amount of the loan. As will be clear from the construction in the following, the assignment of exposures depends on both the creditor- and the debtor-institution. Second, we assign different types to the institutions in the network. This allows to describe more involved network structures such as core-periphery networks – a two-type network in our terminology – and (dis-)assortative structures.
2.1 Vertex Types
We begin by assigning to each institution a type , where is the fixed number of types. In the prominent case of a core-periphery network we choose and a bank shall be a core bank if resp. a periphery bank if . Alternatively banks in one country or region could be assigned the same type. Hence the financial network is partitioned into sets of institutions of different types, which we also call blocks.
2.2 Vertex Weights and Random Exposures
Next, we fix and we construct a random network with exposures in . To this end, assign to each institution a set of non-negative vertex-weights. Here the weight describes the tendency of bank to develop incoming edges with exposure from institutions of type . Similarly, describes the tendency of to form outgoing edges with exposure to institutions of type . To formalize this, let be the indicator random variable which is if there is an edge with exposure going from to and [math] otherwise and let be a Bernoulli random variable with expectation
[TABLE]
To avoid multiple edges with different exposures between the institutions, we assume to be mutually exclusive in the sense that . Also, we assume that edges between different pairs of institutions are independent, i. e. for all if or . In particular, for all , . This can for example be achieved by introducing a sequence of independent random variables , each distributed uniformly on the interval , and letting X_{i,j}^{r}=\mathbf{1}\big{\{}U_{i,j}\in\big{[}\sum_{s\leq r-1}p_{i,j}^{s},\sum_{s\leq r}p_{i,j}^{s}\big{)}\big{\}}. The upper bound in (2.1) then ensures that .
2.3 Capital and Default Contagion
We assign to each institution an initial amount of capital (equity) . We call an institution solvent if and insolvent if and we denote by the set of initially defaulted institutions. The initial default shall be due to some exogenous event such as a stock market crash. Because of the interconnections in the network the default of the institutions in will spread through the network. This happens since the defaulted banks cannot (fully) repay their loans to their creditors. As first suggested in [24] it is a reasonable assumption that defaulted debtors cannot repay any of their debts since processing their default may take months or even years while financial contagion is a short term process. In fact one can generalize our model to the case of a fixed constant recovery rate simply by adjusting the capitals. The default contagion process can then be described as follows. In round of the default cascade the set of defaulted institutions is
[TABLE]
In particular, and the chain of default sets stabilizes at round the latest. We hence denote the final default set by . Note that the only randomness in this process stems from the random links in the network. Once a network configuration has been fixed, the whole default contagion sequence is fully determined. The following two remarks address interesting possible extensions of our setting.
Remark 2.1**.**
In the following we use the fraction of finally defaulted institutions as a measure for the severity of a given shock in the network. It makes sense, however, to not only consider the finally defaulted institutions but to introduce a parameter of general systemic importance for each bank and use to measure the severity of the shock. Since the systemic importance values do not influence the process (2.2), all our results can be extended to this more general setting under mild assumptions on . See Remark 3.6 for the general setting.
Remark 2.2**.**
To model realistic financial networks with general exposure values, it would be a priori necessary to choose very large and our model would become high-dimensional. Instead of considering an exposure between two institutions, however, one can also interpret it as a more general factor of impact. It is then possible to model unbounded exposure distributions also with a considerably small choice of . More precisely, we can assign to each institution a list of exchangeable random variables and take the sum over -many of them to compute the actual exposure of an edge with impact . Under minor assumptions on the distribution of these exchangeable random variables, the main results of this paper can be generalized to this setting by a conditioning argument. See [20] for a precise discussion of this idea in the case .
2.4 Regular Vertex Sequences
In the previous subsections we introduced several parameters and in particular, any random ensemble is described by the weight sequences and for and , the capital sequence , and the type sequence . That is, much of the information about the system – in particular the structure of the network configuration – is contained in the empirical distribution function
[TABLE]
for , and .
The setting described so far puts us in the position to model a system with a given number of institutions. However, as already described in the introduction, our main focus is in studying how the structure in the underlying network affects the contagion process and, more generally, the (in-)stability of the system as a whole. Towards this aim we proceed as follows. Instead of restricting our attention to a single system configuration, we consider an ensemble of systems that are similar, where the structural similarity is measured precisely in terms of the joint empirical distribution of all parameters that we consider. In particular, we assume that we have a collection of systems with a varying number of institutions with the property that the sequence of empirical distributions converges.
Definition 2.3** (Regular vertex sequence).**
A sequence of model parameters for different network sizes is called a regular vertex sequence if the following conditions are satisfied. Note that we do not specify the ranges of and to keep the notation concise. Here and in the following we always mean and .
- (a)
Convergence in distribution: Let be a random vector distributed according to the empirical distribution function . Then there exists a distribution function such that for all points at which is continuous. Denote by a random vector distributed according to . 2. (b)
Convergence of average weights: For and all , :
[TABLE]
To understand the asymptotic degree sequence of our model let us fix and only look at links with exposure size . We look at a vertex of type with out-weight to vertices of type equal to . Then its out-degree towards vertices of type is a sum of independent Bernoulli trials, whose expectation converges to due to property (b) of Definition 2.3. With this observation similar ideas for a Poisson coupling of the degree sequence as used in [19, Theorem 3.3] can be applied to prove the following result about the degree sequence in our financial system.
Proposition 2.4**.**
Consider a financial system described by a regular vertex sequence and let be the -out/in-degree with respect to banks of type of some bank in the network chosen uniformly at random. Then for each , as , in distribution
[TABLE]
where . In particular, the -out/in-degree with respect to banks of type of some uniformly chosen bank of type converges in distribution to \mathrm{Poi}\big{(}W^{\pm,r,\alpha}\zeta_{\mp}^{r,\beta,\alpha}\big{)}.
3 Asymptotic Results
This section presents results for the final default fraction triggered by some set of initial defaults, which is one of the main contributions of this paper, see Subsection 3.2. In Subsection 3.1, we first introduce some functions that will play an important role. For the sake of readability, most of the – mainly technical – proofs of this section are moved to the appendix.
3.1 Preliminaries
Denote in the following . Let for independent Poisson random variables . In the following, functions , , and will play a central role. They are given by
[TABLE]
Let us provide some intuition about the meaning of these functions. The contagion process described in (2.2) can be restated in an equivalent sequential form where in each step only the effect of one defaulted institution on the system is explored. Defaulted institutions can then have two status: explored meaning their effect on the system has already been accounted for and unexplored meaning that their effect on the system has not yet been accounted for. We look at the case first. Then there is only one function of one variable which shall denote the total out-weight of defaulted and explored institutions divided by . For an institution with in-weight we know that in the limit () the number of neighbors is given by with the total out-weight divided by , i.e. . Replacing by the number of defaulted and explored neighbours should intuitively be given by . Continuing with this heuristics, the probability that has defaulted (no matter if already exposed or unexposed) is and summing up over , the out-weight of all defaulted institutions as a result of exposing defaulted institutions with out-weight roughly equal is given by . If or equivalently then there are no unexposed defaulted institutions and the process might come to a standstill.
In the multivariate case the variable equals the sum of the out-weights of defaulted and already explored type vertices for building edges with exposure to type vertices. For given the function value quantifies the total out-weight of defaulted but unexplored type vertices for building edges with exposure towards vertices of type . Similarly as above when the total out-weight of defaulted and unexplored type vertices for building edges with exposure to type vertices is zero meaning that infection from vertices to vertices via exposure of size has slowed down but there can still be contagion activity in the graph. Only when for all the process might come to a standstill. Let be such a joint root. Then, in the limit (), a vertex of type with capital has r-in-degree from type vertices approximately Poisson distributed with mean . Vertex thus defaults with probability . If we now choose the vertex uniformly instead, then its default probability is given by .
Before making this intuition rigorous and proving our main results we begin by investigating some basic but important properties of these functions.
Lemma 3.1**.**
The functions , , and are continuous at all . Further, each function is monotonically increasing in all of its coordinates except .
Proof.
Continuity follows from Lebesgue’s dominated convergence theorem noting that the integrands are continuous in and bounded by the integrable random variable resp. by . Monotonicity of follows directly from the monotonicity of the Poisson-probabilities. ∎
Let now . Since for any with and is an intersection of closed sets, is in fact compact. Note that clearly . In general might consist of several disjoint, compact, connected components. Let in the following denote the component (i. e. the largest connected subset) of containing . Since is a compact subset of , so is . Define now by . The following lemma shows that in fact and it can hence be thought of as the maximal point of . Further it identifies as a joint root of all the functions , , and shows the existence of a smallest joint root . It will turn out later (see in particular Theorem 3.4) that the final fraction is intimately related to these two (typically coinciding) joint roots of the functions , .
Lemma 3.2**.**
There exists a smallest joint root of all the functions , , in the sense that componentwise for all joint roots . Further, as defined above is a joint root of the functions , , and both and .
The lemma identifies as the maximal joint root of , , in . However, if , then there will exist joint roots such that componentwise.
Often and will coincide and then Theorem 3.4 below will show that the final default fraction converges to in probability. But in some pathological situations this is not the case and Theorem 3.4 will yield a lower bound on in terms of and an upper bound in terms of . Figures 2 and 2 show two-dimensional examples of . In both examples, we chose and . In the first example, we further chose all weights to be and the capital of each bank to be with probability respectively [math] with probability . The functions and , where and , then have a unique joint root, i. e. . In the second example, we chose all weights to be and the capital of each bank to be with probability respectively [math] with probability . In this case, there exist two distinct joint roots in . At , the root sets of and do not cross each other but only touch.
The next lemma provides two sufficient criteria to check if a joint root, such as , equals . These depend on the (weak) directional derivatives of , , and are hence natural extensions of the stable fixed point assumption in previous literature such as [3, 19, 20].
Lemma 3.3**.**
If is a joint root of the functions , , then if one of the following holds:
- (a)
There exists such that for all the directional derivatives exist and . 2. (b)
There exist , and such that for every ,
[TABLE]
3.2 The Main Result for the Final Default Fraction
We now provide an asymptotic formula for the final default fraction in terms of function and the joint roots and . The one type and exposure case () of the following result was obtained in [19, Theorem 2.3] under an additional differentiability assumption guaranteeing that .
Theorem 3.4**.**
Consider a financial system described by a regular vertex sequence and let and be the smallest respectively largest joint root in of the functions . Then
[TABLE]
In particular, if , then .
See Section 6.3 for the proof.
Remark 3.5**.**
Theorem 3.4 determines as a lower bound on the fraction of all finally defaulted banks in the network. In fact, is given by a sum over all the different types in the network and it is thus no surprise that by small changes in the proofs of Theorems 6.3 and 3.4, one derives that the number of finally defaulted banks of type is lower bounded by
[TABLE]
The same reasoning allows to derive an upper bound in terms of .
Remark 3.6**.**
As mentioned in Remark 2.1, in many situations it makes sense to measure the damage caused by a shock event to the whole system not simply by counting finally defaulted banks but to weight them according to some systemic importance value , . If the empirical distribution of converges in distribution and mean to a random variable , then in analogy to Theorem 3.4, the total systemic importance of finally defaulted banks is lower bounded by and upper bounded by , where
[TABLE]
4 Resilient and Non-Resilient Networks
In the previous section we derived results that allow us to determine the typical final default fraction in large financial systems caused by an exogenous shock. Another important question from a regulator’s point of view that we study in this section is whether a given system in an initially unshocked state is likely to be resilient to small shocks or susceptible to default cascades.
Note that for some fixed financial network all information about the initial shock stems from and by “initially unshocked” we mean that for all . We model small shocks to the system by an ex post infection in the following sense: we introduce indicators , , with the meaning that (the initially solvent) bank becomes insolvent if . This amounts to setting its capital to . In analogy to Definition 2.3 we assume regularity of (jointly with the rest of the parameters) and we denote by the limiting random variable of ex post infection. In particular, the financial system shall be described by the random vector with and . Denote by the random final default set that triggers and by , and the analogues of , respectively with replaced by .
From a regulator’s point of view a desirable property of a financial system is the ability to absorb small local shocks without larger parts of the system being harmed. In our asymptotic setting, we can even choose arbitrarily small and we call a system resilient if the final default fraction tends to [math] as . If on the other hand is lower bounded by some positive constant, we call the system non-resilient (see Definition 4.3 below). We say that a sequence of events holds with high probability (w. h. p.) if , as .
Definition 4.1** (Resilience).**
A financial system is said to be resilient if for each there exists such that for all with it holds w. h. p.
It will turn out that the resilience of the system strongly depends on the form of the set which was introduced in Subsection 3.1. Our first result is a criterion guaranteeing resilience.
Theorem 4.2** (Resilience Criterion).**
*Consider a financial system described by a regular vertex sequence and assume that . Then the system is resilient. *
In particular for , resilience is ensured if and Theorem 4.2 extends the one dimensional setting studied in [19, Theorem 2.7]. Moreover, by Lemma 3.3, if for some , exists and is negative for each , then and Theorem 4.2 is applicable.
Figure 3 shows a two-dimensional example satisfying the condition in Theorem 4.2. We chose , , and and let and . It can be seen from the figure that a small shock (here of all banks) keeps the smallest joint root of and for the shocked system close to . By continuity properties of as and it follows that the final default fraction is small for shocks with small.
On the other hand, to characterize non-resilient networks, a difficulty that arises is that the ex post shock possibly targets only certain subnetworks or only vertices with certain characteristics (weights). The subnetwork (for example core or periphery) that is targeted is encoded in the joint distribution of and it is not surprising that the effect of the ex-post infections depends on . However, it turns out that this information is not sufficient in order to determine the impact of the shock completely and also the weights of targeted institutions matter, i.e. whether the targeted institutions build edges with exposure to vertices of type . More precisely, define
[TABLE]
and note that if vertices of type build edges with exposure to vertices of type . A shock such that for all targets only lenders who are not borrowing themselves and it is not surprising that these shocks do not spread, i.e. the financial system is resilient with respect to these shocks. For all other shocks it turns out that they can be classified by checking for each if is equal to [math] or strictly greater than [math] instead. Consider for example a financial network consisting of banks of two types which are isolated of each other. Further, one of the two subnetworks shall be resilient, whereas the other one is non-resilient (in the sense of Definition 4.3 (b)). In order for the whole system to experience large damage, it is then necessary that does not only infect banks in the resilient subsystem but also in the non-resilient one. This explains why we have to differentiate between different choices for in the following to fully understand non-resilience in our model.
Definition 4.3** (Non-Resilience).**
- (a)
Let . A financial system is called non-resilient with respect to shocks on if there exists a constant such that w. h. p. for each shock with for all . 2. (b)
We call a financial system non-resilient if it is non-resilient w. r. t. shocks on some .
Clearly if a system is non-resilient with respect to shocks on it is also non-resilient with respects to shocks on for . It follows that a system is non-resilient if and only if it is non-resilient w. r. t. shocks on .
Remark 4.4**.**
Definition 4.3 characterizes networks as non-resilient (with respect to shocks on ) if a lower bounded fraction of banks defaults. In many applications it might be desirable to distinguish between different parts of the global network and only call a system non-resilient if certain important parts experience lower bounded damage. This can be achieved by systemic importance values as introduced in Remark 2.1: assign to banks in unimportant parts of the global network and replace in Definitions 4.1 and 4.3 by .
Let us start by considering the special case that infects every part of the system (i. e. a shock on ). This is the case for example if is independent of type , vertex-weights and capital . We can then formulate a corollary of Theorem 4.7 stated below:
Corollary 4.5**.**
Consider a financial system described by a regular vertex sequence and any ex post infection with for all . Then w. h. p. . If (i. e. ), then and the system is non-resilient.
By Theorem 4.2 and Corollary 4.5 resilience of a financial system is hence completely characterized by . See Figure 4 for an example where . In this example, we chose , , weights and capital . The figure shows the jump of the smallest joint root from to above for any small shock (here of all banks). The discontinuity of the roof set of (orange line) shows that particularly the edges with exposure make the system non-resilient.
We now aim to describe non-resilience with respect to shocks on . That is, we consider shocks such that for but possibly for . To this end, denote
[TABLE]
and define by . Lemma 4.6 shows that is the smallest joint root of , , that is stable with respect to shocks in the -coordinates.
Lemma 4.6**.**
It holds and it is thus a joint root of , .
We can state a general theorem for non-resilience in terms of , where denotes the set of coordinates impacted by .
Theorem 4.7** (Non-Resilience Criterion).**
Consider a financial system described by a regular vertex sequence and any ex post infection with for all , where . Then w. h. p. . If , then and the system is thus non-resilient with respect to shocks on .
By Theorem 4.7 we derive for shocks on that for any w. h. p. while in Corollary 4.5 we claimed w. h. p. By the following lemma the two are in fact equivalent.
Lemma 4.8**.**
It holds .
The identity on the other hand does not necessarily imply .
5 Applications
The theory developed in the previous sections allows to investigate many interesting novel settings as compared to the present literature. In this section, we discuss some of them and highlight their implications. Further, we demonstrate the applicability of our asymptotic results also for finite networks of reasonable size by numerical simulations.
In the first example, we investigate the influence of a non-resilient subsystem in a global system. Unsurprisingly the global system turns out to be non-resilient as well and we can further show that even resilient network parts become non-resilient by their connections to the non-resilient subsystem, i. e. every howsoever small infection that occurs only within the resilient part of the system finally spreads to a lower bounded fraction of the resilient subsystem.
Example 5.1**.**
For simplicity assume and denote , and in the following. Consider then a -type banking system, described by the random vector , where and , and assume that it is non-resilient. In the -dimensional case this breaks down to the existence of such that
[TABLE]
Now introduce a second (possibly resilient) subsystem to the network. That is, the system is now described by the random vector , where , and means that bank is in the non-resilient subsystem, whereas means that is part of the second subsystem. In order for the characteristics of the non-resilient subsystem to be preserved, we require that , (to account for the changed number of banks; due to the multiplicative form in (2.1) it is sufficient to adjust either in- or out-weights by ) and . We derive that
[TABLE]
for all with and in particular , where . An application of Theorem 4.7 then yields that the fraction of finally defaulted banks in the network is lower bounded by
[TABLE]
w. h. p. for any ex post infection satisfying (i. e. infecting some banks in the non-resilient subsystem). That is, if a small fraction of banks in the non-resilient subsystem defaults due to an external shock event, then this infection spreads to the whole system and the fraction of finally defaulted banks in the second subsystem is w. h. p. lower bounded by
[TABLE]
In fact, if we assume that almost surely and (that is, there are some banks in the second subsystem lending to banks in the non-resilient subsystem), then it must hold that
[TABLE]
and hence the lower bound (5.1) is strictly positive. That is, every howsoever small infected fraction in the non-resilient subsystem spreads to a lower bounded fraction of finally defaulted banks in the second subsystem as well.
Now finally assume that almost surely and (that is, there are some banks in the non-resilient subsystem lending to banks in the second subsystem). By considering the function
[TABLE]
we derive that for any ex post infection such that (that is, infecting some banks in the second subsystem) and hence also by the form of (see above). By the same means as before, we hence conclude that in fact and so the lower bounds derived above still hold. In particular, this means that every howsoever small initial shock to the second (possibly resilient) subsystem causes the default of a lower bounded fraction of banks in the second subsystem. That is, by connecting to the non-resilient subsystem the a priori possibly resilient second subsystem becomes non-resilient as well.
To better understand the phenomenon in Example 5.1, we specify all parameters explicitly: Let
[TABLE]
for and . The parameters and are then a measure for how strongly connected the respective subsystems are and it is easy to confirm that the type-1 subsystem is in fact non-resilient whereas the type-2 subsystem is resilient. Both subnetworks are Erdös-Rényi random graphs. In the first subnetwork every edge is contagious and because of there exists a giant component (a component of size for some ). As soon as one vertex in the giant component defaults, the entire giant component defaults. The second subnetwork can be easily seen to be resilient by analysing the respective functional. Additionally, we assume that both subsystems have the same size and edges from subsystem to subsystem are as likely as edges from subsystem to subsystem , i.e. and . The parameter is a measure for how strongly interconnected the different subsystems are. In particular,
[TABLE]
and hence it must hold that resp. . The problem then reduces to and , where , and
[TABLE]
Depending on the choice of the weights , , the system shows slightly different behaviour, as illustrated in Figures 5, 5 and 5. In all cases, which determines a strictly positive lower bound on the final default fraction as shown in Example 5.1. Further in all three cases the type subsystem is resilient. However, in 5 and 5 the root sets for the function shows a discontinuity even along the axis . Let us elaborate on what this means. Along the function describes contagion within the resilient subsystem , not taking contagion between the subsystems into account. The discontinuity of set on the axis then means the following: For small shocks on subsystem contagion is being contained. As the shock gets larger, however, the gap in is overcome and the final fraction of defaulted type institutions experiences a jump above the upper end of on . Considering the full picture again additionally to the small initial shock, subsystem experiences a shock by the positive fraction of defaulted type institutions. While in 5 their number is not sufficient to overcome the gap in and the final fraction of type institutions stays small (but positive), in 5 with larger parameter and hence denser connection between the subsystems, the shock on subsystem imposed by defaulted type 1 instututions is strong enough to overcome the gap and cause severe damage to subsystem . The discontinuity phenomena has been observed in [33] for the Erdös-Rényi random graph.
Since all the main results of this article and the derivations in Example 5.1 are asymptotical, we demonstrate the applicability for finite networks numerically: For each of the scenarios (a)-(c) in Figure 5 we performed simulations on networks of varying size with initially defaulted banks. The outcomes are plotted in Figure 6 together with the theoretical asymptotic final default fraction (taking into account the initial default fraction of ). For case (a) except for 6 simulations at all results lie considerably close to the theoretical final fraction of and their deviation becomes smaller the larger grows. For case (b) and some of the simulations ended in final default fractions around . (Graphically these come from deviations of the hump (root set of , orange) in Figure 5 such that it intersects with the root of (blue)). For all other simulations and especially for , the simulation results clearly converge to the theoretical value of . For case (c), finally, some of the simulation outcomes for were close to [math] and few around (the value if one plugs in the largest of the three joint roots into ). The majority of the simulations (in particular for ), however, resulted in final default fractions close to the theoretical value of and again deviations decrease as increases and we clearly confirm the theoretical convergence. Altogether we conclude that already for finite networks of a few thousand vertices our asymptotic results are applicable with good accuracy.
In particular, what we learn from Example 5.1 is that in order to ensure resilience of a particular subsystem, one needs to completely prohibit links to other non-resilient subsystems. It is, however, also possible that two subsystems which are resilient on their own form a non-resilient global system once connected to each other. It is therefore an interesting regulatory question how to ensure also resilience of a global system composed of various resilient subsystems. In general for our model the answer to this question is provided by Theorem 4.2. However, in the following example we state a more intuitive criterion.
Example 5.2**.**
Again, for simplicity assume that . Consider a financial network consisting of subnetworks (types) which shall satisfy the following -dimensional resilience conditions: For each there exists such that for all and it holds
[TABLE]
Note that this condition implies for all small enough and hence indeed it implies resilience of the subsystem by Theorem 4.2. In [20] explicit capital requirements (i. e. a formula for in dependence of ) were derived for the case of Pareto distributed weights (which are typically observed in real networks) which ensure (5.2).
Now further assume that there exists a constant such that
[TABLE]
for all , i. e. the tendency of institutions to develop links with institutions outside their subnetwork is bounded by a constant multiple of their tendency to develop links with institutions within their subnetwork. In particular this is the case if the external weights are bounded from above and the internal weights are bounded from below.
Replacing by only makes the system less resilient (if the weights increase, the number of links increases and hence the total exposure of each institution). Hence set for and . Now define by , . Then we derive that
[TABLE]
for , and
[TABLE]
for and . If we now choose , then
[TABLE]
for all small enough. It thus holds and therefore . We can then apply Theorem 4.2 and obtain that the combined system is still resilient.
*From a regulatory perspective it is hence enough to impose capital requirements described by (5.2) and to restrict links between different subsystems in the sense of (5.3). *
In our first two examples we concentrated on the (non-)resilience of multi-type networks. For simplicity, we assumed that all edges carry the same exposure (). Another interesting feature of our model, however, is that it allows for exposures that depend on the types of both the creditor and the debtor bank. The following example shows that this can indeed make a huge difference as compared to previous models in which exposures could only depend on the size/degree/type of the creditor bank. It considers two very similar financial systems whose only difference is that in one system exposures depend on both the creditor and debtor type and in the other system they depend on the type of the creditor bank only. As a consequence the first system will turn out to be non-resilient whereas the second one is resilient.
Example 5.3**.**
Consider a network of size in which (asymptotically) of all banks have type and the remaining banks have type . That is, . Further assume that for each pair of vertices an edge from to shall be present with probability . Edges between two banks of type shall carry exposure and all other edges exposure . That is, if , then and . If , then and . Finally, all banks shall have capital .
Then similarly as for Example 5.1 the originally eight-dimensional system reduces to
[TABLE]
See Figure 7 for an illustration of the root sets of and . This figure already shows that and hence non-resilience by Theorem 4.7.
Also for , we can compute
[TABLE]
which rigorously proves that the type- subnetwork and then also the whole system is non-resilient (cf. Example 5.1). Numerically one derives that and . In order to test this prediction, we performed simulations of financial networks of size with initial default probability . In only of the simulations, we observed a resilient nature in the sense that the simulated final default fraction was lower than . All of the remaining simulations ended with a final default fraction within and are hence of a non-resilient nature. Averaging over the latter ones yields a mean final default fraction of .
Now consider the following modified network: Instead of assigning exposure to all links between two type- banks and exposure to all other links, this time assign exposure with probability to any edge going to a type- bank (all other edges are assigned exposure ). That is, we keep the skeleton of the network but we redistribute the exposures in such a way that they do only depend on the creditor bank and not on the debtor bank. The total number of edges with exposure stays the same (note that in the first network the type- banks accounted to a fraction of of all the debtor banks of type- banks). This can be achieved by assigning the following new vertex-weights: for all . Further, if , then and . All other vertex-weights shall stay the same. The new system then reduces to the following two functions, whose root sets are shown in Figure 7:
[TABLE]
Figure 7 shows that the root set of is being shifted to the left, now starting off above the root set of . One can hence already expect that and the new system is resilient. Also more rigorously, as , we derive that
[TABLE]
The directional derivatives and thus exist for every . Choose then for example such that and . From Lemma 3.3 we thus derive that and hence . This allows us to apply Theorem 4.2 and hence the modified system is indeed resilient. Again this can be validated numerically. On the same skeleton as for the previous simulation but with random exposures as described above the simulated final default fractions are now all within the interval with an average of . The system is hence indeed of a resilient nature.
Although Example 5.3 is too simple to model a real financial network, it still shows that counterparty-dependent exposures may have a significant impact on the stability of the system. In general it is also possible that they increase stability of the system, however.
6 Proofs
In this section we provide the proofs of our results in Sections 3 and 4. Theorem 3.4 will be proved in two steps. At this the underlying ideas are similar to [19] but at a considerable number of steps novel methods have to be used and we will particularly discuss them in detail. We use the notation
[TABLE]
for the cuboid spanned by the vectors and in in the following. Further, let be defined by .
6.1 Proofs of Lemmas 3.2 and 3.3
Proof of Lemma 3.2.
Existence of a smallest joint root is ensured by the Knaster-Tarski fixed point theorem. We now construct a joint root which shows that , in particular: It holds for all and then for all such that by monotonicity of from Lemma 3.1. Consider then the following sequence :
- •
- •
, where is the smallest possible value such that . It is possible to find such by the intermediate value theorem since is continuous, and . By Lemma 3.1, it then holds for all . In particular, .
- •
, where is the smallest value such that . Again it is possible to find such by the intermediate value theorem since is continuous, and . Since , by Lemma 3.1 it then holds