1 Introduction

Assessing the ability of a system to absorb shocks is a very relevant task. Indeed, it is not rare to assist at macroscopic fluctuations of a complex system generated by a microscopic impulse occurring in one of its components. The consequences of such sources of instability might be devastating; hence, their prevention and management represent targets for all the actors operating around the observed system.

From this perspective, the high attention paid to the resilience is considered useful in order to acquire insights concerning complex systems and, in particular, complex networks. Starting from the seminal paper of Albert et al. (2000), resilience in complex networks was investigated theoretically (Gao et al. 2016) and then extended by considering the effects of different node removal strategies on the network structure (Ferrraro and Iovanella 2018; Iyer et al. 2013) or as a function of nodes’ mixing preferences (D’Agostino et al. 2012).

For the special theme of the resilience, it is natural to capture the propagation of a shock over a system as a transition from different sites through their connecting links. In the scientific literature, the study of the resilience is mainly related to the analysis of a performance measure, typically the diameter of the network, under two different schemes of stress depending on a targeted attack to a particular node or considering the random failure of a node, viewed as a network error (Albert et al. 2000; Chen et al. 2015). Such analysis are relatively easy to perform and this explains why the models of resilience of a system are framed in the context of complex networks (Ferrraro and Iovanella 2018).

In this paper, the assessment of the resilience is performed by taking into considerations a new measure based on the shocks occurring in one of the nodes and on its propagation over the links of the network. We assume that the propagation of a shock from a node to another one occurs over the shortest path connecting the nodes. In so doing, we develop a model where the nodes are immunized from the subsequent effects of the shock, once they are infected for the first time by its propagation. This condition is particularly reasonable in several real-world situations. Moreover, it offers also relevant advantages under the perspective of the computational complexity of the applications of such a resilience measure. Indeed, under a purely methodological point of view, the considered resilience measure is similar to that presented in Cerqueti et al. (2019), by overcoming its limitations in terms of its applicability opportunities when focusing on the shortest paths. Indeed, as indicated in Cinelli et al. (2017), the computation time of all simple paths grows exponentially with the size of the network (Fortune et al. 1980), thus only small networks can be analysed in an acceptable time. Importantly, in line with (Cerqueti et al. 2019), we assume that the propagation of the shock is opportunely rescaled as the distance from the shocked nodes increases. In doing so, we provide a versatile device which includes either amplified or dampened effects of the distance from the shocked node—where the nature of the effects has to be identified on the basis of the considered real world case. In this context, a relevant role is played by the identification of the size of the shock (on this, see also Acemoglu et al. 2015).

The proposed resilience measure shows some clear advantages with respect to the existing ones. Indeed, we point out that the most popular resilience measure in the environment of complex networks is based on the nodes removal, with the assessment of the reaction of the overall system to such an impulsive shock (see Albert et al. 2000). Under a different perspective, we can also consider resilience measures based on a cascade model (see e.g. Rosas-Casals et al. 2015; Scala et al. 2016). In such a context, the failure of a node generates an avalanche-like event that may generate the disruption of the entire system. Such measures are not suitable to provide a proper modelling of our framework. Indeed, a resilience measure based on nodes removal is not a reliable device in a context such as the financial one—where the actors go in distress but are not removed from the system; furthermore, cascade-based models are associated to collapsing systems, while here we discuss the direct reaction of the single nodes to the shocks propagating from other nodes. In this respect, the resilience measure proposed in our paper is suitable for financial applications, in that it includes also the propagation of the financial distress from a country to another one.

As we will see, the methodological proposal is tested over a relevant financial network associated to the interbanking sector. The motivations for this choice lies in the paradigmatic relevance of the financial context, mainly when one deals with the concept of resilience. In fact, accounting for shocks propagation in finance contributes to describe a pivotal feature of financial systems, which has been tested by several paradigmatic cases such as the financial contagion associated to the Lehman Brothers’ bankruptcy (Dumontaux and Pop 2013). This explains why in the wide world of complex networks, those of financial nature are of particular interest (Allen and Babus 2008). Many applications were studied considering dynamic evolution (Peron et al. 2012), incomplete information (Cinelli et al. 2021), risk management (Nagurney and Ke 2006) and diffusion of contagion and its relationship with the network structure (Elliott et al. 2014,Glasserman and Peyton Young 2016). Indeed, the constitutive property of a network model—i.e., the presence of disaggregated units which are mutually interconnected—is crucial when the aim is to describe financial patterns (see e.g. Nedovic and Devedzic 2002 or the review in Rada (2008)).

In detail, we propose a complex network model for the interbanking sector, where nodes are countries and links are weighted on the basis of the mutual exposures among the banks headquartered in the countries. Specifically, we hypothesize that the stronger the mutual exposures among the banks, the higher the weights of the links among the related countries, as intuitively should be.

Following previous contributions in the quantitative finance literature, we have retrieved the empirical quarterly data from the Bank for International Settlements (BIS) database (see e.g. Bongini et al. 2018; Cerqueti et al. 2020; Cinelli et al. 2021; Demir and Onder 2019; Giudici and Spelta 2016; Minoiu and Reyes 2013; Minoiu et al. 2015). The BIS is owned by 62 central banks covering about 95% of the world’s GDP (BIS database www.bis.org). The analysis is carried out also at a temporal level. The period under investigation is 2005–2020 (this latter limited to the first two quarters); such a multiperiodal framework leads to a deep analysis of the resilience evolution in the considered network, in that we build a network for each quarter of the investigated period. Moreover, the financial crisis due to Lehman Brothers’ failure (Dumontaux and Pop 2013) is also taken into consideration.

It is also important to notice that BIS networks are not small enough to face the computational complexity associated to the computation of the resilience measure when not restricting to the shortest paths. However, we point out that such an approximation is quite reasonable in our specific context, since it describes the real situation of a financial contagion walking over the easiest and most direct propagation patterns [see the discussion on this point in the monograph (Chevallier et al. 2019)]. In this respect, our methodological proposal is also able to model the real world situation where a node is infected only once—hence, through the shortest paths—and does not react to subsequent solicitations stemming from the same shocks.

Results on the BIS networks offer a complete view of the considered interbanking sector over the period under investigation. In particular, we observe different resilience patterns as time goes from 2005 to 2020 which significantly correlate with the recorded financial history of such years.

Interestingly, the action of the amplifying/dampening effect of the shocks as the distance from the shocked node increases is relevant. Moreover, there is a reasonable dependence of the resilience of the network on the size of the shock. The obtained outcomes state clearly that large interbank exposures lead to a high level of resilience. In this respect, the years related to the recent economic distresses—the Lehman Brothers’ bankruptcy in 2008 and the COVID-19 pandemic in 2020—are associated to resilience peaks, in agreement with the stylized fact that correlation among banks increases in situations of financial distress.

The paper is organised as follows. Section 2 introduces the resilience measure used in our analysis, by including also a discussion related to the complexity of the considered tool. Section 3 outlines the proposed interbanking network model. Section 4 reports the results of the simulations performed and the related discussions. Finally, Sect. 5 offers some conclusive remarks and outlines directions for future research.

2 The resilience measure

Herein, we introduce the measure of resilience that we will use in the analyses as well as the rationale behind the construction of such a measure. At this aim, as we will see in detail below, we start from Cerqueti et al. (2019) and remove the limitations of the resilience measure in the quoted paper related on its computational complexity—hence, preventing to its applicability in contexts of highly dense networks.

We consider a set \(V=\{1, \dots , n\}\), representing the set of the nodes of a complex directed and weighted network.

The adjacency matrix of the network is denoted by \(\mathbf {W}=(w_{ij})_{i,j \in V}\). Matrix \(\mathbf {W}\) is not necessarily symmetric.

We assume that \(w_{ij} >0\) if and only if there exists a directed link between nodes i and j. In doing so, the adjacency matrix \(\mathbf {W}\) provides a straightforward identification of the links connecting the nodes of the network. When needed, we refer to E as the set of the links of the network.

We now give an integer \(k \ge 2 \) and introduce the k-paths with starting node \(i_0 \in V\) by \(p_{i_0}^{(k)}=\{i_0 \rightarrow i_1 \rightarrow \dots \rightarrow i_{k-1} \rightarrow i_k\}\), with \(i_0,i_1,\dots , i_{k-1},i_k\) distinct nodes in V and \(i_{h-1} \rightarrow i_h \in E\), for each \(h=1,\dots , k\). The node \(i_k\) is said to be the terminal node of \(p_{i_0}^{(k)}\). When needed, we will refer to \(p_{i_0,i_k}^{(k)}\) to specify both the initial node and the terminal node.

Intuitively, the (aggregate) weight of a generic k-path starting from \(i_0\) and with terminal node \(i_k\) is

$$\begin{aligned} w(p_{i_0, i_k}^{(k)})=\sum _{h=1}^kw_{i_{h-1}i_h}. \end{aligned}$$
(1)

We assume that the diameter of the network is \(\bar{k}\), so that \(k=2, \dots , \bar{k}\).

All the k-paths of the network are collected in

$$\begin{aligned} \mathcal {P}^{(k)}=\bigcup _{i_0 \in V} \mathcal {P}^{(k)}(i_0), \end{aligned}$$
(2)

where \(\mathcal {P}^{(k)}(i_0)\) is the collection of the k-paths whose starting node is \(i_0\).

The set \(\mathcal {P}^{(k)}\) in (2) can be quite large, mainly when the considered network is dense and it has a large number of nodes. Indeed, given two nodes \(i_0, i_k \in V\), one can have a large number of different paths starting from \(i_0 \) and with terminal node \(i_k\). Such an evidence is the ground of the computational complexity arising in the resilience measure proposed by Cerqueti et al. (2019).

For this reason, we conveniently restrict our attention to a special subset of \(\mathcal {P}^{(k)}\).

At this aim, given two nodes \(i_0, i_k \in V\), we introduce the shortest path with starting point \(i_0\) and terminal point \(i_k\) as

$$\begin{aligned} p^{min}_{i_0, i_k}= \mathrm{argmin}\left\{ w(p_{i_0, i_k}): p_{i_0, i_k} \in \bigcup _{h=1}^{\bar{k}}\mathcal {P}^{(k)}\right\} . \end{aligned}$$
(3)

Evidently, formula (3) entails that the shortest path with initial value \(i_0\) and terminal value \(i_k\) is not necessarily unique. Therefore, once \(i_0\) and \(i_k\) are fixed, being a shortest path connecting \(i_0\) with \(i_k\) is an equivalence relation. Thus, we can identify the equivalence class collecting the shortest paths from \(i_0\) to \(i_k\), namely \([p^{min}_{i_0, i_k}]\). Hereafter, we will consider only one element of each equivalence class \([p^{min}_{i_0, i_k}]\), without duplicating the shortest paths associated to the same couple of nodes. We denote the representative element of \([p^{min}_{i_0, i_k}]\) as \(p^{min}_{i_0, i_k}\), and we refer to it simply as shortest path from \(i_0\) to \(i_k\). All the shortest paths of the network—clearly, to be intended in the sense of the representative elements—are collected in a set \(\mathcal {P}_{short}\).

We are now in the position of defining the shocks, which are here local events occurring to the nodes of the network. The entity of the shock plays a key role in the analysis of the resilience of the network. Such an entity is assumed to be captured by a positive number \(\xi \in (0,+\infty ) \), and it grows—i.e., the effect of the shock becomes stronger—as the value of \(\xi \) increases.

The shock starts from a given node \(i_0 \in V\) and propagates over the shortest paths with initial value \(i_0\). More specifically, we do not prevent the shock to propagate over all the k-paths, but we do not consider the effects of the shock propagating outside the shortest paths. Practically, this means that the effect of the shock on a node connected to \(i_0\) is registered only at the first time in which such a node is reached—thus, through the shortest path. After that, the node is infected, and it does not react to subsequent solicitations stemming from the same shock. The way propagation occurs depends on the weights of the shortest k-paths, on the entity of the shock and on the distance from the node subject to the shock.

According to Cerqueti et al. (2019), we consider the propagation on a generic k-path \(p_{i_0}^{(k)}\) with weight as in (1) and define a discount factor \(\delta \in [0,+\infty )\), that captures the effect of the distance on the propagation as follows

$$\begin{aligned} \xi _h= \xi \sum _{s=1}^hw_{i_{s-1}i_s} \delta ^{h-s+1}, \end{aligned}$$
(4)

where \(\xi _h\) is the entity of the shock at node \(i_h\), for each \(h=0, \dots , k\) and \(\xi _0=\xi \).

We also include a propagation condition, which is the core of the resilience measure. Indeed, if the shock is too weak, then the propagation motion stops. To formalize the propagation condition, we introduce a vector \(\Gamma =(\gamma _1, \dots \gamma _{\bar{k}}) \in (0, +\infty )^{\bar{k}}\) and assume that the existence of \(s=0,1,2,\dots ,h-1\) such that \(\xi _s < \gamma _s\) prevents the propagation of the shock to node \(i_h\). The validity of the propagation conditions clusters the k-paths in two classes: the ones where the shock \(\xi \) propagates and those where such a shock does not achieve the last node. The clusters are, of course, dependent also on the considered vector \(\Gamma \). We denote by \(\mathcal {P}^{(k)}_{\Gamma ,\xi }\) the set collecting the k-paths – not necessarily the shortest k-paths—which satisfy the propagation condition for \(\Gamma \) and \(\xi \).

We are ready to define our concept of network resilience.

Given the vector \(\Gamma \) and the shock with entity \(\xi \), we define the \(\Gamma -\xi \)-resilience measure of the network \(N=(V,E)\) as

$$\begin{aligned} \mu _{(\Gamma ,\xi )}(N)=1 - \sum _{k=1}^{\bar{k}}\theta _k\frac{ |\mathcal {P}^{(k)}_{\Gamma ,\xi } \cap \mathcal {P}_{short}|}{|\mathcal {P}^{(k)}\cap \mathcal {P}_{short}|}, \end{aligned}$$
(5)

where \(\theta _1, \dots , \theta _{\bar{k}}\) are appropriately selected to be nonnegative weights such that \(\sum _{k=1}^{\bar{k}}\theta _k=1\). We denote the vector of the weights by \(\Theta =(\theta _1, \dots , \theta _{\bar{k}})\). The selection of \(\Theta \) is implemented on the basis of the specific attention towards the different lengths of the paths when measuring the resilience of the network.

We observe that \(\mu _{(\Gamma ,\xi )}(N) \in [0,1]\) and it increases as the shocks propagate less easily over the network—so that, the network is more resilient. When \(\mu _{(\Gamma ,\xi )}(N)=1\) (\(\mu _{(\Gamma ,\xi )}(N)=0\), resp.), then the shock \(\xi \) is absorbed (the shock \(\xi \) propagates over all the paths, resp.).

2.1 Complexity test

The comparison between our proposal based on shortest paths and the approach of Cerqueti et al. (2019)—which takes into account all the paths—is associated to the discussion related to the complexity of the related algorithms. To face this relevant issue, we firstly provide a brief theoretical overview of the computational times in the two cases; then, we present an experiment supporting the theoretical side of the discussion.

The computation of all simple paths is well known to be a hard task (Fortune et al. 1980), while the set of the shortest paths is easy to compute since the time complexity is polynomial in the size n of a graph G (Ahuja et al. 1988).

Table 1 shows the comparisons between the computation of \(\mu _{(\Gamma ,\xi )}(N)\) when considering all the simple paths (as in Cerqueti et al. (2019)) and when computing only the shortest paths according to Eq. 5. The first column contains the type of network under examination, the second the cardinality of the set \(\mathcal {P}^{(k)}\), the third the value for \(\mu _{(\Gamma ,\xi )}(N)\) and the fourth the computational time when computing all the simple paths. The following three columns show the same results when computing all the shortest paths and, finally, the last column reports the percentage deviation \(\Delta _\mu \) between the two values of \(\mu _{(\Gamma ,\xi )}(N)\). The simulations have been performed on ten instances with \(\xi = 0.1\) and \(\delta = 1\). All the values in Table 1 are to be considered averaged over ten instances.

Since paths are the basic ingredient for our resilience measure, we followed the same general approach used in the analysis of shortest path problems (Demetrescu et al. 2009) and we tested the two versions of the measure on grid and random networks. For both we considered \(n=\{25, 50\}\) and \(w_{ij}\) randomly chosen in the set \(\{1, 2, \ldots , 10\}\). Finally, in the case of random networks, we considered the values of density as \(d = \{0.1, 0.2\}\).

From Table 1 we may notice that in all the simulations, as expected, the computational times for \(\mu _{(\Gamma ,\xi )}(N)\) considering all shortest paths outperform the other case. Note also that the gaps in the resilience measures \(\Delta _\mu \) are remarkably low (less than \(1\%\)), i.e. we can use the shortest paths at the cost of a small difference in the resilience measure.

It is worth noting that the negligible difference between the case of all paths and that of shortest paths was quite expected. Indeed, by definition, the shocks propagate more likely over the shortest paths than in the non shortest cases. In the considered situation, the percentage of the paths that are of non shortest nature and allowing the propagation of the shock is so small that the deviation between the resilience measures introduced in (5) and that in Cerqueti et al. (2019) is not that relevant.

Table 1 Result considering either the set of simple paths or the set of shortest paths in the \(\mu _{(\Gamma ,\xi )}(N)\) calculation for benchmark networks (averaged over 10 instances)

3 The interbanking network model

The financial context here considered is taken from the interbanking system and data are retrieved by the BIS web site database (BIS database www.bis.org). In particular, we refer to the activities associated to the consolidated banking statistics (CBS) and to the Locational Banking Statistics (LBS) of all the available countries (see the details in the Appendix).

The CBS captures the worldwide consolidated positions of internationally active banking groups headquartered in reporting countries. The CBS include the business of banks’foreign affiliates but exclude intragroup positions, similarly to the consolidation approach followed by banking supervisors.

The LBS provide information about the currency composition of banks’balance sheets and the geographical distribution of their counterparties. The LBS capture the outstanding financial assets and liabilities of internationally active banks located in reporting countries against counterparties residing in more than 200 countries.Footnote 1

The CBS and LBS data present different characteristics, even if they are associated to the same interbanking context. In our study, we consider the analysis conducted on LBS as a robustness check on the results obtained for CBS. We explain the reasoning behind this approach.

One of the reasons for preferring CBS is that consolidated statistics seems to be better suited for representing a risk-propagation scenario at aggregated level (Tonzer 2015). Moreover, taking into account the nationality of banks, rather than for instance their residency, could be deemed as a prudential way to involve countries in the process of risk propagation, especially considering the fact that BIS networks suffer of missing links by construction. Furthermore, consolidated data seem to be apt for research efforts that do not include an explicit geographical/spatial dimension as in our analysis.

Nonetheless, some authors argues that LBS display some advantages with respect to CBS such as available cross-border bank capital flows data, exchange rate adjusted flow data and a longer time window (Minoiu et al. 2015; Minoiu and Reyes 2013; Tonzer 2015). For these reasons we repeat stress tests on the LBS dataset and compare it to the CBS dataset, in terms of our indicator \(\mu \), in order to understand whether the resilience displayed by CBS data is affected by the consolidation.

The considered datasets deal with banking groups in terms of hosting or residence countries, so that banks are intuitively associated to countries. Therefore, for both CBS and LBS networks, we take countries as nodes in the set \(V=\{1, \dots , n\}\).

We assume that the weight \(w_{ij}\) is based on the aggregated bank exposures \(\alpha _{ij}\)—expressed in billions of dollars—of the banking groups headquartered in country i to the ones of country j. Specifically, we consider \(w_{ij}=\alpha _{ij}\), for each \(i,j \in V\).

We present quarterly data, ranging from the first quarter of 2005 to the fourth quarter of 2020. Thus, we have 64 networks—one network for each quarter. The number of nodes and links varies over the periods: for CBS network, nodes range from 202 to 215 (210.05 on average) and links from 1922 to 2882 (2448.78 on average); for LBS networks, nodes range from 209 to 213 (211.72 on average) and links from 2688 to 4942 (3864.72 on average).

For the sake of completeness, consider that countries in the dataset are divided in three different classes (Bongini et al. 2018): (i) the core, which considers the 26 reporting countries that have both incoming and outgoing exposure of international financial claims to the BIS (note that we report the actual number since countries have been added over the years); (ii) the 10 global systemically (GS) countries where at least one G-SIB bank is headquartered;Footnote 2 (iii) the periphery, which considers those countries where only inflow is available. Figures 1 and 2 show the network of the fourth quarter of 2020 for CBS and LBS, respectively, while Figs. 3 and 4 illustrate the network of the GS elements in the same quarter for CBS and LBS, respectively.

Fig. 1
figure 1

Network of core elements (i.e. reporting countries) for the CBS fourth quarter of 2020. The existence of a link represents a positive cross-border exposure \(\alpha _{ij}\) between the two nodes ij

Fig. 2
figure 2

Network of core elements (i.e. reporting countries) for the LBS fourth quarter of 2020. Also in this case, the existence of a link captures a positive cross-border exposure \(\alpha _{ij}\) between the two nodes ij

Fig. 3
figure 3

Network of GS elements (i.e. countries where at least one global systemically important bank has its headquarter) for the CBS fourth quarter of 2020. Also in this case, the existence of a link captures a positive cross-border exposure \(\alpha _{ij}\) between the two nodes ij.

Fig. 4
figure 4

Network of GS elements (i.e. countries where at least one global systemically important bank has its headquarter) for the LBS fourth quarter of 2020. Also in this case, the existence of a link captures a positive cross-border exposure \(\alpha _{ij}\) between the two nodes ij

Table 2 reported in Appendix shows the lists of core and GS countries. Such countries share a high number of links (see Figs. 1, 2, 3, and 4 in both of cases of CBS and LBS and for a temporal instance), meaning that—under a purely topological perspective, i.e. in the unweighted case—the corresponding network structure has a local density considerably higher than the rest of the network. For this reason, the topological structure of the BIS networks is considered to be of core-periphery type.

Table 2 List of core countries in 2020

Interestingly, in the case of core-periphery strucures, network resilience has some peculiar characteristics that are worth mentioning (Cinelli et al. 2017). Indeed, in case of classical error and attack tolerance analysis, such networks are considered to be more resilient because of the presence of an high global cohesion, predominantly in the core. On the other hand, such networks are typically characterised by smaller values of the diameter, thus propagation towards other nodes is more likely to occur. Of course, the presence of the weights might lead to a departure of the weighted network from the topological core-periphery structure. However, the arguments above may be viewed as a support of the worthiness of our study.

In Fig. 5 we show the in-degree and the out-degree distributions for CBS and LBS networks, respectively, as yearly boxplots, throughout the observation period. Implicitly, such distributions provide a confirmation of the topological core-periphery structure. Indeed, despite the shapes of the two distributions the values of y-axis differ due to the fact that—as already mentioned above—the peripheral countries report only inflow. We observe, with reference to the out-degree, a high number of banks/countries that do not have exchanges. This is due to the fact that the reporting countries make up a limited subset and some of the null values in the out-degree may be referred to the database incompleteness rather than to an absence of activity.

Finally, the out-degree shows remarkable fluctuations on the high values and data outlines the preferential exposure towards a limited number of banks/countries, with fluctuating exceptions.

Fig. 5
figure 5

Top panels: yearly distributions of in-degree (left) and out-degree (right) for CBS networks. Bottom panels: yearly distributions of in-degree (left) and out-degree (right) for LBS networks. In the out-degree distributions nodes with null out-degree values (peripheral elements) are filtered out

Fig. 6
figure 6

Measures for the \(\Gamma -\xi \)-resilience \(\mu _{(\Gamma ,\xi )}(N)\) in the case of CBS networks for \(\Gamma = \{\gamma _i = 1, i = 1, \ldots , \bar{k}\}\) and \(\Theta = \{\theta _i = 1/\bar{k}\), for \(i = 1, \ldots , \bar{k}\}\). Different values of \(\xi \) are reported on x-axis (as index of the vector), years on y-axis and values of \(\mu _{(\Gamma ,\xi )}(N)\) on z-axis. (\(0.1 \le \delta \le 0.75\))

Fig. 7
figure 7

Measures for the \(\Gamma -\xi \)-resilience \(\mu _{(\Gamma ,\xi )}(N)\) in the case of CBS networks for \(\Gamma = \{\gamma _i = 1, i = 1, \ldots , \bar{k}\}\) and \(\Theta = \{\theta _i = 1/\bar{k}\), for \(i = 1, \ldots , \bar{k}\}\). Different values of \(\xi \) are reported on x-axis (as index of the vector), years on y-axis and values of \(\mu _{(\Gamma ,\xi )}(N)\) on z-axis. (\(1 \le \delta \le 10\))

Fig. 8
figure 8

Measures for the \(\Gamma -\xi \)-resilience \(\mu _{(\Gamma ,\xi )}(N)\) in the case of CBS networks for \(\Gamma = \{\gamma _i = 1, i = 1, \ldots , \bar{k}\}\) and \(\Theta = \{\theta _i = 1/\bar{k}\), for \(i = 1, \ldots , \bar{k}\}\). Different values of \(\xi \) are reported on x-axis (as index of the vector), years on y-axis and values of \(\mu _{(\Gamma ,\xi )}(N)\) on z-axis. (\(20 \le \delta \le 50\))

Fig. 9
figure 9

Measures for the \(\Gamma -\xi \)-resilience \(\mu _{(\Gamma ,\xi )}(N)\) in the case of LBS networks for \(\Gamma = \{\gamma _i = 1, i = 1, \ldots , \bar{k}\}\) and \(\Theta = \{\theta _i = 1/\bar{k}\), for \(i = 1, \ldots , \bar{k}\}\). Different values of \(\xi \) are reported on x-axis (as index of the vector), years on y-axis and values of \(\mu _{(\Gamma ,\xi )}(N)\) on z-axis. (\(0.1 \le \delta \le 0.75\))

Fig. 10
figure 10

Measures for the \(\Gamma -\xi \)-resilience \(\mu _{(\Gamma ,\xi )}(N)\) in the case of LBS networks for \(\Gamma = \{\gamma _i = 1, i = 1, \ldots , \bar{k}\}\) and \(\Theta = \{\theta _i = 1/\bar{k}\), for \(i = 1, \ldots , \bar{k}\}\). Different values of \(\xi \) are reported on x-axis (as index of the vector), years on y-axis and values of \(\mu _{(\Gamma ,\xi )}(N)\) on z-axis. (\(1 \le \delta \le 10\)).

Fig. 11
figure 11

Measures for the \(\Gamma -\xi \)-resilience \(\mu _{(\Gamma ,\xi )}(N)\) in the case of LBS networks for \(\Gamma = \{\gamma _i = 1, i = 1, \ldots , \bar{k}\}\) and \(\Theta = \{\theta _i = 1/\bar{k}\), for \(i = 1, \ldots , \bar{k}\}\). Different values of \(\xi \) are reported on x-axis (as index of the vector), years on y-axis and values of \(\mu _{(\Gamma ,\xi )}(N)\) on z-axis. (\(20 \le \delta \le 50\)).

Fig. 12
figure 12

Correlation matrix between the time series (ranging in each period from 2005 to 2020) of \(\mu \) computed using CBS and LBS data across the parameter space. Since the parameter \(\xi \) is a function of \(w_{min}\) we considered its rank values.

4 Results and discussion

Herein we consider the analysis of the 64 BIS networks. They were built considering the CBS and LBS dataset fetched using the BIS API and cleaned from artifacts not regarding our purposes (e.g., rows containing summary data). The data processing, the network analysis and all simulations were conducted using the software R (R Core Team 2014) with the igraph package (Csardi and Nepusz 2006).

Equation (5) has been implemented through an algorithm which takes the network N, the values of \(\xi \) and \(\delta \) and of the components \(\Gamma \) and \(\Theta \) as inputs.

Some scenarios for the values of \(\xi \) and \(\delta \) and a peculiar setting for \(\Gamma \) and \(\Theta \) are considered, to include a large number of cases in the analysis of the resilience. Specifically, we take \(\xi _i = (w_{min} *2^{10-i})^{-1}\) with \(w_{min}\) as the lowest link weight over all the 64 instances and \(i = 1, 2, \ldots , 10\); thus, the parameter space is: for CBS networks \(\xi \in \{0.0021, 0.0043, 0.0087, 0.0174, 0.03498, 0.0699, 0.1399, 0.2798, 0.5597, 1.1195\}\); for LBS \(\xi \in \{0.0049, 0.0098, 0.0197, 0.0394, 0.0788, 0.1576, 0.3153, 0.6307, 1.2615, 2.5231\}\); and \(\delta \in \{0.1, 0.25, 0.5, 0.75, 1, 2, 5, 10, 20, 50\}\). Summarising, we performed 100 computations for each of the CBS as well as for the LBS networks.

The highest values of \(\xi \) has been chosen in order to be greater than the diameter \(\bar{k}\). Needless to say, \(\bar{k}\) is taken as the maximum diameter of the 64 considered networks.

Regarding the setting for \(\Gamma \) and \(\Theta \), we considered \(\Gamma = \{\gamma _i = 1, i = 1, ..., \bar{k}\}\) and \(\Theta = \{\theta _i = 1/\bar{k}\), for \(i = 1, \ldots , \bar{k}\}\). The former setting is associated to low propagation thresholds, so that a large number of shocks propagate. This condition can be seen as a prudential one, in that it avoids an a-priori mechanical removal of the effects of the shocks; the latter one considers uniform values of the \(\theta \)’s, hence leading to a fair evaluation of all the terms contributing in the definition of the resilience measure \(\mu _{(\Gamma ,\xi )}(N)\).

Figures 6, 7 and 8 report the values of \(\mu _{(\Gamma ,\xi )}(N)\) for the CBS data, for every quarter and for each value of \(\xi \), when considering all the values of \(\delta \), namely \(\delta \in \{0.1, 0.25, 0.5, 0.75, 1, 2, 5, 10, 20, 50\}\). According to the selected values of \(\delta \), by merging the three figures we have ten panels.

As intuition suggests, we can generally say that the resilience of the networks decreases with respect to \(\xi \). Indeed, by definition, a high value of the size \(\xi \) leads to an easier propagation of the shock.

We also notice the existence of a critical threshold of \(\xi \) above which we have the minimum level of resilience before year 2014—the year following the Lehman Brothers failure and its consequences; this threshold reasonably decreases with respect to \(\delta \), so that a strong reduction of the shocks propagation over the paths—i.e., small values of \(\delta \)—is associated to the propagation of shocks of large entity—i.e., shocks whose size is above the mentioned critical threshold.

Furthermore, the general level of the resilience measure decreases as \(\delta \) increases. This outcome is due to the role of \(\delta \) in the shock propagation process. Specifically, as \(\delta \) increases, the propagation of the shock over a given path becomes more probable; thus, \(|\mathcal {P}^{(k)}_{\Gamma ,\xi } \cap \mathcal {P}_{short}|\) increases while \(|\mathcal {P}^{(k)} \cap \mathcal {P}_{short}|\) remains constant, which implies that the resilience measure in (5) decreases.

In the extreme case of \(\delta = 0.1\)—top-left panel in Fig. 6—the resilience attains values around the theoretical maximum for small values of \(\xi \); moreover, the resilience surface does not show remarkable deviations across the years in this case. For high values of \(\delta \)—more evidently in the bottom panels of Figs. 7 and 8—the resilience measure is close to zero for large values of \(\xi \). This said, we observe a more scattered situation from 2017 to 2020, where one has traces of resilience—with resilience measure slightly greater than zero—also when \(\xi =10\). Interestingly, there is a resilience peak in 2008 when \(\delta >1\)— i.e., when the shock is amplified as the distance from the shocked node increases. This resilience peak is associated to the year of the Lehman Brothers’ failure—hence, to the relevant global financial crisis related to this catastrophic event. Such an outcome can be explained by the amplification of the cohesiveness of the network in correspondence of the financial distress; this is in agreement with the stylized fact that economic actors are more correlated in situations of economic turmoil.

For average values of \(\delta \)—see the bottom panels of Figs. 6 and 7—we observe a collapse of the resilience measure in the triennium 2009–2012—i.e., after the Lehman Brothers’ failure. The relevance of such a collapse with respect to the adjacent years 2008 and 2013 is more evident for \(0.5 \le \delta \le 5\). This is the period where the world experienced the consequences of the financial turmoil of 2008, with a lower level of interbanking exposures among countries that is associated to a lower capability of the network to absorb shocks in a post-financial crisis.

The turbulence of the financial world registered from 2014—with the Russian and Chinese market crashes and the bad performance of the global stock markets in 2018—is associated to the stronger interbanking relationships, hence leading to higher levels of the resilience measure after 2014. This argument is stressed in 2020—i.e., in the dramatic socio-financial crisis generated by the COVID-19 pandemic—where we have the highest level of resilience, also in accord to the case of 2008.

Furthermore, we observe that the resilience of the network decreases with the value of \(\delta \). This outcome is in line with the role of the discount factor \(\delta \) in the propagation of the shocks, and it represents a confirmation of the finding of our model. In this respect, the effect of \(\delta \) on the resilience seems to be of remarkable relevance, mainly around the corner cases of \(\delta =0\) and \(\delta =1\). More interesting patterns are observed for fair values of \(\delta \)—i.e., for \(\delta =0.4, 0.5\), see Fig. 6. Indeed, in these cases, there is a collapse of the resilience around year 2014, after the period 2009–2013 of high resilience. The resilient period 2009–2013 corresponds to the one immediately following the Lehman Brothers’ bankruptcy; hence, one can argue that the lowest level of interbanking exposures among countries is associated to a high capability of the network to absorb shocks in a post-financial crisis starting event period.

The results of the simulations of the LBS are reported in Figs. 9, 10, and 11. In general, we find a good agreement between the CBS and LBS across the parameter space, with the LBS networks slightly more resilient than the CBS ones and the flattening of the peaks in 2008 and 2020 in the LBS case. The robustness of the results is certified also by means of the Pearson’s correlation between the time series of the indicator \(\mu \) over CBS and LBS dataset for each value of \(\delta \) and \(\xi \)—see Fig. 12.

5 Conclusions

This paper proposes a novel resilience measure for networks that ranges in the unitary interval. Such a measure represents a relevant extension of the one proposed in Cerqueti et al. (2019). In particular, the computational complexity of the original measure has been removed by reasonably assuming—as in the cases of financial contagion—that shocks propagate over the shortest paths.

The introduced methodological device is tested over two meaningful networks built using the BIS database—with specific reference to the CBS data—of the interbank exposures gathered accordingly to the countries of the banks’ headquarters. As robustness check, we also consider the networks built on the basis of the LBS data. The database is a precious source of information in that it provides evidence for the core-periphery structure of lending among banks worldwide, in line with previous results (see e.g. Cinelli et al. 2021 or Kojaku et al. 2018). The considered model provides insights on the evolution of network resilience in different time periods. Several scenarios for the empirical analysis have been presented and discussed.

The dependence of the resilience on the size of the shock and on the presence of a distance-based mitigating/amplifying term of the propagation has been also detected. In so doing, the employed resilience measure represents—at least in the treated cases—is a suitable instrument for assessing the stability of the financial system. Importantly, the empirical experiments offer a resilience measure of the BIS network which takes into full consideration some important financial crises of the 2000’s, including the one started with the Lehman Brothers’ failure in 2008 and the financial distress generated by the COVID-19 pandemic in 2020.

Results suggest that a high level of interbank exposures is able to immunize a system from the shocks in financial distress, while weakly interconnected banks generate a system of countries with a scarce attitude to absorb external shocks in presence of a financial turmoil. A possible interpretation of this outcome lies in the herd immunity against financial crisis of countries which are strongly linked through the banking system. Once such a link becomes weak enough, then the situation is reverted and countries are particularly sensitive to the contagion as financial distress appears.

Under a purely methodological perspective, the measure herein introduced can be considered also as a general tool that can be applied to networks belonging to other financial contexts for measuring systemic risk. This aspect opens the field for future applications in other financial domains. The analysis performed with our method could be also used in order to identify the features of the shocks which are correlated with the resilience of the network, possibly suggesting countermeasures in order to build more resilient financial systems.