# Role of Recovery in Evolving Protection against Systemic Risk: A Mechanical Perspective in Network-Agent Dynamics

Authors: Chulwook Park
Journal: Complexity
 (2021)

---

## Abstract

We propose a model of evolving protection against systemic risk related to recovery. Using the failure potential in network-agent dynamics, we present a process-based simulation that provides insights into alternative interventions and their mechanical uniqueness. The fundamental operating principle of this model is that computation allows greater emphasis on optimizing the recovery within the general regularity of random network dynamics. The rules and processes that are used here could be regarded as useful techniques in systemic risk measurement relative to numerical failure reduction analyses.


---

## Body

## 1. Introduction

### 1.1. Background

Various contemporary studies have argued that systemic risk and abrupt failure events are related to the highly interconnected systems and networked structures created by agents [1]. Based on a simple set of properties, observations derived from several models indicate that the proportion of protection between nodes in the network can be described as a probability. This is related to how systemic risk should be coped with rather than simply predicting it based on the probability of failure (e.g., a failed bank in a financial system, asymptomatic transmission of a disease, and cognitive bias in decision-making). The risk of propagation is higher than that of independent failure events, extending to interdependent ones, which we refer to as cascading failures among system components [2]. Many scenarios that arise in simulations should be regarded not as indicating uncertainty or mistakes but rather as the consequences of inappropriate settings and interactions. In particular, proper protection against systemic risk with system components can be evolved heuristically through strategy dynamics (social learning and exploration) as a potential means of limiting failure. The present model expands this concept to investigate nonlinear randomness effects due to delayed responses, which may result in sensitivity to small changes that are difficult to prepare or manage [3]. To assess the profound implications that this approach may have for our understanding of dynamic behavior, including protection processes, this study investigates the influence of the necessary heuristics through which a proper response could mediate risk diffusion before a system completely fails [4], as discussed below.


### 1.2. Literature Review

By investigating how the complexity of networked structures underpins real-world systemic phenomena, various simulation studies have identified implications for individual robustness, the propagation of systemic risk, protection flow, and collective behavior across networks [5]. A distinguishing feature of such phenomena is that they emerge from the complex interactions among individual elements in a system or from their associations with each other [3]. The effect of context-varying mechanical flux on a system’s risk is highly complex. The possibility of quantifying such a risk needs to be evaluated in consideration of the distortions and patterns of such effects [4]. The investigations involve a variety of information, e.g., social contacts that are favored as the infection and spreading route, which in turn can be used to infer the characteristics of the underlying networks [6]. As demonstrated by the existence history (e.g., the financial crisis in 2008, the outbreak of COVID-19 in 2019), a reproduction (i.e., failure, bias, or virus) varies greatly from individual to individual, which is generally believed to affect the spreading dynamics significantly [7]. Whether such individual inhomogeneity aggravates the outbreak is a challenging question, and the answer depends on the specific model [8, 9]. In particular, the connectivity patterns of individuals are key to understanding [10] how networks are structured and communicated with each other [11]. Other network properties that have been investigated include the concept of evolutionary dynamics, which helps characterize and understand the architecture of artificial systems in relation to the network properties [12]. As most tools for laying out networks are variants of an algorithm, it is difficult to use them to explore how the conditions of a network affect the network’s dynamics [13]. The assessment process can be used to make macroscale observations for input performance, while approaches for microscale evaluations to simultaneously obtain more detailed insights must be treated within the structure of the network itself [14]. Several studies have reported such structures in terms of both microscale (e.g., individual incentives and relative gain versus effort) and macroscale (e.g., institutional competition and central intervention) behavior. For example, evolutionary explanations of systemic risk demonstrate how optimal decision makers are constrained when creating biased estimates of their capability and show how individuals alter their strategies in response to perceptions of resource value [15]. Standard evolutionary models in complex environments show that potentially different biases in decision-making expose different experimental groups at different transition probabilities [16]. A recent study found that by employing strong mitigation (i.e., social distancing and isolation of confirmed cases as guided by risk diffusion testing) related to the different response strategies, an outbreak can be suppressed to levels below the normal critical care capacity [10]. Although a triggered cascade can evolve over a certain time scale (i.e., days), it can be mitigated with intervention by the central system [17]. Evidence from many nowcasting and forecasting estimates indicates that in the absence of prevention and control measures other than simply isolating the risk cases, the probability of continued transmission with the projected trajectory remains high (exponential growth of the number of infections) [7, 8]. Thus, there is an urgent need to reduce propagation rates and control the growth of this risk to reduce not only the peak demand on the system but also the total number of eventually affected individuals [18].


### 1.3. Gap Statement

The computational modeling technique shows no bridge between the dynamics of agent nodes (with the vertex as a fundamental element) and the emergent properties of failure in recovery [19] (note that “recovery” in the context of financial systemic risk often refers to the fraction of a loan that is recovered after the default of the counterparty; here, it refers to a different quantity called “recovery time delay” similar to the concept of intervention). Most tools for laying out networks are variants of an algorithm and hence cannot easily be used to explore how the conditions affect the dynamics of the network [20] owing to the following factors: (1) Many of them take the form of a theoretical explanatory insight constructed in response to a hypothetical assumption. (2) The type and number of individuals are arbitrary or left undefined. (3) Validation with respect to stylized mechanical parameters cannot explain their potential over-parameterization. (4) There is an extended transient or burn-in phase that is discarded before analysis [21]. (5) Most importantly, the time units for many of these models may have no clear interpretation. To address these issues, we extend the model to fit an estimation of macro-/microscale variables, such as protections and interventions. The assessment process can be used to make macro- or microscale observations of input performance, while approaches for improving the recovery delay and obtaining more detailed insights should be investigated in the structure of the network itself [22]. This requires the combination of large repositories to construct representations of trajectories that can be analyzed at different scales and from different perspectives [23]. Indeed, the mechanisms and serial algorithms that underpin our understanding of systemic risk in networked agents must be evaluated through various means. Accordingly, we can establish a common ground for the integration of knowledge and methodologies with consistent definitions and reconcile the approaches for studying networks from various fields, which will intuitively enable us to face all the difficulties and pitfalls that are inherent in interdisciplinary work.


### 1.4. Purpose

This study develops a modeling framework that can account for quantitative measurement in agented networks, allowing us to explore how the recovery time delay affects the risk potential in both macro- and microscale cases. To regard agent dynamics as a random network, this model follows the standard approach in agent-network modeling, where by default, a small event (agentn is hit by a shock at time t) can trigger the initial passage in a risk diffusion process. The mechanism tests the clear implications for different values of the interaction, including interruption, and how protection may be related to a set of interconnectedness with mitigation entities against failure potential, rather than solely focusing on cascading events.


### 1.5. Value

With the objectives of better risk assessment and effective risk reduction, this model will enable us to not only directly observe the spread of failure in agented network industries but also better understand how protection can be accomplished through intervention. This work is related to the mainstream of research that contributes to the discussion of systemic robustness.


## 1.1. Background

Various contemporary studies have argued that systemic risk and abrupt failure events are related to the highly interconnected systems and networked structures created by agents [1]. Based on a simple set of properties, observations derived from several models indicate that the proportion of protection between nodes in the network can be described as a probability. This is related to how systemic risk should be coped with rather than simply predicting it based on the probability of failure (e.g., a failed bank in a financial system, asymptomatic transmission of a disease, and cognitive bias in decision-making). The risk of propagation is higher than that of independent failure events, extending to interdependent ones, which we refer to as cascading failures among system components [2]. Many scenarios that arise in simulations should be regarded not as indicating uncertainty or mistakes but rather as the consequences of inappropriate settings and interactions. In particular, proper protection against systemic risk with system components can be evolved heuristically through strategy dynamics (social learning and exploration) as a potential means of limiting failure. The present model expands this concept to investigate nonlinear randomness effects due to delayed responses, which may result in sensitivity to small changes that are difficult to prepare or manage [3]. To assess the profound implications that this approach may have for our understanding of dynamic behavior, including protection processes, this study investigates the influence of the necessary heuristics through which a proper response could mediate risk diffusion before a system completely fails [4], as discussed below.


## 1.2. Literature Review

By investigating how the complexity of networked structures underpins real-world systemic phenomena, various simulation studies have identified implications for individual robustness, the propagation of systemic risk, protection flow, and collective behavior across networks [5]. A distinguishing feature of such phenomena is that they emerge from the complex interactions among individual elements in a system or from their associations with each other [3]. The effect of context-varying mechanical flux on a system’s risk is highly complex. The possibility of quantifying such a risk needs to be evaluated in consideration of the distortions and patterns of such effects [4]. The investigations involve a variety of information, e.g., social contacts that are favored as the infection and spreading route, which in turn can be used to infer the characteristics of the underlying networks [6]. As demonstrated by the existence history (e.g., the financial crisis in 2008, the outbreak of COVID-19 in 2019), a reproduction (i.e., failure, bias, or virus) varies greatly from individual to individual, which is generally believed to affect the spreading dynamics significantly [7]. Whether such individual inhomogeneity aggravates the outbreak is a challenging question, and the answer depends on the specific model [8, 9]. In particular, the connectivity patterns of individuals are key to understanding [10] how networks are structured and communicated with each other [11]. Other network properties that have been investigated include the concept of evolutionary dynamics, which helps characterize and understand the architecture of artificial systems in relation to the network properties [12]. As most tools for laying out networks are variants of an algorithm, it is difficult to use them to explore how the conditions of a network affect the network’s dynamics [13]. The assessment process can be used to make macroscale observations for input performance, while approaches for microscale evaluations to simultaneously obtain more detailed insights must be treated within the structure of the network itself [14]. Several studies have reported such structures in terms of both microscale (e.g., individual incentives and relative gain versus effort) and macroscale (e.g., institutional competition and central intervention) behavior. For example, evolutionary explanations of systemic risk demonstrate how optimal decision makers are constrained when creating biased estimates of their capability and show how individuals alter their strategies in response to perceptions of resource value [15]. Standard evolutionary models in complex environments show that potentially different biases in decision-making expose different experimental groups at different transition probabilities [16]. A recent study found that by employing strong mitigation (i.e., social distancing and isolation of confirmed cases as guided by risk diffusion testing) related to the different response strategies, an outbreak can be suppressed to levels below the normal critical care capacity [10]. Although a triggered cascade can evolve over a certain time scale (i.e., days), it can be mitigated with intervention by the central system [17]. Evidence from many nowcasting and forecasting estimates indicates that in the absence of prevention and control measures other than simply isolating the risk cases, the probability of continued transmission with the projected trajectory remains high (exponential growth of the number of infections) [7, 8]. Thus, there is an urgent need to reduce propagation rates and control the growth of this risk to reduce not only the peak demand on the system but also the total number of eventually affected individuals [18].


## 1.3. Gap Statement

The computational modeling technique shows no bridge between the dynamics of agent nodes (with the vertex as a fundamental element) and the emergent properties of failure in recovery [19] (note that “recovery” in the context of financial systemic risk often refers to the fraction of a loan that is recovered after the default of the counterparty; here, it refers to a different quantity called “recovery time delay” similar to the concept of intervention). Most tools for laying out networks are variants of an algorithm and hence cannot easily be used to explore how the conditions affect the dynamics of the network [20] owing to the following factors: (1) Many of them take the form of a theoretical explanatory insight constructed in response to a hypothetical assumption. (2) The type and number of individuals are arbitrary or left undefined. (3) Validation with respect to stylized mechanical parameters cannot explain their potential over-parameterization. (4) There is an extended transient or burn-in phase that is discarded before analysis [21]. (5) Most importantly, the time units for many of these models may have no clear interpretation. To address these issues, we extend the model to fit an estimation of macro-/microscale variables, such as protections and interventions. The assessment process can be used to make macro- or microscale observations of input performance, while approaches for improving the recovery delay and obtaining more detailed insights should be investigated in the structure of the network itself [22]. This requires the combination of large repositories to construct representations of trajectories that can be analyzed at different scales and from different perspectives [23]. Indeed, the mechanisms and serial algorithms that underpin our understanding of systemic risk in networked agents must be evaluated through various means. Accordingly, we can establish a common ground for the integration of knowledge and methodologies with consistent definitions and reconcile the approaches for studying networks from various fields, which will intuitively enable us to face all the difficulties and pitfalls that are inherent in interdisciplinary work.


## 1.4. Purpose

This study develops a modeling framework that can account for quantitative measurement in agented networks, allowing us to explore how the recovery time delay affects the risk potential in both macro- and microscale cases. To regard agent dynamics as a random network, this model follows the standard approach in agent-network modeling, where by default, a small event (agentn is hit by a shock at time t) can trigger the initial passage in a risk diffusion process. The mechanism tests the clear implications for different values of the interaction, including interruption, and how protection may be related to a set of interconnectedness with mitigation entities against failure potential, rather than solely focusing on cascading events.


## 1.5. Value

With the objectives of better risk assessment and effective risk reduction, this model will enable us to not only directly observe the spread of failure in agented network industries but also better understand how protection can be accomplished through intervention. This work is related to the mainstream of research that contributes to the discussion of systemic robustness.


## 2. Model (Process-Based Methodology)

The concept of network generation in this study is based on random processes, such as those described in graph theory [24]. Although an arbitrary construction cannot fully capture the local characteristics of individuals observed in real-world networks, everyone in the world is connected to everyone else through a chain of mutual acquaintances or even stronger relationships [25]. To examine the systemic risks that may result from failures originating and cascading on such contact networks, together with how the networked agents may be expected to protect themselves against failure cascades, we consider an agent-based systematic-risk model with evolving protection strategies that had been developed by Ulf Dieckmann at the International Institute for Applied Systems Analysis (IIASA). This model enables agent-based simulations [26], beginning with the simple assumption that pairs of nodes can be randomly connected by an edge with a given connection probability (Table 1). Using a parameter to evaluate the impact of risk on the networked agents, we can estimate the influence of primary risk along the structure as a general failure property [27]. Through scaling for the different evolutionary (Table 2) and nonevolutionary components (Table 3), each step computes a new entity and generates a new proportion in relation to the intervention [3] (Table 4).Table 1
Network property (two parameters).
Number of individuals (nodes)n∈ (1, ∞)Connection probability (degrees)dp∈ (0, 1)Table 2
Evolutionary part (four parameters).
Imitation probabilitypr∈ (0, 1)Selection intensitys∈ (0, 1)Exploration probabilitype∈ (0, 1)Normally distributed incrementσ∈ (0, 1)Table 3
Nonevolutionary part (five parameters).
Maintenancefm∈ (0, 1)Propagation probability for each nodepn∈ (0, 1)Propagation probability through each linkpl∈ (0, 1)Protection maximumpp,max∈ (0, 1)Reference pointcp,1/2∈ (0, 1)Table 4
Time-dependent part (four parameters).
Time periodst1∼∞Recovery rater_t1Recovery time delayt_r1∼10Realizationtt1∼100


### 2.1. Operating Principles

First, each agent is characterized by two values: capital and strategy. An agent that has lost all of its capital is regarded as failed. Initially, only one agent is given as failed. Each agent is assigned to a node of the network, which is given with a numbern of nodes, a connection probability pd, and a resultant adjacency matrix A. Second, at each time step, units of payoff (c) are added to each agent’s capital, of which fractions fm and fp are spent on maintenance and protection. The updated capital is expressed as 1+1−fm−fpc. Third, a failure potential can originate at each node with probability pn and can propagate through each link with probability pl. The system may reach one of the two states after the appearance of a random probability (initially failed node of pn through the link of pl) and before the second probability occurs. Each failed node with a failure potential becomes a failed node with probability pr according to the equation below. A failed node losses its capital and remains in a failed state for one time step pp=pp,max/1+cp,1/2/fpc. We can measure capital in units of cp,1/2 to obtain pp=pp,max/1+1/fpc. Fourth, each agent’s strategy values, namely, fp0 and fp1, are updated through social learning and exploration. Social learning represents the process of choosing a random role model with probability p and imitating the role model’s strategy. The probability of imitation is pi=1/1+exp−sΔc, where Δc is the difference between the role model’s capital and the focal agent’s capital and s is the selection intensity. Then, exploration is performed by altering a randomly chosen strategy with probability pe with a random value chosen from a normal distribution with mean 0 and standard deviation σefx|μ,σ2. The protection level for each agent is determined according to the heuristics fp=fp0+fp1C, where C is the eigenvector centrality of the graph, which is a measure of the inﬂuence of a node in a network. If A denotes the adjacency matrix of the graph, the eigenvector centrality or x must satisfy the equation Ax=λx, where the vector is normalized to 1. We can normalize this vector to a maximum value, which brings the vector components closer to 1; here, fp1 is important for the measurement of fp (note that we did not explicitly demonstrate this because it has been shown in a previous study [1]). The value for fp must be truncated to the interval (0, 1 − fm). Finally, the failure potential, which lasts for only one time step (r_t=1), is controlled by another variable, which we refer to as the recovery time delay (t_r∈0,∞). The details of these process-based mechanisms are presented below.


### 2.2. Process 1. Basic Properties of Created Networks

Individuals in this model are considered as vertices (nodes), and sets of two elements are drawn as a line (edge) connecting two vertices. Data are stored in the nodes, and the edges represent the connections between them, although they can also store data. The edges between the nodes can describe any connection (adjacency) between them (Figure1(a)). The nodes can contain any amount of data that is assigned to them, and the edges include the data of the strength of the connection they represent.Figure 1
Schematic representation of nodes and lines (a) and connectivity (b).
(a)(b)Connectivity is another essential property of this structure. A disconnected network has some vertices that cannot be reached by the edges from any other vertex (Figure1(b)).A disconnected network might have one vertex connected to no edges at all, or it might have two connected networks that have no connection between them. Similarly, a connected network has no disconnected vertices; thus, a metric called connectivity is used to describe a network as a whole, and it depends on the information being presented, usually identified by (n, d[p])]. Networks also have additional properties, i.e., edges can have a direction, such that a relationship between two nodes is only one-way and not reciprocal. However, in the present model, we used an undirected network, the edges of which have no direction, because in our case, edges are drawn between two individual nodes who have met; hence, all relationships being represented are reciprocal. Thus, the relationship created (network) is undirected and begins with edges randomly drawn between one pair of nodes at a time. For example, four nodes may have edges between them, as shown in Figure 2.Figure 2
Schematic representation of the edge list (a) and the adjacency list (b).
(a)(b)By contrast, if we take an adjacency matrix, we may consider the rows and columns of the matrix to be labeled by the vertices (nodes), giving us one, two, three, or four vertices here. We may use any actual labeling; here, we denote our adjacency matrix byA. The definition of our matrix is that an entry in rowm and column n is equal to 1 if there is an edge between m and n, and 0 otherwise:(1)Note that the adjacency matrix of a network contains all the information contained in that network. Similarly, note that the presented network is given a random appearance because of the way the computer generates the visuals. If the program was to run a second time, a different picture would be generated; however, regardless of how it is run, the same relationship holds between the vertices (nodes) and the edges (line), resulting in the same degrees:(2)The resultingm×n matrix is obtained as [A=Gn,pd], and any node (n) can be randomly linked to any other node. Because the collection of nodes influences the connection probability [pd∈0,1], the model investigates the distribution of the connection in the network (probability of degree) (Figure 3).Figure 3
Code book: generating the graph and a random regular d-graph.Figure4 is based on the standard representation in network theory. Note that the vertices have degree d [A=Gn,d]. This d-regular network has degree d for all vertices, and the resulting matrix can be compared to another well-known random network called the Erdös–Rényi network [28], obtained from [A=Gn,p], shown in Figure 5, where any node (n) can be randomly exposed to any other nodes, creating random connections.Figure 4
Prototype of a random regular network with its properties. The number of nodesn = 4 ∗ 4; connection degree (probability) d = 15 (b) and d = 4 (a). For each section, the plots of the left-hand side show the random (regular) network that was created. The circles represent nodes with an arbitrarily assigned label from 0 to 15, and each line represents a link. The plot on the right-hand side of each section shows the adjacency matrix with entries in row m and column n (either 1 (black) or 0 (white)).
(a)(b)Figure 5
Prototype of a random network with its properties. The number of nodesn = 16; connection probability p=0.937 (b) and p=0.25 (a). The plot on the left-hand side of each half of the figure shows the random (Erdös–Rényi) network that was created. Each node is represented by a circle, with an arbitrarily assigned label from 0 to 15, and each line represents a link. The plot on the right-hand side of each section shows the adjacency matrix with entries in row m and column n (either 1 (black) or 0 (white)).
(a)(b)Technically, with respect to the collection of nodes influenced by the connection probability [p∈0,1], it can be observed that both cases with a higher degree (on the right-hand side of the plots) show a higher probability of being connected to an agent. However, for simplicity, the model presents a random regular structure owing to the connection degree [d∈0,n−1] because the network has all vertices of a certain degree (the same connection probability). In general, various network types (e.g., institutions, firms, banks, food distributors, and supply chains) have ambiguous effects in relation to individual ties because they allow for different ways of diversifying risk; this is particularly true as they influence each other in the same procedure of originating strategies and distributing security [18]. This is considered in the literature to provide strong empirical evidence for a technical approach for comparison with another network (note the lattice and calculation of eigenvector_centrality (Table 5)) to obtain a simple numerical solution (Figure 6).Table 5
Numerical result for eigenvector_centrality [Ax=λx].
Nodei0123456789101112131415d = 4 [p≈0.25]0.250.250.250.250.250.250.250.250.250.250.250.250.250.250.250.25p = 0.25 [d≈4]0.330.2370.1650.2070.3200.2230.1500.1710.2120.1000.3530.2270.3820.2310.1100.339d = random regular property obtained from Figure 4(a); p = random property obtained from Figure 5(a).Figure 6
Code book: create centrality.In the following section, analyses are conducted for the case of a random regular network such that agents within the strategy have the same level of diversification [17].


### 2.3. Process 2. Primary Risk Influence

Next, to observe the propagation process, the model uses an array (vector) to represent the probability of failure [p ∈ (0, 1)] with given initially influenced nodes (1 ≤ j ≤ N) denoted merely by (p_j). Each node can be in one of the two states: not failed or failed. All nodes are initially without failure.Extending the above output, given the failure dynamics, the following is obtained:(3)A=a11a12a21a22…a1n…a2n……am1am2………amna⟶1a⟶2…a⟶n=a11a⟶1+a12a⟶2+a21a⟶1+a22a⟶2+…a1na⟶n…a2na⟶n……am1a⟶1+am2a⟶2+………amna⟶n=Ba⟶=Ba⟶1Ba⟶2…Ba⟶n.That is, the states matrix:(4)Note that the matrix is denoted byBa⟶ instead of A because it no longer represents the adjacency matrix. Ba⟶ is continued to be labeled as rows and columns with values of 1 and 0; the key difference is the possibility of showing the state of each node (m: 1 = failure and 0 = absence of failure) according to the time step (n) (Figure 7).Figure 7
Code book: risk influence.In relation to the fundamental characteristic of the model, we stipulate that an individual (node) can fail if one of its neighbors is infected with failure through a network (Figure8). An elementary level of risk (or cascades of failure) depends on the co-occurrence of i and j of the nodes. This implies that individuals are more biased against other individuals that are highly linked in their network.Figure 8
Schematic description of failure with distribution. (a) The upper left-hand side plot represents the cumulative number of absences of failure (success) nodes from the initial (blue bar) and final (red bar) cases, and (b) the upper right-hand side plot represents the increasing number of failure nodes from the initial and final cases. The lower plots represent the probability distribution between the initial failure (blue) and the final failure (red), with the likelihood as the transitivity (yellow bar). Note that the influences of these failures are computed as the frequencies of the failure nodes in their initial and final states, i.e., as relative frequencies [fj=hj/N,hj=∑k=1,…,N;Xk=j1], where hj is the frequency of the failure state (j), and the proportion (percentage) of occurrences of failure in the statistical ensemble corresponds to the relative frequency.
(a)(b)Next, the probability of failure can be determined by the number of links from the node of the specification scaled byR/S. If we retain the individual characteristics as constant (K), R/S is equal to the risk (failure probability: p ∈ (0, 1)) as a function of the connectivity created by the connections (λx), and R is set to K/S. Nodes at lower (higher) links can be expected to have a lower (higher) connectivity to their risk. In other words, if we remove nodes from the network, the bias is reduced where the links are lower, even if they retain their individual characteristics throughout the process.


### 2.4. Process 3. Impose Protection against Systemic Risk

Along with the basic intuitions mentioned above, protection dynamics is also implemented. First, we divide the program into the subdynamics (payoff, failure, and strategy). Then, the result of each subdynamics is saved. These subdynamics are trivial problems that add complexity to the dynamics. To implement each of these, we use simple equations. These equations combine the previously computed variables with the newly added or computed variables, for example, a ⟶ store in the table, b ⟶ store in the table, a + b = c ⟶ lookup a, b ⟶ compute c, d ⟶ store in the table, a + d = e ⟶ lookup a, and d ⟶ compute e. In the example given in Figure 9, we use the values already stored in the table to compute new variables. This technique is often referred to as memorization (Figure 9).Figure 9
Code book: initial parameters.


#### 2.4.1. Payoff Dynamics

An agent is associated with each node and is characterized by its capital and strategy as follows: for each time step, each agent receives one unit of payoff, which is added to that agent’s capitalc, of which fractions fm and fp are spent on maintenance and protection, respectively; thus, the capital value is updated as 1+1−fm−fpc. We used an elementwise computation with arrays for vectorization (v⟶) instead of a loop:(5)fp=v⟶i=v⟶i1v⟶i2…v⟶in,fm=v⟶iiv⟶ii1v⟶ii2…v⟶iin,v⟶ii+−v⟶i=v⟶ii1+−v⟶i1v⟶ii2+−v⟶i2…v⟶v⟶iin+−v⟶in=v⟶iii1v⟶iii2…v⟶iiin,cv⟶iii1v⟶iii2…v⟶iiin=cv⟶iii1cv⟶iii2…cv⟶iiin=v⟶1v⟶2…v⟶n.The previous initial random network property is as follows:(6)Aa11a12a21a22…a1n…a2n……am1am2………amn+kAka11ka12ka21ka22…ka1n…ka2n……kam1kam2………kamn=B,k∈0,1.Thus, the applied output given the payoff dynamics becomes(7)B=b11b12b21b22…b1n…b2n……bm1bm2………bmnv⟶1v⟶2…v⟶n=b11v⟶1+b12v⟶2+…b1nv⟶nb21v⟶1+b22v⟶2+…b2nv⟶n………⋯……bm1v⟶1+bm2v⟶2+…bmnv⟶n=Bv⟶=Bv⟶1Bv⟶2…Bv⟶n,where the vector (v⟶  = payoff_dynamics) components are equal to matrix B. This product is equal to Bv⟶ (Figure 10).Figure 10
Code book: payoff dynamics.


#### 2.4.2. Failure Dynamics

The failure potential can originate at each node with probabilitypn∈0,1, and it also propagates along each link with probability pl∈0,1 at each time step. The failure potential turns into failure with probability 1−pp depending on the agent’s investment in protection: a possible choice is [pp=pp,max/1+cp,1/2/fpc], where protection (pp) is equal to the applied (saturation) function. Here, pp,max is a designated protection maximum, cp,1/2 denotes an allocated reference point, and fpc represents an evolutionary protection level multiplied by the updated capital:(8)pp=u⟶i=u⟶i1u⟶i2…w⟶in,fp=v⟶iv⟶i1v⟶i2…v⟶in,fpc=ccv⟶i1cv⟶i2…cv⟶in.The applied output given the failure dynamics is as follows:(9)B=b11b12b21b22⋯b1n⋯b2n⋯⋯bm1bm2⋯⋯⋯bmnu⟶1u⟶2…u⟶n=b11u⟶1+b12u⟶2+…b1nu⟶nb21u⟶1+b22u⟶2+…b2nu⟶n………………bm1u⟶1+bm2u⟶2+…bmnu⟶n=Bu⟶=Bu⟶1Bu⟶2…Bu⟶n,where the vector (u⟶  = failure_dynamics) components are equal to matrix B. This product is equal to Bu⟶. In this section, a prewritten function (regular) is used to create a short iterate 1 = D array for vectorization (u⟶) instead of using the adjacency matrix directly. This substitution shortens the loop. The failure lasts for one time step (default) and results in the loss of an agent’s capital (Figure 11).Figure 11
Code book: protection potential.


#### 2.4.3. Strategy Dynamics

Each agent chooses its protection level according to the heuristicsfp=fp0+fp1C truncated to the interval 0,1−fm:(10)v⟶⟶f⟶⟶fv⟶,fv⟶=0<fv⟶<0.9,fm=0.9,0<fv⟶<0.1,fm=0.1,v⟶|fp=fp0+fp1C.For initialization of the strategy values, two arrays are added for vectorization ((fp0=wi), (fp1C=Cwi)):(11)fp0=w⟶=w⟶1w⟶2…w⟶n,fp1C=Cw⟶Cw⟶1Cw⟶2…Cw⟶n,C∈0,1,where w⟶i1 is a vectorization as the designated strategy of fp0 and w⟶ii is a vectorization as the designated strategy of fp1, multiplied by the eigenvector centrality from the random graph (C), which is a measure of the centrality of the agent’s node, normalized to the interval 0,1:(12)fp0=w⟶i=w⟶i1w⟶i2…w⟶in,fp1C=Cw⟶iCw⟶i1Cw⟶i2…Cw⟶in,w⟶i+Cw⟶i=w⟶i1+Cw⟶i1w⟶i2+Cw⟶i2…w⟶in+Cw⟶in=fp=v⟶i1v⟶i2…v⟶in.The eigenvector centrality for node I isAx=λx, where A is the matrix of the network with eigenvalue λ. The strategy values fp0 and fp1 evolve through social learning and strategy exploration as follows: at each time step, each agent randomly chooses another agent as a role model with probability pr∈0,1 and imitates that agent’s strategy values with the following probability:(13)pi=1+e−ωΔπ−1,πr−πf=Δπ|πr=role model,where pI is the probability of acceptance of the role model for imitation, πf is the capital of the focal individual, πr is the capital of the role individual, e denotes the exponential, and ω is the intensity of the selection (ω < 1 = weak selection; ω∞ = strong selection). The focal individual imitates the strategy of the nearby role individual, comparing its new capital (large Δπ = large capital difference; small Δπ = small capital difference); then, the focal individual chooses to imitate the strategy of the role individual. In relation to this imitation, a temporary matrix is employed to avoid changing and using one matrix in the loop (Figure 12).Figure 12
Code book: imitation.Finally, at each time step, each agent with probabilitype∈0,1 randomly chooses one of its two strategy values and alters it with a normally distributed increment with mean 0 and the following standard deviation (Figure 13):(14)fx/μ,σ2=12πσ2exp−x−μ2/2σ2|x=individual capital,μ∈R=meanlocation,σ2>0=variancesquared scale.Figure 13
Code book: exploration.


### 2.5. Process 4. Reset Failure (and/or Protection) Potential

A failure lasts for one time step and results in the loss of an agent’s capital, according to the reset failure potential and/or failure, as follows:(15)randomn<r_t=1⟶1−pp=0,where randomn<rec=1 denotes randomly chosen individuals with a certain probability [randomn], and the failure potential of any individual is (1−pp), which is chosen according to a certain probability that approaches 0:(16)t_r<1=strong intervention,t_r⟶∞=weak intervention,t_r∈0,∞,By default, this recovery rate is implemented by resetting the failure potential after everyr_t=1 time step. At the same time, to control this intervention, we allowed the number of time steps to be controlled by another parameter (t_r∈0,∞), which represents the recovery time delay (Figure 14).Figure 14
Code book: recovery delay.


### 2.6. Mechanical Insight of the Programming

The broader objective of this step-by-step procedure is to show the computerized process underlying the fundamental mechanisms that are used. The Tables1–5 and matrix mentioned above account for the details of the rules and procedures (see Appendix 6 for details on the coding). In relation to the technical insights of the implementation, we present the details in Figure 15 that may interest program developers (Figure 15).Figure 15
Numerical results using a loop (left side) and an array (right side).The versions on the left- and right-hand sides in Figure15 represent vectorization using a loop and an array, respectively. Both versions are used in the development of our programming, as can be seen in the code book, which presents simple calculations. Specifically, following the step-by-step procedures of the operation, the version on the left-hand side can be recommended in general; however, it requires more time to simulate many individuals across time steps (see Output in Figure 15). Thus, in some dynamics implementations of models, we used the version on the right-hand side owing to its efficiency.


## 2.1. Operating Principles

First, each agent is characterized by two values: capital and strategy. An agent that has lost all of its capital is regarded as failed. Initially, only one agent is given as failed. Each agent is assigned to a node of the network, which is given with a numbern of nodes, a connection probability pd, and a resultant adjacency matrix A. Second, at each time step, units of payoff (c) are added to each agent’s capital, of which fractions fm and fp are spent on maintenance and protection. The updated capital is expressed as 1+1−fm−fpc. Third, a failure potential can originate at each node with probability pn and can propagate through each link with probability pl. The system may reach one of the two states after the appearance of a random probability (initially failed node of pn through the link of pl) and before the second probability occurs. Each failed node with a failure potential becomes a failed node with probability pr according to the equation below. A failed node losses its capital and remains in a failed state for one time step pp=pp,max/1+cp,1/2/fpc. We can measure capital in units of cp,1/2 to obtain pp=pp,max/1+1/fpc. Fourth, each agent’s strategy values, namely, fp0 and fp1, are updated through social learning and exploration. Social learning represents the process of choosing a random role model with probability p and imitating the role model’s strategy. The probability of imitation is pi=1/1+exp−sΔc, where Δc is the difference between the role model’s capital and the focal agent’s capital and s is the selection intensity. Then, exploration is performed by altering a randomly chosen strategy with probability pe with a random value chosen from a normal distribution with mean 0 and standard deviation σefx|μ,σ2. The protection level for each agent is determined according to the heuristics fp=fp0+fp1C, where C is the eigenvector centrality of the graph, which is a measure of the inﬂuence of a node in a network. If A denotes the adjacency matrix of the graph, the eigenvector centrality or x must satisfy the equation Ax=λx, where the vector is normalized to 1. We can normalize this vector to a maximum value, which brings the vector components closer to 1; here, fp1 is important for the measurement of fp (note that we did not explicitly demonstrate this because it has been shown in a previous study [1]). The value for fp must be truncated to the interval (0, 1 − fm). Finally, the failure potential, which lasts for only one time step (r_t=1), is controlled by another variable, which we refer to as the recovery time delay (t_r∈0,∞). The details of these process-based mechanisms are presented below.


## 2.2. Process 1. Basic Properties of Created Networks

Individuals in this model are considered as vertices (nodes), and sets of two elements are drawn as a line (edge) connecting two vertices. Data are stored in the nodes, and the edges represent the connections between them, although they can also store data. The edges between the nodes can describe any connection (adjacency) between them (Figure1(a)). The nodes can contain any amount of data that is assigned to them, and the edges include the data of the strength of the connection they represent.Figure 1
Schematic representation of nodes and lines (a) and connectivity (b).
(a)(b)Connectivity is another essential property of this structure. A disconnected network has some vertices that cannot be reached by the edges from any other vertex (Figure1(b)).A disconnected network might have one vertex connected to no edges at all, or it might have two connected networks that have no connection between them. Similarly, a connected network has no disconnected vertices; thus, a metric called connectivity is used to describe a network as a whole, and it depends on the information being presented, usually identified by (n, d[p])]. Networks also have additional properties, i.e., edges can have a direction, such that a relationship between two nodes is only one-way and not reciprocal. However, in the present model, we used an undirected network, the edges of which have no direction, because in our case, edges are drawn between two individual nodes who have met; hence, all relationships being represented are reciprocal. Thus, the relationship created (network) is undirected and begins with edges randomly drawn between one pair of nodes at a time. For example, four nodes may have edges between them, as shown in Figure 2.Figure 2
Schematic representation of the edge list (a) and the adjacency list (b).
(a)(b)By contrast, if we take an adjacency matrix, we may consider the rows and columns of the matrix to be labeled by the vertices (nodes), giving us one, two, three, or four vertices here. We may use any actual labeling; here, we denote our adjacency matrix byA. The definition of our matrix is that an entry in rowm and column n is equal to 1 if there is an edge between m and n, and 0 otherwise:(1)Note that the adjacency matrix of a network contains all the information contained in that network. Similarly, note that the presented network is given a random appearance because of the way the computer generates the visuals. If the program was to run a second time, a different picture would be generated; however, regardless of how it is run, the same relationship holds between the vertices (nodes) and the edges (line), resulting in the same degrees:(2)The resultingm×n matrix is obtained as [A=Gn,pd], and any node (n) can be randomly linked to any other node. Because the collection of nodes influences the connection probability [pd∈0,1], the model investigates the distribution of the connection in the network (probability of degree) (Figure 3).Figure 3
Code book: generating the graph and a random regular d-graph.Figure4 is based on the standard representation in network theory. Note that the vertices have degree d [A=Gn,d]. This d-regular network has degree d for all vertices, and the resulting matrix can be compared to another well-known random network called the Erdös–Rényi network [28], obtained from [A=Gn,p], shown in Figure 5, where any node (n) can be randomly exposed to any other nodes, creating random connections.Figure 4
Prototype of a random regular network with its properties. The number of nodesn = 4 ∗ 4; connection degree (probability) d = 15 (b) and d = 4 (a). For each section, the plots of the left-hand side show the random (regular) network that was created. The circles represent nodes with an arbitrarily assigned label from 0 to 15, and each line represents a link. The plot on the right-hand side of each section shows the adjacency matrix with entries in row m and column n (either 1 (black) or 0 (white)).
(a)(b)Figure 5
Prototype of a random network with its properties. The number of nodesn = 16; connection probability p=0.937 (b) and p=0.25 (a). The plot on the left-hand side of each half of the figure shows the random (Erdös–Rényi) network that was created. Each node is represented by a circle, with an arbitrarily assigned label from 0 to 15, and each line represents a link. The plot on the right-hand side of each section shows the adjacency matrix with entries in row m and column n (either 1 (black) or 0 (white)).
(a)(b)Technically, with respect to the collection of nodes influenced by the connection probability [p∈0,1], it can be observed that both cases with a higher degree (on the right-hand side of the plots) show a higher probability of being connected to an agent. However, for simplicity, the model presents a random regular structure owing to the connection degree [d∈0,n−1] because the network has all vertices of a certain degree (the same connection probability). In general, various network types (e.g., institutions, firms, banks, food distributors, and supply chains) have ambiguous effects in relation to individual ties because they allow for different ways of diversifying risk; this is particularly true as they influence each other in the same procedure of originating strategies and distributing security [18]. This is considered in the literature to provide strong empirical evidence for a technical approach for comparison with another network (note the lattice and calculation of eigenvector_centrality (Table 5)) to obtain a simple numerical solution (Figure 6).Table 5
Numerical result for eigenvector_centrality [Ax=λx].
Nodei0123456789101112131415d = 4 [p≈0.25]0.250.250.250.250.250.250.250.250.250.250.250.250.250.250.250.25p = 0.25 [d≈4]0.330.2370.1650.2070.3200.2230.1500.1710.2120.1000.3530.2270.3820.2310.1100.339d = random regular property obtained from Figure 4(a); p = random property obtained from Figure 5(a).Figure 6
Code book: create centrality.In the following section, analyses are conducted for the case of a random regular network such that agents within the strategy have the same level of diversification [17].


## 2.3. Process 2. Primary Risk Influence

Next, to observe the propagation process, the model uses an array (vector) to represent the probability of failure [p ∈ (0, 1)] with given initially influenced nodes (1 ≤ j ≤ N) denoted merely by (p_j). Each node can be in one of the two states: not failed or failed. All nodes are initially without failure.Extending the above output, given the failure dynamics, the following is obtained:(3)A=a11a12a21a22…a1n…a2n……am1am2………amna⟶1a⟶2…a⟶n=a11a⟶1+a12a⟶2+a21a⟶1+a22a⟶2+…a1na⟶n…a2na⟶n……am1a⟶1+am2a⟶2+………amna⟶n=Ba⟶=Ba⟶1Ba⟶2…Ba⟶n.That is, the states matrix:(4)Note that the matrix is denoted byBa⟶ instead of A because it no longer represents the adjacency matrix. Ba⟶ is continued to be labeled as rows and columns with values of 1 and 0; the key difference is the possibility of showing the state of each node (m: 1 = failure and 0 = absence of failure) according to the time step (n) (Figure 7).Figure 7
Code book: risk influence.In relation to the fundamental characteristic of the model, we stipulate that an individual (node) can fail if one of its neighbors is infected with failure through a network (Figure8). An elementary level of risk (or cascades of failure) depends on the co-occurrence of i and j of the nodes. This implies that individuals are more biased against other individuals that are highly linked in their network.Figure 8
Schematic description of failure with distribution. (a) The upper left-hand side plot represents the cumulative number of absences of failure (success) nodes from the initial (blue bar) and final (red bar) cases, and (b) the upper right-hand side plot represents the increasing number of failure nodes from the initial and final cases. The lower plots represent the probability distribution between the initial failure (blue) and the final failure (red), with the likelihood as the transitivity (yellow bar). Note that the influences of these failures are computed as the frequencies of the failure nodes in their initial and final states, i.e., as relative frequencies [fj=hj/N,hj=∑k=1,…,N;Xk=j1], where hj is the frequency of the failure state (j), and the proportion (percentage) of occurrences of failure in the statistical ensemble corresponds to the relative frequency.
(a)(b)Next, the probability of failure can be determined by the number of links from the node of the specification scaled byR/S. If we retain the individual characteristics as constant (K), R/S is equal to the risk (failure probability: p ∈ (0, 1)) as a function of the connectivity created by the connections (λx), and R is set to K/S. Nodes at lower (higher) links can be expected to have a lower (higher) connectivity to their risk. In other words, if we remove nodes from the network, the bias is reduced where the links are lower, even if they retain their individual characteristics throughout the process.


## 2.4. Process 3. Impose Protection against Systemic Risk

Along with the basic intuitions mentioned above, protection dynamics is also implemented. First, we divide the program into the subdynamics (payoff, failure, and strategy). Then, the result of each subdynamics is saved. These subdynamics are trivial problems that add complexity to the dynamics. To implement each of these, we use simple equations. These equations combine the previously computed variables with the newly added or computed variables, for example, a ⟶ store in the table, b ⟶ store in the table, a + b = c ⟶ lookup a, b ⟶ compute c, d ⟶ store in the table, a + d = e ⟶ lookup a, and d ⟶ compute e. In the example given in Figure 9, we use the values already stored in the table to compute new variables. This technique is often referred to as memorization (Figure 9).Figure 9
Code book: initial parameters.


### 2.4.1. Payoff Dynamics

An agent is associated with each node and is characterized by its capital and strategy as follows: for each time step, each agent receives one unit of payoff, which is added to that agent’s capitalc, of which fractions fm and fp are spent on maintenance and protection, respectively; thus, the capital value is updated as 1+1−fm−fpc. We used an elementwise computation with arrays for vectorization (v⟶) instead of a loop:(5)fp=v⟶i=v⟶i1v⟶i2…v⟶in,fm=v⟶iiv⟶ii1v⟶ii2…v⟶iin,v⟶ii+−v⟶i=v⟶ii1+−v⟶i1v⟶ii2+−v⟶i2…v⟶v⟶iin+−v⟶in=v⟶iii1v⟶iii2…v⟶iiin,cv⟶iii1v⟶iii2…v⟶iiin=cv⟶iii1cv⟶iii2…cv⟶iiin=v⟶1v⟶2…v⟶n.The previous initial random network property is as follows:(6)Aa11a12a21a22…a1n…a2n……am1am2………amn+kAka11ka12ka21ka22…ka1n…ka2n……kam1kam2………kamn=B,k∈0,1.Thus, the applied output given the payoff dynamics becomes(7)B=b11b12b21b22…b1n…b2n……bm1bm2………bmnv⟶1v⟶2…v⟶n=b11v⟶1+b12v⟶2+…b1nv⟶nb21v⟶1+b22v⟶2+…b2nv⟶n………⋯……bm1v⟶1+bm2v⟶2+…bmnv⟶n=Bv⟶=Bv⟶1Bv⟶2…Bv⟶n,where the vector (v⟶  = payoff_dynamics) components are equal to matrix B. This product is equal to Bv⟶ (Figure 10).Figure 10
Code book: payoff dynamics.


### 2.4.2. Failure Dynamics

The failure potential can originate at each node with probabilitypn∈0,1, and it also propagates along each link with probability pl∈0,1 at each time step. The failure potential turns into failure with probability 1−pp depending on the agent’s investment in protection: a possible choice is [pp=pp,max/1+cp,1/2/fpc], where protection (pp) is equal to the applied (saturation) function. Here, pp,max is a designated protection maximum, cp,1/2 denotes an allocated reference point, and fpc represents an evolutionary protection level multiplied by the updated capital:(8)pp=u⟶i=u⟶i1u⟶i2…w⟶in,fp=v⟶iv⟶i1v⟶i2…v⟶in,fpc=ccv⟶i1cv⟶i2…cv⟶in.The applied output given the failure dynamics is as follows:(9)B=b11b12b21b22⋯b1n⋯b2n⋯⋯bm1bm2⋯⋯⋯bmnu⟶1u⟶2…u⟶n=b11u⟶1+b12u⟶2+…b1nu⟶nb21u⟶1+b22u⟶2+…b2nu⟶n………………bm1u⟶1+bm2u⟶2+…bmnu⟶n=Bu⟶=Bu⟶1Bu⟶2…Bu⟶n,where the vector (u⟶  = failure_dynamics) components are equal to matrix B. This product is equal to Bu⟶. In this section, a prewritten function (regular) is used to create a short iterate 1 = D array for vectorization (u⟶) instead of using the adjacency matrix directly. This substitution shortens the loop. The failure lasts for one time step (default) and results in the loss of an agent’s capital (Figure 11).Figure 11
Code book: protection potential.


### 2.4.3. Strategy Dynamics

Each agent chooses its protection level according to the heuristicsfp=fp0+fp1C truncated to the interval 0,1−fm:(10)v⟶⟶f⟶⟶fv⟶,fv⟶=0<fv⟶<0.9,fm=0.9,0<fv⟶<0.1,fm=0.1,v⟶|fp=fp0+fp1C.For initialization of the strategy values, two arrays are added for vectorization ((fp0=wi), (fp1C=Cwi)):(11)fp0=w⟶=w⟶1w⟶2…w⟶n,fp1C=Cw⟶Cw⟶1Cw⟶2…Cw⟶n,C∈0,1,where w⟶i1 is a vectorization as the designated strategy of fp0 and w⟶ii is a vectorization as the designated strategy of fp1, multiplied by the eigenvector centrality from the random graph (C), which is a measure of the centrality of the agent’s node, normalized to the interval 0,1:(12)fp0=w⟶i=w⟶i1w⟶i2…w⟶in,fp1C=Cw⟶iCw⟶i1Cw⟶i2…Cw⟶in,w⟶i+Cw⟶i=w⟶i1+Cw⟶i1w⟶i2+Cw⟶i2…w⟶in+Cw⟶in=fp=v⟶i1v⟶i2…v⟶in.The eigenvector centrality for node I isAx=λx, where A is the matrix of the network with eigenvalue λ. The strategy values fp0 and fp1 evolve through social learning and strategy exploration as follows: at each time step, each agent randomly chooses another agent as a role model with probability pr∈0,1 and imitates that agent’s strategy values with the following probability:(13)pi=1+e−ωΔπ−1,πr−πf=Δπ|πr=role model,where pI is the probability of acceptance of the role model for imitation, πf is the capital of the focal individual, πr is the capital of the role individual, e denotes the exponential, and ω is the intensity of the selection (ω < 1 = weak selection; ω∞ = strong selection). The focal individual imitates the strategy of the nearby role individual, comparing its new capital (large Δπ = large capital difference; small Δπ = small capital difference); then, the focal individual chooses to imitate the strategy of the role individual. In relation to this imitation, a temporary matrix is employed to avoid changing and using one matrix in the loop (Figure 12).Figure 12
Code book: imitation.Finally, at each time step, each agent with probabilitype∈0,1 randomly chooses one of its two strategy values and alters it with a normally distributed increment with mean 0 and the following standard deviation (Figure 13):(14)fx/μ,σ2=12πσ2exp−x−μ2/2σ2|x=individual capital,μ∈R=meanlocation,σ2>0=variancesquared scale.Figure 13
Code book: exploration.


## 2.4.1. Payoff Dynamics

An agent is associated with each node and is characterized by its capital and strategy as follows: for each time step, each agent receives one unit of payoff, which is added to that agent’s capitalc, of which fractions fm and fp are spent on maintenance and protection, respectively; thus, the capital value is updated as 1+1−fm−fpc. We used an elementwise computation with arrays for vectorization (v⟶) instead of a loop:(5)fp=v⟶i=v⟶i1v⟶i2…v⟶in,fm=v⟶iiv⟶ii1v⟶ii2…v⟶iin,v⟶ii+−v⟶i=v⟶ii1+−v⟶i1v⟶ii2+−v⟶i2…v⟶v⟶iin+−v⟶in=v⟶iii1v⟶iii2…v⟶iiin,cv⟶iii1v⟶iii2…v⟶iiin=cv⟶iii1cv⟶iii2…cv⟶iiin=v⟶1v⟶2…v⟶n.The previous initial random network property is as follows:(6)Aa11a12a21a22…a1n…a2n……am1am2………amn+kAka11ka12ka21ka22…ka1n…ka2n……kam1kam2………kamn=B,k∈0,1.Thus, the applied output given the payoff dynamics becomes(7)B=b11b12b21b22…b1n…b2n……bm1bm2………bmnv⟶1v⟶2…v⟶n=b11v⟶1+b12v⟶2+…b1nv⟶nb21v⟶1+b22v⟶2+…b2nv⟶n………⋯……bm1v⟶1+bm2v⟶2+…bmnv⟶n=Bv⟶=Bv⟶1Bv⟶2…Bv⟶n,where the vector (v⟶  = payoff_dynamics) components are equal to matrix B. This product is equal to Bv⟶ (Figure 10).Figure 10
Code book: payoff dynamics.


## 2.4.2. Failure Dynamics

The failure potential can originate at each node with probabilitypn∈0,1, and it also propagates along each link with probability pl∈0,1 at each time step. The failure potential turns into failure with probability 1−pp depending on the agent’s investment in protection: a possible choice is [pp=pp,max/1+cp,1/2/fpc], where protection (pp) is equal to the applied (saturation) function. Here, pp,max is a designated protection maximum, cp,1/2 denotes an allocated reference point, and fpc represents an evolutionary protection level multiplied by the updated capital:(8)pp=u⟶i=u⟶i1u⟶i2…w⟶in,fp=v⟶iv⟶i1v⟶i2…v⟶in,fpc=ccv⟶i1cv⟶i2…cv⟶in.The applied output given the failure dynamics is as follows:(9)B=b11b12b21b22⋯b1n⋯b2n⋯⋯bm1bm2⋯⋯⋯bmnu⟶1u⟶2…u⟶n=b11u⟶1+b12u⟶2+…b1nu⟶nb21u⟶1+b22u⟶2+…b2nu⟶n………………bm1u⟶1+bm2u⟶2+…bmnu⟶n=Bu⟶=Bu⟶1Bu⟶2…Bu⟶n,where the vector (u⟶  = failure_dynamics) components are equal to matrix B. This product is equal to Bu⟶. In this section, a prewritten function (regular) is used to create a short iterate 1 = D array for vectorization (u⟶) instead of using the adjacency matrix directly. This substitution shortens the loop. The failure lasts for one time step (default) and results in the loss of an agent’s capital (Figure 11).Figure 11
Code book: protection potential.


## 2.4.3. Strategy Dynamics

Each agent chooses its protection level according to the heuristicsfp=fp0+fp1C truncated to the interval 0,1−fm:(10)v⟶⟶f⟶⟶fv⟶,fv⟶=0<fv⟶<0.9,fm=0.9,0<fv⟶<0.1,fm=0.1,v⟶|fp=fp0+fp1C.For initialization of the strategy values, two arrays are added for vectorization ((fp0=wi), (fp1C=Cwi)):(11)fp0=w⟶=w⟶1w⟶2…w⟶n,fp1C=Cw⟶Cw⟶1Cw⟶2…Cw⟶n,C∈0,1,where w⟶i1 is a vectorization as the designated strategy of fp0 and w⟶ii is a vectorization as the designated strategy of fp1, multiplied by the eigenvector centrality from the random graph (C), which is a measure of the centrality of the agent’s node, normalized to the interval 0,1:(12)fp0=w⟶i=w⟶i1w⟶i2…w⟶in,fp1C=Cw⟶iCw⟶i1Cw⟶i2…Cw⟶in,w⟶i+Cw⟶i=w⟶i1+Cw⟶i1w⟶i2+Cw⟶i2…w⟶in+Cw⟶in=fp=v⟶i1v⟶i2…v⟶in.The eigenvector centrality for node I isAx=λx, where A is the matrix of the network with eigenvalue λ. The strategy values fp0 and fp1 evolve through social learning and strategy exploration as follows: at each time step, each agent randomly chooses another agent as a role model with probability pr∈0,1 and imitates that agent’s strategy values with the following probability:(13)pi=1+e−ωΔπ−1,πr−πf=Δπ|πr=role model,where pI is the probability of acceptance of the role model for imitation, πf is the capital of the focal individual, πr is the capital of the role individual, e denotes the exponential, and ω is the intensity of the selection (ω < 1 = weak selection; ω∞ = strong selection). The focal individual imitates the strategy of the nearby role individual, comparing its new capital (large Δπ = large capital difference; small Δπ = small capital difference); then, the focal individual chooses to imitate the strategy of the role individual. In relation to this imitation, a temporary matrix is employed to avoid changing and using one matrix in the loop (Figure 12).Figure 12
Code book: imitation.Finally, at each time step, each agent with probabilitype∈0,1 randomly chooses one of its two strategy values and alters it with a normally distributed increment with mean 0 and the following standard deviation (Figure 13):(14)fx/μ,σ2=12πσ2exp−x−μ2/2σ2|x=individual capital,μ∈R=meanlocation,σ2>0=variancesquared scale.Figure 13
Code book: exploration.


## 2.5. Process 4. Reset Failure (and/or Protection) Potential

A failure lasts for one time step and results in the loss of an agent’s capital, according to the reset failure potential and/or failure, as follows:(15)randomn<r_t=1⟶1−pp=0,where randomn<rec=1 denotes randomly chosen individuals with a certain probability [randomn], and the failure potential of any individual is (1−pp), which is chosen according to a certain probability that approaches 0:(16)t_r<1=strong intervention,t_r⟶∞=weak intervention,t_r∈0,∞,By default, this recovery rate is implemented by resetting the failure potential after everyr_t=1 time step. At the same time, to control this intervention, we allowed the number of time steps to be controlled by another parameter (t_r∈0,∞), which represents the recovery time delay (Figure 14).Figure 14
Code book: recovery delay.


## 2.6. Mechanical Insight of the Programming

The broader objective of this step-by-step procedure is to show the computerized process underlying the fundamental mechanisms that are used. The Tables1–5 and matrix mentioned above account for the details of the rules and procedures (see Appendix 6 for details on the coding). In relation to the technical insights of the implementation, we present the details in Figure 15 that may interest program developers (Figure 15).Figure 15
Numerical results using a loop (left side) and an array (right side).The versions on the left- and right-hand sides in Figure15 represent vectorization using a loop and an array, respectively. Both versions are used in the development of our programming, as can be seen in the code book, which presents simple calculations. Specifically, following the step-by-step procedures of the operation, the version on the left-hand side can be recommended in general; however, it requires more time to simulate many individuals across time steps (see Output in Figure 15). Thus, in some dynamics implementations of models, we used the version on the right-hand side owing to its efficiency.


## 3. Performance (Results)

Given the set of features in relation to the dynamics presented according to the model description, the results of the simulation show the fundamental characteristics of risk diffusion in a randomly networked system and present a framework that enables us to examine the assumptions efficiently while imposing realistic protections against failure. In particular, the simulation characterizes the role of the recovery time delay from the observations of applied dynamics over time to indicate how failure spreads.First, individuals in the model are considered as vertices, and a set of two elements is drawn as edges connecting two vertices in relation to the information given in the graph. This representation involves two parameters: the number of nodes (n) and the probability that an edge is present (d). In network analysis, indicators of centrality identify the most important vertices within a graph, and their applications include the identification of the most influential node(s) in a network. The eigenvector centrality of a node is defined as Ax=λx, where A represents the adjacency matrix of the network with eigenvalue λ. The principal has an entry for each of the n vertices. The larger the entry for each vertex, the higher it’s the ranking with respect to the eigenvector centrality (Figure 16).Figure 16
Visualization of the propagation of failure over time. (a) The individuals’ state from the absence of failure (⟶blue) to failure (⟶red). (b) The time series of the number of failures for 100 realizations (black lines) until the number of failed nodes is stabilized. The horizontal axis represents the time step, and the vertical axis represents the proportion of failed nodes (the red dots denote the averages, and the yellow error bars denote the standard deviations). The histogram in the inset on the left-hand side shows the numerical distributions (failure probabilities), and the plot in the inset on the right-hand side shows the potential of failure corresponding to the time length.
(a)(b)Figure16(a) represents the influences of failures, computed as the frequency of failure nodes in relation to their initial and final states, with the computed relative frequencies fj=hj/N,hj=∑k=1,…,N;Xk=j1, where hj is the frequency of the failure state (j) and the percentage of occurrences of that failure outcome in the statistical ensemble corresponds to the relative frequency fj. Figure 16(b) is created to be run in a number of such simulations according to the time step, as one could spread the failure through the network PX∈a,b;t=1/N∑k=1,…,N;Xkt∈a,b1, with a time series of the number of failures for 100 realizations (black lines) until the number of failed nodes is stabilized. This implies that the greater the propagation from a higher rank (with respect to degree or centrality), the greater the area drawn between the failed nodes (red) and the nonfailed nodes (blue). This result intuitively implies that, primarily, higher-degree agents have greater exposure to cascading failure risk than lower-degree agents; this increases the potential for cascading failure [29].


### 3.1. Protection against Failure (Imposing Realistic Dynamics)

In line with our proposition, protection dynamics was applied in reference to the risk of failure. This model allows an agent to make a large investment in protection. Note that we assume that the failure potential from the dynamics becomes failure with probability1−pp depending on the agent’s investment in protection; pp=pp,max/1+cp,1/2/fpc when a failure lasts for one time step (Figure 17). The probabilities of these scenarios can be proven as follows.Figure 17
Protection dynamics against systemic risk. In each section, the plot on the left-hand side shows a matrix (horizontal axis = time step from 1 to 16; vertical axis = individuals [16]; color of the matrix = failure state: failure [red] and absence of failure [blue]). The plot in the middle shows each individual’s parameter values at a given time step (t  = 16: orange: fp_0 = strategy [1]; cyan: fp_1 = strategy [2]; red: fail = failure; green: pro = protection potential [pp]). The plot on the right-hand side represents individuals’ dynamics within a random network; node number = random label for each node, line width = eigenvector centrality, and node color = states (failure [red] ←⟶ [blue] absence of failure; green = protection potential; yellow = initial structure of the state without failure and protection). The initialized parameters of the simulations are as follows: nodes n = 10, connection d = 0.9 (% = 5.5), pp,max = 1, fp0 = 0.4, fp1 = 0.5, fm = 0.1, s = 1, μ = 0.0, σ = 0.1, pn = 0.1, pl = 0.3, and t = 10 (see Appendixes 1 and 2 for the results of the entire simulation).First, scenario A’s failure potential1−pp is 0.527 because the investment in protection pp is 0.473, based on the possible choice pp: pp,max/1+cp,1/2/fpc=1/1+1/0.9∗1, for certain parameter values (pp,max=1, cp,1/2=1, pr,pe=0.9,C=1). Second, scenario B’s failure potential 1−pp becomes 0.953 because the investment in protection pp is 0.047 based on the possible choice pp: pp,max/1+cp,1/2/fpc=0.1/1+1/0.9∗1, for certain parameter values (pp,max=0.1, cp,1/2=1, pr,pe=0.9,C=1). As can be seen from the set on the left-hand side of the plot, this scenario has a better result than the set on the right-hand side, corresponding to the coexistence of failure and the absence of the 20 eurist with time. The results imply that contagion and systemic risk are likely to be intensified by the parameter setting (i.e., pp,max, cp,1/2, and fp), resulting in a significant failure cost [30]. Note that the failure potential 1−pp also changes in relation to the choice of strategy values fp0 and fp1 based on social learning (pr∈0,1) and exploration (pe∈0,1) because these probabilities can lead to different levels of protection in fp [1].


### 3.2. Role of Recovery (Imposing Recovery Time Delay)

Here, we present a specific characterization to determine whether an alternative intervention could affect the failure trends observed in coexistence scenario A (pp,max=1, cp,1/2=1, pr,pe=0.9,C=1). The model shown in Figure 18 implies that contagion and systemic risk are also likely to be intensified with the recovery time delay, resulting in a significant failure cost. We observe that immediate or delayed intervention is associated with microscale propagation criteria for each node (Figure 18).Figure 18
Dynamics of protection against systemic risk with recovery time delay. Using the same initial parameter values (pp,max=1,cp,1/2=1, pr=0.1,pe=0.1,C=1), this set of the plots represents the time delay case (left-hand side: r_t = 1; right-hand side: r_t = 5). In each section, the plot on the left-hand side shows the matrix (horizontal axis = time step from 1 to 16; vertical axis = individuals from 1 to 16; color of the matrix = failure state: failure [red] and absence of failure [blue]) corresponding to each individual’s parameter values at the given time step (t = 16: orange: fp_0 = strategy [1]; cyan: fp_1 = strategy [2]; red: fail = failure; green: pro = protection potential [pp]). The graph on the right-hand side represents the dynamics in a random regular network, such that the node number = random label for each node and the node color = state (failure = red, absence of failure = blue) (see Appendix 3 for the results of the entire simulation).In Figure18, the individuals can be distinguished clearly. Obviously, nodes that have immediate recovery (plots on the left-hand side) appear to have the potential to protect against the propagation of failure; on the contrary, nodes with a malfunction (plots on the right-hand side) do not have such potential. The simulation consisted of repeated trials, and each trial had two possible outcomes: failure (= red) and absence of failure (= blue). The probability of failure is the same for every trial, as in flipping a coin n times, based on the binomial variable that we defined in the model’s basic structure. The probability of failure in each trial is given by PX=n!/r!n−r!pr1−pn−r=Cn,rpr1−pn−r, where n is the total number of trials, r is the total number of failure events, and p is the probability of failure in a single trial.In the plots on the left-hand side in Figure18, the probability of absence of failure is approximately 0.6, and the probability of failure is 0.4 (the case probability for Scenario A is calculated by the number of failures from the time steps:fj=hj/N,hj=∑k=1,…,N;Xk=j1). We assume a random variable X, which is equal to the number of failures after a certain number of time steps. One of the first conditions of this result is that it consists of a finite number of independent trials. This means that the probability of obtaining failure or absence of failure in each trial is independent of whether we obtained failure in a previous trial. Thus, in the case of the plots on the left-hand side with recovery at every time step (immediate intervention), the results of the simulation show independent trials. Another condition is that each trial clearly has one of the two discrete outcomes in which the variable X should be clearly classified as showing either failure or absence of failure with a given fixed number of trials. Then, the final condition of the probability of failure and absence of failure for each trail is constant, as we have already obtained measurements for each trial from the cases of Scenarios A and B.Proof of the role of the recovery rate.
We now examine the frequency of failed agents observed on the left-hand side in Figure18. Suppose that at a given time, there are failed nodes (Nf) and nonfailed nodes (N−Nf). The number of failed nodes at t+1 is given by(17)pAn=Nf=0.731=Nf+ppN−Nf=0.731+0.51−0.731=0.865=NNof,where pp denotes the protection probability (arbitrarily designated as 0.5 only for this numerical calculation); conversely, the number of failed nodes is(18)1−ppN−Nf=1−0.51−0.731=0.135=Nf.
Failure is propagated through an existing link with probabilitypl; at the same time, a link exists with a certain probability through the created network (pRR, RR  = random regular graph). Therefore, if we impose the condition that the failure potential can propagate through each link, and the propagation probability pl is less than 1 (when the original probability pn  = constant), this equation can be modified simply by replacing pp with(19)pp′=1−1−pp1−1−plpRRNf.
For example, when we arbitrarily consider the protectionpp=0.5 and failure propagation (pl) through a random network (pRR) to be sufficiently high (plpRR=0.9), the protection influenced by the failure propagation pp′ becomes small because 1−1−0.51−1−0.9Nf=0.09. On the contrary, if a weak failure propagation occurs, such as plpRR=0.1, the protection influenced by the failure propagation pp′ increases because(20)1−1−0.51−1−0.1Nf=0.95.
However, in the plots on the right-hand side in Figure18, the probability is no longer the same but changes from trial to trial. We have the variable X(pl), which is equal to the number of failures from a designated population. It seems to represent the same operation because, with it, each trial can be classified as either a failure or an absence of failure over a fixed number of trials (t = 16). At the same time, there is the probability that the variable plpRR is not constant for each trial owing to the recovery time delay, which does not consist of independent trials. The probability of failure or absence of failure in the first trial would be equal to the total number of individuals between the two simulation cases:(21)plpRRkon1sttrial=0.1.
However, the probability of the second trial (and the following trial) would not be the same because the simulation of the right-hand side case depends on what happened in the first (previous) trial:(22)plpRRkon2ndtrial≠constant.
In other words, each trial is carried out without replacement, which results in an exponentially large difference between the two cases. Thus, this result does not meet the independent condition: the probability present in the following trial depends on what happened in the previous one. Because replacement does not take place, the probability of failure for each trail is also not constant, unlike the simulation on the left-hand side, where the probability of failure is constant:(23)plpRRkon2ndtrial=constant.
Inspired by the plausible scenarios included in the recovery delay for cases A and C in Figure18, we focus on the comparison of the parameter pp,max (when recovery delay constant = 1) with more time steps (t=100). This is because of the applied function pp [=pp,max/1+cp,1/2/fpc] for this application, which will primarily be decided by pp,max when we consider cp,1/2/fpc and the recovery time as constants (Figure 19). This refers to the individual for control by interventions to be protected against the risk of failure when the failure propagation mechanism influences agents’ decisions as they are generated.
Figure19 shows a scatter plot constructed using pp,max (Figure 19(a)) with a clear negative correlation between failure and capital. Although it is constructed by the recovery time delay (Figure 19(b)), strong power law relationships are still obeyed in cascading failure, even if the capital values remain strong (see the averaged values for the failure and capital in the lower part of Figure 10). In the following results, this trend (failure and capital) is determined by two parameters (pp,max,rec_t); however, their influences do not have the same weight. Here, we should note that intervention applied to recovery can persist for a short period of time, which we could cite as a bias or rationality.Figure 19
Representation of the outcomes according to the recovery time delay (b) and protection maximum (a). Using the same initialized parameter values (no delay [r_t=1]), the plots represent the time delay (rt=1∼r_t=10) case. The upper plot shows failure (vertical axis = value of the failure corresponding to the time step (horizontal axis)). The middle plot shows the capital (vertical axis = value of the capital corresponding to the time step [horizontal axis]). The lower plot shows the averaged outcome values (vertical axis) for capital and failure according to the recovery time delay (rec_time[+1]) and the protection maximum (pp_max[+0.1]) (see legend). All the dashed lines denote variability.
(a)(b)


### 3.3. Generalize with Stationarity

Let us assume that the system has evolved and reaches stationarity, which implies that all variables have nearly constant fluctuation around their mean values. In stationarity, the state of the system can be considered independently of the initial conditions. It is useful to obtain a relationship among the variables in stationarity. First, we denote the number and fraction of failed agents byNf and f, respectively. For stationarity, the average number of failed agents remains constant. Consider the two successive steps t andt+1. Suppose that at time t, there are Nf and N−Nf failed and nonfailed nodes, respectively. Therefore, the number of nonfailed nodes at t+1 is Nf+ppN−Nf, and the number of failed nodes is 1−ppN−Nf. Stationarity means that the number of failed (or nonfailed) nodes remain constant (on average), i.e.,(24)Nf=1−ppN−Nf,Nf=pp≈0.9,Nf=↓,pp≈0.1,Nf=↑,f=1−pp2−pp=1−pp,maxfpc+12−pp,maxfpc+2,f=2−pp,max≈↑,f=↓,2−pp,max≈↓,f=↑.Let us deﬁneqp=1−pp. The above formula for f can be written as f=qp/1+qp, which is simple. Here, pp is the average probability of protection among the nonfailed nodes. Note that the protection probability for the failed nodes is zero because they have no capital. In other words, pp=∑ppi/N−Nf, where ppi represents the protection probability for node i. In the second equality, fp and c are defined similarly.This relationship shows that the stationary value forf is bounded in the interval [0, 1] and is a decreasing function of pp. The limiting values seem promising. For pp=1, i.e., full protection, there is no failed agent. For pp=0, i.e., no protection, there is a failed agent. Note that at the end of each time step, all the failed agents recover (as an initial setting). If the propagation probability plpRR is less than 1, this equation should be modified by replacing pp as follows:(25)pp′=1−1−pp1−1−plpRRNf,pp′=plpRR≈0.9,pp′=↓,plpRR≈0.1,pp′=↑.Again, by definingqp′=1−pp′, we implicitly obtain f. To check the validity of these formulae with a simulation, we increase the total simulation time (t = 1,000); for smaller plpRR<1, a longer time is required to reach stationarity (Figure 20).Figure 20
Stationarity in time series with the random regular graph (nodes = 10∗ 10, connection d = 9, time steps = 1,000). The set on the left-hand side shows the results controlled by the protection maximum, and the set on the right-hand side shows the results with a recovery time delay (dots = averaged values; dashed lines = variation). The upper plot shows the failure and capital combined (vertical axis = value corresponding to the time step [horizontal axis]). The plot in the middle shows failure (red) and capital (blue) (vertical axis = value corresponding to the time step [horizontal axis]). The inset plot shows the trend of the two strategies (fp0 = red; fp1 = blue)] (see Appendixes 4 and 5 for the results of the entire simulation). The lower plot shows the averaged outcomes (vertical axis) for capital (blues) and failure (reds), according to the recovery time delay (rec_time[+1]) and protection maximum [pp_max(+0.1)] (see legend). The background contour shows the dominance between the outcomes, and all the dashed lines denote the variability.Proof of the stationary state.
we calculate the average value of the capital in the stationary state to prove the long-term role of the recovery time delay. First, consider the caseplpRR=1. It can be easily seen that the average value of the capital in the stationary state satisfies the following equation:(26)cin+pp1−fp−fmc=c,c=pp≈0.9,c=↑,pp≈0.1,c=↓,c=fp≈↑,c=↓,fp≈↓,c=↑,where c is the average value of the capital among nonfailed individuals. Combining the above equations, we can obtain c and fp as a function of f in the stationary state. However, it is easier to obtain c as a function of pp, such that the protection probability should be replaced by pp′=1−1−pp1−1−plpRRNf when plpRR<1. Therefore, we obtain the following (note that in the simulation, we use a truncation of fp to constrain it to the interval [0,1−fm] [see code book]):(27)c=pppp′−cinpp,max−pppp,max−pppp′1−fm−1,fp=pppp′1−fm−1pppp′−cinpp,max−pp.
According to the trajectories (upper part of Figure20), the outcomes such as failure (or capital) reach a stationary state even if the trajectories from the strategies continue to evolve and exhibit different behaviors (see the inset of the upper plots). Therefore, the presence of the detailed dynamic features of the system (capital and failure) indicates the possibility of stationarity in the coevolutionary process. This observation can enable us to gain a sense of the qualitatively different nature of propagation (compared to pp,max) within systems, such that failure is not limited to protection or strategy but is due to regulation over time. In other words, there is another rate that continues to increase the bias as the length of the delay causes the cascading failure, even where the individuals still have potential (Figure 21).
As indicated by the protection (Figure21; bottom, marker of green, nodes that are controlled by pp,max=0.1 (left-hand side) seem to lose their ability to protect, owing to the propagation of failure. On the contrary, nodes that are controlled by t_r=2 (right-hand plots) seem to maintain their potential, even if they all feature cascading failure. We noted that the different levels of potential (between the two parameters [pp,max, t_r]) came from their capital, as marked in blue in Figure 20 (see bottom plots of the figure).
Thus, to reduce the potential ramifications (pp′) of such additional losses to others, an immediate recovery intervention may not only be preferred to the potential damage (1−pp′) from individual failures but also guarantee that it is strategically possible for even large insolvent individuals to recover losses to uninsured connectors. Before the potential for failure can advance the propagation value, it must be identified, and the recovery value of the individual protection potential (i.e., capital) must be estimated.Figure 21
Representation of protection potential constructed bypp,max (lower set) and t_r (lower right-hand side). With the same initialized parameter values (upper plots: pp,max=1,cp,1/2=1, pr=0.9,pe=0.9,C=1), the set of plots represents the time delay (left-hand side: r_t = 1; right-hand side: r_t = 2) case. In each section, the plot on the left-hand side shows a matrix (horizontal axis = time step from 1 to 16; vertical axis = individuals from 1 to 16; color of the matrix = failure state: failure [red] and absence of failure [blue]) corresponding to the parameter values of each individual at the given time step (t = 16: red: fail = failure; green: pro = protection potential). The graph on the right-hand side represents their dynamics in a random regular network; node number = random label of each node marked with a yellow background; lines = connections embedded by eigenvector centrality as the thickness; node color = states (failure = red; absence of failure = blue).


## 3.1. Protection against Failure (Imposing Realistic Dynamics)

In line with our proposition, protection dynamics was applied in reference to the risk of failure. This model allows an agent to make a large investment in protection. Note that we assume that the failure potential from the dynamics becomes failure with probability1−pp depending on the agent’s investment in protection; pp=pp,max/1+cp,1/2/fpc when a failure lasts for one time step (Figure 17). The probabilities of these scenarios can be proven as follows.Figure 17
Protection dynamics against systemic risk. In each section, the plot on the left-hand side shows a matrix (horizontal axis = time step from 1 to 16; vertical axis = individuals [16]; color of the matrix = failure state: failure [red] and absence of failure [blue]). The plot in the middle shows each individual’s parameter values at a given time step (t  = 16: orange: fp_0 = strategy [1]; cyan: fp_1 = strategy [2]; red: fail = failure; green: pro = protection potential [pp]). The plot on the right-hand side represents individuals’ dynamics within a random network; node number = random label for each node, line width = eigenvector centrality, and node color = states (failure [red] ←⟶ [blue] absence of failure; green = protection potential; yellow = initial structure of the state without failure and protection). The initialized parameters of the simulations are as follows: nodes n = 10, connection d = 0.9 (% = 5.5), pp,max = 1, fp0 = 0.4, fp1 = 0.5, fm = 0.1, s = 1, μ = 0.0, σ = 0.1, pn = 0.1, pl = 0.3, and t = 10 (see Appendixes 1 and 2 for the results of the entire simulation).First, scenario A’s failure potential1−pp is 0.527 because the investment in protection pp is 0.473, based on the possible choice pp: pp,max/1+cp,1/2/fpc=1/1+1/0.9∗1, for certain parameter values (pp,max=1, cp,1/2=1, pr,pe=0.9,C=1). Second, scenario B’s failure potential 1−pp becomes 0.953 because the investment in protection pp is 0.047 based on the possible choice pp: pp,max/1+cp,1/2/fpc=0.1/1+1/0.9∗1, for certain parameter values (pp,max=0.1, cp,1/2=1, pr,pe=0.9,C=1). As can be seen from the set on the left-hand side of the plot, this scenario has a better result than the set on the right-hand side, corresponding to the coexistence of failure and the absence of the 20 eurist with time. The results imply that contagion and systemic risk are likely to be intensified by the parameter setting (i.e., pp,max, cp,1/2, and fp), resulting in a significant failure cost [30]. Note that the failure potential 1−pp also changes in relation to the choice of strategy values fp0 and fp1 based on social learning (pr∈0,1) and exploration (pe∈0,1) because these probabilities can lead to different levels of protection in fp [1].


## 3.2. Role of Recovery (Imposing Recovery Time Delay)

Here, we present a specific characterization to determine whether an alternative intervention could affect the failure trends observed in coexistence scenario A (pp,max=1, cp,1/2=1, pr,pe=0.9,C=1). The model shown in Figure 18 implies that contagion and systemic risk are also likely to be intensified with the recovery time delay, resulting in a significant failure cost. We observe that immediate or delayed intervention is associated with microscale propagation criteria for each node (Figure 18).Figure 18
Dynamics of protection against systemic risk with recovery time delay. Using the same initial parameter values (pp,max=1,cp,1/2=1, pr=0.1,pe=0.1,C=1), this set of the plots represents the time delay case (left-hand side: r_t = 1; right-hand side: r_t = 5). In each section, the plot on the left-hand side shows the matrix (horizontal axis = time step from 1 to 16; vertical axis = individuals from 1 to 16; color of the matrix = failure state: failure [red] and absence of failure [blue]) corresponding to each individual’s parameter values at the given time step (t = 16: orange: fp_0 = strategy [1]; cyan: fp_1 = strategy [2]; red: fail = failure; green: pro = protection potential [pp]). The graph on the right-hand side represents the dynamics in a random regular network, such that the node number = random label for each node and the node color = state (failure = red, absence of failure = blue) (see Appendix 3 for the results of the entire simulation).In Figure18, the individuals can be distinguished clearly. Obviously, nodes that have immediate recovery (plots on the left-hand side) appear to have the potential to protect against the propagation of failure; on the contrary, nodes with a malfunction (plots on the right-hand side) do not have such potential. The simulation consisted of repeated trials, and each trial had two possible outcomes: failure (= red) and absence of failure (= blue). The probability of failure is the same for every trial, as in flipping a coin n times, based on the binomial variable that we defined in the model’s basic structure. The probability of failure in each trial is given by PX=n!/r!n−r!pr1−pn−r=Cn,rpr1−pn−r, where n is the total number of trials, r is the total number of failure events, and p is the probability of failure in a single trial.In the plots on the left-hand side in Figure18, the probability of absence of failure is approximately 0.6, and the probability of failure is 0.4 (the case probability for Scenario A is calculated by the number of failures from the time steps:fj=hj/N,hj=∑k=1,…,N;Xk=j1). We assume a random variable X, which is equal to the number of failures after a certain number of time steps. One of the first conditions of this result is that it consists of a finite number of independent trials. This means that the probability of obtaining failure or absence of failure in each trial is independent of whether we obtained failure in a previous trial. Thus, in the case of the plots on the left-hand side with recovery at every time step (immediate intervention), the results of the simulation show independent trials. Another condition is that each trial clearly has one of the two discrete outcomes in which the variable X should be clearly classified as showing either failure or absence of failure with a given fixed number of trials. Then, the final condition of the probability of failure and absence of failure for each trail is constant, as we have already obtained measurements for each trial from the cases of Scenarios A and B.Proof of the role of the recovery rate.
We now examine the frequency of failed agents observed on the left-hand side in Figure18. Suppose that at a given time, there are failed nodes (Nf) and nonfailed nodes (N−Nf). The number of failed nodes at t+1 is given by(17)pAn=Nf=0.731=Nf+ppN−Nf=0.731+0.51−0.731=0.865=NNof,where pp denotes the protection probability (arbitrarily designated as 0.5 only for this numerical calculation); conversely, the number of failed nodes is(18)1−ppN−Nf=1−0.51−0.731=0.135=Nf.
Failure is propagated through an existing link with probabilitypl; at the same time, a link exists with a certain probability through the created network (pRR, RR  = random regular graph). Therefore, if we impose the condition that the failure potential can propagate through each link, and the propagation probability pl is less than 1 (when the original probability pn  = constant), this equation can be modified simply by replacing pp with(19)pp′=1−1−pp1−1−plpRRNf.
For example, when we arbitrarily consider the protectionpp=0.5 and failure propagation (pl) through a random network (pRR) to be sufficiently high (plpRR=0.9), the protection influenced by the failure propagation pp′ becomes small because 1−1−0.51−1−0.9Nf=0.09. On the contrary, if a weak failure propagation occurs, such as plpRR=0.1, the protection influenced by the failure propagation pp′ increases because(20)1−1−0.51−1−0.1Nf=0.95.
However, in the plots on the right-hand side in Figure18, the probability is no longer the same but changes from trial to trial. We have the variable X(pl), which is equal to the number of failures from a designated population. It seems to represent the same operation because, with it, each trial can be classified as either a failure or an absence of failure over a fixed number of trials (t = 16). At the same time, there is the probability that the variable plpRR is not constant for each trial owing to the recovery time delay, which does not consist of independent trials. The probability of failure or absence of failure in the first trial would be equal to the total number of individuals between the two simulation cases:(21)plpRRkon1sttrial=0.1.
However, the probability of the second trial (and the following trial) would not be the same because the simulation of the right-hand side case depends on what happened in the first (previous) trial:(22)plpRRkon2ndtrial≠constant.
In other words, each trial is carried out without replacement, which results in an exponentially large difference between the two cases. Thus, this result does not meet the independent condition: the probability present in the following trial depends on what happened in the previous one. Because replacement does not take place, the probability of failure for each trail is also not constant, unlike the simulation on the left-hand side, where the probability of failure is constant:(23)plpRRkon2ndtrial=constant.
Inspired by the plausible scenarios included in the recovery delay for cases A and C in Figure18, we focus on the comparison of the parameter pp,max (when recovery delay constant = 1) with more time steps (t=100). This is because of the applied function pp [=pp,max/1+cp,1/2/fpc] for this application, which will primarily be decided by pp,max when we consider cp,1/2/fpc and the recovery time as constants (Figure 19). This refers to the individual for control by interventions to be protected against the risk of failure when the failure propagation mechanism influences agents’ decisions as they are generated.
Figure19 shows a scatter plot constructed using pp,max (Figure 19(a)) with a clear negative correlation between failure and capital. Although it is constructed by the recovery time delay (Figure 19(b)), strong power law relationships are still obeyed in cascading failure, even if the capital values remain strong (see the averaged values for the failure and capital in the lower part of Figure 10). In the following results, this trend (failure and capital) is determined by two parameters (pp,max,rec_t); however, their influences do not have the same weight. Here, we should note that intervention applied to recovery can persist for a short period of time, which we could cite as a bias or rationality.Figure 19
Representation of the outcomes according to the recovery time delay (b) and protection maximum (a). Using the same initialized parameter values (no delay [r_t=1]), the plots represent the time delay (rt=1∼r_t=10) case. The upper plot shows failure (vertical axis = value of the failure corresponding to the time step (horizontal axis)). The middle plot shows the capital (vertical axis = value of the capital corresponding to the time step [horizontal axis]). The lower plot shows the averaged outcome values (vertical axis) for capital and failure according to the recovery time delay (rec_time[+1]) and the protection maximum (pp_max[+0.1]) (see legend). All the dashed lines denote variability.
(a)(b)


## 3.3. Generalize with Stationarity

Let us assume that the system has evolved and reaches stationarity, which implies that all variables have nearly constant fluctuation around their mean values. In stationarity, the state of the system can be considered independently of the initial conditions. It is useful to obtain a relationship among the variables in stationarity. First, we denote the number and fraction of failed agents byNf and f, respectively. For stationarity, the average number of failed agents remains constant. Consider the two successive steps t andt+1. Suppose that at time t, there are Nf and N−Nf failed and nonfailed nodes, respectively. Therefore, the number of nonfailed nodes at t+1 is Nf+ppN−Nf, and the number of failed nodes is 1−ppN−Nf. Stationarity means that the number of failed (or nonfailed) nodes remain constant (on average), i.e.,(24)Nf=1−ppN−Nf,Nf=pp≈0.9,Nf=↓,pp≈0.1,Nf=↑,f=1−pp2−pp=1−pp,maxfpc+12−pp,maxfpc+2,f=2−pp,max≈↑,f=↓,2−pp,max≈↓,f=↑.Let us deﬁneqp=1−pp. The above formula for f can be written as f=qp/1+qp, which is simple. Here, pp is the average probability of protection among the nonfailed nodes. Note that the protection probability for the failed nodes is zero because they have no capital. In other words, pp=∑ppi/N−Nf, where ppi represents the protection probability for node i. In the second equality, fp and c are defined similarly.This relationship shows that the stationary value forf is bounded in the interval [0, 1] and is a decreasing function of pp. The limiting values seem promising. For pp=1, i.e., full protection, there is no failed agent. For pp=0, i.e., no protection, there is a failed agent. Note that at the end of each time step, all the failed agents recover (as an initial setting). If the propagation probability plpRR is less than 1, this equation should be modified by replacing pp as follows:(25)pp′=1−1−pp1−1−plpRRNf,pp′=plpRR≈0.9,pp′=↓,plpRR≈0.1,pp′=↑.Again, by definingqp′=1−pp′, we implicitly obtain f. To check the validity of these formulae with a simulation, we increase the total simulation time (t = 1,000); for smaller plpRR<1, a longer time is required to reach stationarity (Figure 20).Figure 20
Stationarity in time series with the random regular graph (nodes = 10∗ 10, connection d = 9, time steps = 1,000). The set on the left-hand side shows the results controlled by the protection maximum, and the set on the right-hand side shows the results with a recovery time delay (dots = averaged values; dashed lines = variation). The upper plot shows the failure and capital combined (vertical axis = value corresponding to the time step [horizontal axis]). The plot in the middle shows failure (red) and capital (blue) (vertical axis = value corresponding to the time step [horizontal axis]). The inset plot shows the trend of the two strategies (fp0 = red; fp1 = blue)] (see Appendixes 4 and 5 for the results of the entire simulation). The lower plot shows the averaged outcomes (vertical axis) for capital (blues) and failure (reds), according to the recovery time delay (rec_time[+1]) and protection maximum [pp_max(+0.1)] (see legend). The background contour shows the dominance between the outcomes, and all the dashed lines denote the variability.Proof of the stationary state.
we calculate the average value of the capital in the stationary state to prove the long-term role of the recovery time delay. First, consider the caseplpRR=1. It can be easily seen that the average value of the capital in the stationary state satisfies the following equation:(26)cin+pp1−fp−fmc=c,c=pp≈0.9,c=↑,pp≈0.1,c=↓,c=fp≈↑,c=↓,fp≈↓,c=↑,where c is the average value of the capital among nonfailed individuals. Combining the above equations, we can obtain c and fp as a function of f in the stationary state. However, it is easier to obtain c as a function of pp, such that the protection probability should be replaced by pp′=1−1−pp1−1−plpRRNf when plpRR<1. Therefore, we obtain the following (note that in the simulation, we use a truncation of fp to constrain it to the interval [0,1−fm] [see code book]):(27)c=pppp′−cinpp,max−pppp,max−pppp′1−fm−1,fp=pppp′1−fm−1pppp′−cinpp,max−pp.
According to the trajectories (upper part of Figure20), the outcomes such as failure (or capital) reach a stationary state even if the trajectories from the strategies continue to evolve and exhibit different behaviors (see the inset of the upper plots). Therefore, the presence of the detailed dynamic features of the system (capital and failure) indicates the possibility of stationarity in the coevolutionary process. This observation can enable us to gain a sense of the qualitatively different nature of propagation (compared to pp,max) within systems, such that failure is not limited to protection or strategy but is due to regulation over time. In other words, there is another rate that continues to increase the bias as the length of the delay causes the cascading failure, even where the individuals still have potential (Figure 21).
As indicated by the protection (Figure21; bottom, marker of green, nodes that are controlled by pp,max=0.1 (left-hand side) seem to lose their ability to protect, owing to the propagation of failure. On the contrary, nodes that are controlled by t_r=2 (right-hand plots) seem to maintain their potential, even if they all feature cascading failure. We noted that the different levels of potential (between the two parameters [pp,max, t_r]) came from their capital, as marked in blue in Figure 20 (see bottom plots of the figure).
Thus, to reduce the potential ramifications (pp′) of such additional losses to others, an immediate recovery intervention may not only be preferred to the potential damage (1−pp′) from individual failures but also guarantee that it is strategically possible for even large insolvent individuals to recover losses to uninsured connectors. Before the potential for failure can advance the propagation value, it must be identified, and the recovery value of the individual protection potential (i.e., capital) must be estimated.Figure 21
Representation of protection potential constructed bypp,max (lower set) and t_r (lower right-hand side). With the same initialized parameter values (upper plots: pp,max=1,cp,1/2=1, pr=0.9,pe=0.9,C=1), the set of plots represents the time delay (left-hand side: r_t = 1; right-hand side: r_t = 2) case. In each section, the plot on the left-hand side shows a matrix (horizontal axis = time step from 1 to 16; vertical axis = individuals from 1 to 16; color of the matrix = failure state: failure [red] and absence of failure [blue]) corresponding to the parameter values of each individual at the given time step (t = 16: red: fail = failure; green: pro = protection potential). The graph on the right-hand side represents their dynamics in a random regular network; node number = random label of each node marked with a yellow background; lines = connections embedded by eigenvector centrality as the thickness; node color = states (failure = red; absence of failure = blue).


## 4. Discussion

We presented a simple general model to quantify the protection for mitigating systemic risk, with the recovery time delay as the result. Using a simple set of properties, the observations from this model indicate how probability describes the proportion of protection that can be characterized by how systemic risk should be coped with rather than being predicted by the probability of failure [31].


### 4.1. Summary of the Model

We proposed the following process-based steps (1–4) to create a model. First,network-agent properties were established: when the basic data structure was constructed, the functionalities of the mechanism began with a specific undirected relationship between agents through agent-based simulations, in a coexisting macroscale structure with individuals interconnected at the microscale level in the network. Next, the primary risk influence was established using a parameter to evaluate the impact of risk on the networked agents; the influence of primary risk was estimated along the structure as a general failure property. Then, it was necessary to implement protection against systemic risk by embedding protection dynamics that emphasizes the roles of payoff, failure, and strategy dynamics. Finally, recovery was considered through scaling for the different evolutionary and nonevolutionary components; this is crucial to the way this system functions, where each step computes a new entity and generates a new proportion in relation to the intervention. The implications of this model are as follows.


### 4.2. Theoretical Implications

A suite of plausible dynamics and decentralized bottom-up mechanisms was constructed by establishing appropriate rules for the interaction, within which the system components can self-organize, including mechanisms for ensuring rule compliance (vectorized microscale implementation). This evolutionary heuristic promotes balance with respect to the interactions [32]. For example, when investment in protection is weak (low investment), a pattern of strong systemic risk emerges in the form of agent failure in networked conditions. By contrast, when investment in protection is strong (high investment), a pattern of protection emerges, with little diversification against all challenges (Figure 17). The simulation also reflected a clear correlation between a set of parameter values (between those for capital and failure and between those for the strategies of fp0 and fp1). Thus, the strategy of social learning could be another crucial factor in resource provision that violates expectations and leads to novel trends with high impact. These results shed light on the propagation modes. The observed contagion and persistence patterns can be regarded not as a direct causal link but in relation to an accumulated rational driven by interconnectedness [33].More importantly, in this study, the failure potential also reflects the time delay after the official failure of an individual [34]. Newly damaged individuals may affect others or may recover from the next time step onwards (recovery occurs with the rate tr). The potential needed for recovery is related to the number of healthy individuals nt, and if individuals recover at time tr=1, the protection potential changes as follows:(28)ct+1=ct+nt−1−ppt.Once the capital is exhausted, the systemic risk increases rapidly. This is based on suitable real-time intervention related to short-term anticipation of risk flows [35]. However, because regulation occurs over time, another rate itself increases the failure potential even if the capital is still exhausted (note that the recovery rate mainly influences failure and does not have the same weight for capital). From our observations, we assume that the protection (or robustness) of an agent πi decreases (or increases) by an amount proportional to the relative exposure of risk sharing ηij. Consistent with the network of dynamics described above, the dynamics, including the recovery time delay (in time series), can be formalized as follows:(29)πi=πi0−ak∑jηijχjτ,πi=τ≈↑,πi=↓,τ≈↓,πi=↑.For convenience, with respect to the results,k substitutes the protection potential, defined by ct+1=ct+nt−1−ppt, such that the function a determines the extent of the loss caused by the default χjτ when we fix risk sharing ηij. This indicates that the agent has defaulted at a previous time, denoted by the time variable τ. In the simulations, there was no delay during the development of the cascade τ≈0,τ=t2−t1. However, this dynamic differs across the default of the recovery [36]. If the system delays the intervention, the cascade tends to be much larger (following the power law) because the defaults of the neighbors of a given agent are statistically dependent on j, such that their default is more likely to cause the default of others:(30)f′x=kx+c,x=rt+1,c=1.In Table6, such a range [f′x] will be determined by failure propagation through each link in the random regular network (plpRR), which was determined by the recovery time delay. We simply proved that this numerical trend of the protection probability defined by pp′=1−1−pp1−1−plpERNf could not be the same as that of pp_max [when plpER  = constant (Figure 20)]. Thus, the failure influences in these simulations are not identical, as pp_max changes according to these parameters, including where increases or decreases occur following a nonlinear curvature [37].Table 6
Numerical result of the function [f′x].
Domainx=r_t12345678910Numericalf′x21.3331.21.1421.1111.090 1.0761.0661.0581.050Fixed meancapital0.7720.5850.5630.5390.5380.5610.5480.5890.5330.566


### 4.3. Practical Implications

We propose a modified version of the protection model against systemic risk in terms of its failure recovery mechanics, as demonstrated above. The mechanisms here are based on a few simple basic rules: a node fails at a time with a probability of failure if its failure potential is greater than or equal to that of its nearest neighbors [1], and it fails owing to the interconnected potential, although it spontaneously recovers at an external recovery or according to an intervention probability [3]. The consequences of the damage are crucial for systemic risk and controllability; however, they have not been explored systematically thus far [38]. We show how the process of embedding and the related recovery times impact the dynamics of failure processes in a network (see the section on the proof of the role of the recovery time delay). Therefore, we propose that the extent of the intervention regime in the system can be a source of evolutionary (in)stability, wherein the immediate recovery of components can mitigate damage and propagate failure in dynamic networks [17]. These decentralized management principles could be applied to logistical and production systems, or even to administrative processes and governance [18].Governments are often reluctant to resolve insolvency in institutions [e.g., banks, firms, supply chains, and infected virus individual (i.e., Ebola, SARS, and COVID-19)], and they permit them to continue operating despite their negative effects. The length of the attendant delay causes a cascading failure, regardless of each individual’s capital (i.e., immunity), which then leads to reductions in network welfare. These delays may propagate the damage to many other individuals in the network, increasing their fragility and probability of failure [39]. Evidence from governing systems suggests that if individuals’ troubles are estimated before their capital becomes negative, institutions could, based on their risk potential, weed out the inefficient or unfortunate individuals to avoid more serious adverse effects [40]. This indicates the importance of resolving challenges to individuals as quickly as possible and developing more rapid responses to certify protected individuals by providing immediate intervention. On the contrary, prompt corrective action can increase the willingness to supply protection to reduce the chances of systemic risk [41]. Given the evolutionary mechanisms shown in this simulation model, we observed that the evolutionary response often obtains a critical value for a plausible protection potential. We demonstrated that, although structures have high potential for individual protection and a strategy to maintain their capital, the function of the interconnected recovery delay makes them weak amplifiers, where unprofitable intervention shows a high bias.


## 4.1. Summary of the Model

We proposed the following process-based steps (1–4) to create a model. First,network-agent properties were established: when the basic data structure was constructed, the functionalities of the mechanism began with a specific undirected relationship between agents through agent-based simulations, in a coexisting macroscale structure with individuals interconnected at the microscale level in the network. Next, the primary risk influence was established using a parameter to evaluate the impact of risk on the networked agents; the influence of primary risk was estimated along the structure as a general failure property. Then, it was necessary to implement protection against systemic risk by embedding protection dynamics that emphasizes the roles of payoff, failure, and strategy dynamics. Finally, recovery was considered through scaling for the different evolutionary and nonevolutionary components; this is crucial to the way this system functions, where each step computes a new entity and generates a new proportion in relation to the intervention. The implications of this model are as follows.


## 4.2. Theoretical Implications

A suite of plausible dynamics and decentralized bottom-up mechanisms was constructed by establishing appropriate rules for the interaction, within which the system components can self-organize, including mechanisms for ensuring rule compliance (vectorized microscale implementation). This evolutionary heuristic promotes balance with respect to the interactions [32]. For example, when investment in protection is weak (low investment), a pattern of strong systemic risk emerges in the form of agent failure in networked conditions. By contrast, when investment in protection is strong (high investment), a pattern of protection emerges, with little diversification against all challenges (Figure 17). The simulation also reflected a clear correlation between a set of parameter values (between those for capital and failure and between those for the strategies of fp0 and fp1). Thus, the strategy of social learning could be another crucial factor in resource provision that violates expectations and leads to novel trends with high impact. These results shed light on the propagation modes. The observed contagion and persistence patterns can be regarded not as a direct causal link but in relation to an accumulated rational driven by interconnectedness [33].More importantly, in this study, the failure potential also reflects the time delay after the official failure of an individual [34]. Newly damaged individuals may affect others or may recover from the next time step onwards (recovery occurs with the rate tr). The potential needed for recovery is related to the number of healthy individuals nt, and if individuals recover at time tr=1, the protection potential changes as follows:(28)ct+1=ct+nt−1−ppt.Once the capital is exhausted, the systemic risk increases rapidly. This is based on suitable real-time intervention related to short-term anticipation of risk flows [35]. However, because regulation occurs over time, another rate itself increases the failure potential even if the capital is still exhausted (note that the recovery rate mainly influences failure and does not have the same weight for capital). From our observations, we assume that the protection (or robustness) of an agent πi decreases (or increases) by an amount proportional to the relative exposure of risk sharing ηij. Consistent with the network of dynamics described above, the dynamics, including the recovery time delay (in time series), can be formalized as follows:(29)πi=πi0−ak∑jηijχjτ,πi=τ≈↑,πi=↓,τ≈↓,πi=↑.For convenience, with respect to the results,k substitutes the protection potential, defined by ct+1=ct+nt−1−ppt, such that the function a determines the extent of the loss caused by the default χjτ when we fix risk sharing ηij. This indicates that the agent has defaulted at a previous time, denoted by the time variable τ. In the simulations, there was no delay during the development of the cascade τ≈0,τ=t2−t1. However, this dynamic differs across the default of the recovery [36]. If the system delays the intervention, the cascade tends to be much larger (following the power law) because the defaults of the neighbors of a given agent are statistically dependent on j, such that their default is more likely to cause the default of others:(30)f′x=kx+c,x=rt+1,c=1.In Table6, such a range [f′x] will be determined by failure propagation through each link in the random regular network (plpRR), which was determined by the recovery time delay. We simply proved that this numerical trend of the protection probability defined by pp′=1−1−pp1−1−plpERNf could not be the same as that of pp_max [when plpER  = constant (Figure 20)]. Thus, the failure influences in these simulations are not identical, as pp_max changes according to these parameters, including where increases or decreases occur following a nonlinear curvature [37].Table 6
Numerical result of the function [f′x].
Domainx=r_t12345678910Numericalf′x21.3331.21.1421.1111.090 1.0761.0661.0581.050Fixed meancapital0.7720.5850.5630.5390.5380.5610.5480.5890.5330.566


## 4.3. Practical Implications

We propose a modified version of the protection model against systemic risk in terms of its failure recovery mechanics, as demonstrated above. The mechanisms here are based on a few simple basic rules: a node fails at a time with a probability of failure if its failure potential is greater than or equal to that of its nearest neighbors [1], and it fails owing to the interconnected potential, although it spontaneously recovers at an external recovery or according to an intervention probability [3]. The consequences of the damage are crucial for systemic risk and controllability; however, they have not been explored systematically thus far [38]. We show how the process of embedding and the related recovery times impact the dynamics of failure processes in a network (see the section on the proof of the role of the recovery time delay). Therefore, we propose that the extent of the intervention regime in the system can be a source of evolutionary (in)stability, wherein the immediate recovery of components can mitigate damage and propagate failure in dynamic networks [17]. These decentralized management principles could be applied to logistical and production systems, or even to administrative processes and governance [18].Governments are often reluctant to resolve insolvency in institutions [e.g., banks, firms, supply chains, and infected virus individual (i.e., Ebola, SARS, and COVID-19)], and they permit them to continue operating despite their negative effects. The length of the attendant delay causes a cascading failure, regardless of each individual’s capital (i.e., immunity), which then leads to reductions in network welfare. These delays may propagate the damage to many other individuals in the network, increasing their fragility and probability of failure [39]. Evidence from governing systems suggests that if individuals’ troubles are estimated before their capital becomes negative, institutions could, based on their risk potential, weed out the inefficient or unfortunate individuals to avoid more serious adverse effects [40]. This indicates the importance of resolving challenges to individuals as quickly as possible and developing more rapid responses to certify protected individuals by providing immediate intervention. On the contrary, prompt corrective action can increase the willingness to supply protection to reduce the chances of systemic risk [41]. Given the evolutionary mechanisms shown in this simulation model, we observed that the evolutionary response often obtains a critical value for a plausible protection potential. We demonstrated that, although structures have high potential for individual protection and a strategy to maintain their capital, the function of the interconnected recovery delay makes them weak amplifiers, where unprofitable intervention shows a high bias.


## 5. Concluding Remarks

Cascading failure was used to assess how rules and processes can collectively add up to a series of interconnected unsuitable outcomes. In the simulations, although every object was considered to be doing well individually, systemic risks could emerge, as the whole was vast. In other words, even if every single object is considered to be highly fitted and behaving properly (i.e., capital), there is no standard solution for proper management for everyone’s benefit. Therefore, the elimination of resources needed for recovery requires a strong effort to halt cascades as they begin, when the damage is still small, and the problem may not yet be perceived as threatening. These issues can and must be treated with a proper (re)design of the system and adoption of management principles, as shown by the simulation results [42].Many disasters in the real-world result from incorrect thinking and inappropriate system design. To address such risks more completely, a better understanding of proper intervention and resilience is crucial. However, there remains a lack of an effective method for calculating networked risk. The proposed model can facilitate realistic calculation of the interdependence and propagation of risks in a network and how they can be absorbed, and it can mediate such that both the system components and the plausible systemic intervention and outcomes will work well.We derived a unifying framework for the interplay of observations that embed realistic dynamics such as payoff, failure, strategy, and recovery in a random regular network. The mechanics showed that the complexity should be described by the essential features of the model’s processes that capture evolutionary damage spread owing to the coexistence of crucial hypotheses in the system. Thus, it may be possible to create an account where protection and failure are not static quantities, and propagation is likely to be understood in terms of how frequently the system is in a condition that leads to a large diffusion. This availability of mechanisms raises additional expectations that predictability and controllability are a simple matter of proper system design and operation [43]. More intuitively, this study can provide a better understanding of recovery, where real-time management can overcome instabilities caused by delays in feedback or lack of information.



---

*Source: 4805404-2021-04-28.xml*