Research Article | Open Access

# Cascading Failures in Weighted Complex Networks of Transit Systems Based on Coupled Map Lattices

**Academic Editor:**José R. C. Piqueira

#### Abstract

Study on the vulnerability and robustness of urban public transit networks (PTNs) has great implications for PTNs planning and emergency management, particularly considering passengers’ dynamic behaviors. We made a complex weighted network analysis based on passenger flow for Beijing’s bus stop network and multimodal transit network coupled with bus and urban rail systems. The analysis shows that there are small-world or scale-free properties in these two networks, which make them display different robustness under link or node failures. With consideration of the dynamic flow redistribution, we propose a model based on coupled map lattices to analyze the cascading failures of these two weighted networks. We find that the dynamic flow redistribution can significantly improve the tolerance of small-world or scale-free PTN against random faults. Because of the coupling of bus and rail systems, the multimodal network with scale-free topology and flow distribution structures displays an increasing tolerance even against intentional attack; however, its cascade is also much more intense once the failure is triggered. We find some thresholds of topological and flow coupling strength in the spreading process, which can be exploited to develop strategies to control cascade failures.

#### 1. Introduction

In the last few years, the error tolerance and attack vulnerability of real networks have attracted the attention of many researchers, since the discovery of the ubiquitous small-world [1] and scale-free properties [2]. A scale-free network displays a property of heterogeneity with a power-law degree distribution ~ [2], where is the degree of a randomly chosen node and is the scale-free exponent, while a small-world network, compared to the former, is more homogeneous with an exponential degree distribution, a greater clustering coefficient, and a shorter average distance [1]. Some empirical studies report that many real networks’ topological structures, including public transit networks (PTNs), are found to be scale-free or small-world, for example, the Boston subway network [3, 4], the Indian railway network [5], the Chinese railway network [6], and the public transport systems in Poland [7], in Germany, and in France [8]. The scale-free networks become “robust yet fragile” [9, 10]; that is, these networks are very sensitive to the intentional removal of central nodes but become robust to the random removal of some other nodes. There have been a few recent empirical studies on the structural robustness of many real complex networks, for example, the protein network [11], the food webs [12], the email network [13], the internet network [14, 15], the computer network [16], the cyber-physical network [17], and the uncertain system [18, 19].

In addition, there exists the physical flow (also defined as load) in real-world networks, such as the data transmitted in communication networks, the electrical currents in power grids, the vehicles in transportation networks, and the passenger flow in PTNs. As the physical flow is dynamic, the failure of one or a few nodes/edges could lead to the failures of other nodes/edges by the coupling relationship between nodes/edges and the redistribution of flow over the whole networks, triggering chain reactions that lead to the collapse of a few or all nodes/edges in the network. This phenomenon is called cascading failure [20, 21]. The largest blackout event in the northeastern US power grid in August 2003, for example, is due to cascading failure.

Urban PTN, composed of routes, stops, and the passenger flow traveling in network, is a complicated giant system. In a PTN, if one or some key stations or routes are destroyed by natural disasters or their carrying capacity is in short supply due to sudden increases of passenger flow (such as a large number of people coming from stadiums or theaters after matches or concerts), one part of, or even the whole, network may be overloaded and out of operation. A case like this occurred on July 21, 2012, when the heaviest rain in the last 60 years in Beijing shut down a metro line and caused 100 bus routes to detour, dump stop, or stop operation completely. This resulted in more than 200 bus routes extending their service hours to transport passengers. Another example occurred on January 3, 2010, when heavy snow caused more than 60 bus routes to detour or be taken out of operation. These failures greatly impacted passenger travel and severely disrupted the social/economic activities of the city. These events motivated us to study the dependence of avalanches and dynamic robustness in PTNs on the initial perturbation, network structure, and flow behavior.

Some models and empirical research on cascading failures in different networks have been reported in the recent literature, and many of them showed that a network’s structure has great impact on its function. They include the empirical studies on the US power grid [22] and ecoindustrial symbiosis network considering the load redistribution, the cascading dynamics in small-world network [23, 24], scale-free network [25], weighted complex network [26], and independent network [27]. For PTNs, however, the majority of the research focuses on the (static) robustness of network topology based on the idea of Albert et al. [9], by removing one or some nodes or edges in the network. A typical example is the analysis of attack vulnerability of 14 PTNs in the L- and P-spaces (explained in Figure 1) [28, 29], respectively. Topological vulnerability of other PTN networks, such as the railway network of Switzerland [30], the subway network of Shanghai [31], the air flight network of China [32], is also studied.

**(a) L-space**

**(b) P-space**

The research on the dynamic robustness of PTNs, however, is still limited. Although Wu et al. [33, 34] and Zheng et al. [35] have studied the cascading behavior in scale-free networks based on the traffic dynamics theory and Yang et al. [36] have simulated the epidemic dynamic behaviors in PTNs based on the SIS spread model, the cascading dynamics in weighted PTNs considering the dynamical passenger flow has not yet been reported. Also, the empirical studies on the dynamical characteristics of weighted PTNs based on passenger’s travel behavior are not given adequate consideration. As far as we know, only the studies of the Seoul subway system [37], Singapore public transportation system [38], and Beijing bus routes system [39] considered passenger flow in their analysis. The former two studies constructed the complex network according to passengers’ travel routes, but the underlying physical structure is not considered.

In light of the review, several questions remain open in the study of PTNs considering flow dynamics. For example, what is the structure of a real PTN measured in the P-space [4] or L-space [5]? How robust are these PTNs against random fault or intentional attack when considering passenger flow redistribution in the network? What are the thresholds for cascading failures and spreading dynamics in different real-world PTN structures? In seeking answers to these questions, we were able to identify the threshold to avoid cascading failures in PTNs and find the strategies to avoid such failures, which provides an important theoretical basis for protecting real PTNs and improving their robustness.

In this paper, we propose a model to explore the dynamic robustness in actual PTNs of Beijing considering passenger flow behavior. Here, we study not only the bus stop network (BSN), but also the multimodal public transit network (MPTN) coupled with bus and urban rail transit systems, which will help us compare the PTNs’ robustness with different weighted structures. The paper is organized as follows. In the next section, we will make an analysis of the statistical properties of the weighted complex network of Beijing’s BSN and MPTN in L-space. In Section 3, a cascading failure analysis model for weighted network based on coupled map lattices is proposed, and, in Sections 4 and 5, the dynamic robustness of BSN and MPTN in Beijing is studied, respectively. Conclusions and outlook are given in Section 6.

#### 2. Statistical Properties of Weighted Complex Network Derived from Beijing Public Transit System in L-Space

##### 2.1. Data Processing and Networks Generation

In this work, the weighted complex network for public transit stops in Beijing’s bus and rail transit networks is built to explore the impact of connectivity between stops on passenger flow distribution. Here, we use the L-space method [5] to describe the network; that is, nodes represent bus, trolley bus, or rail stops, and a link between two nodes exists if they are consecutive stops on a route. The weight between node and node is represented by the sectional passenger flow that represents the number of passengers through the section between stop and adjacent stop in a weekday. Although the passenger flow is directed, in general, the daily flow is bidirectionally balanced for a whole day. For simplicity, we make the assumption that passenger flow is undirected () by averaging the in and out edge weights.

In Beijing’s bus transit network, a flat fare system is applied in most of bus routes, which means commuters only swipe the smart card one time when they board the buses, so it is difficult to capture the exact data about sectional occupational passengers through the intelligent card (IC) system. A good way to acquire this information is by the ride check. We obtained the ride-check data of 100 routes in a weekday from Beijing Public Transportation Corporation. These routes are so typical that they were selected to investigate, and, on each route, the occupational passengers of bus in each section along the route for more than 200 bus trips per day were counted. According to data of 100 routes, stops, and sectional passengers in Beijing, we develop a weighted bus stops network in the L-space with 1,388 nodes and 1,555 edges.

In the MPTN both for bus and rail stops, based on following methodology, the sectional passenger flow between two adjacent rail stops will be calculated in terms of passengers in and out of rail stops that are recorded by the IC system.

Firstly, we use the gravity model to estimate the origin and destination (OD) flow from stop to : where is the trip generation coefficient; is the passengers going into stop ; is the passengers out from stop ; denotes an impedance function from stop to stop ; is an impedance parameter. As a flat fare is also applied in the whole urban rail network without any transfer fee, here, is represented by the travel times between stops and , composed of the train running time, dwell time in stops, and transfer time in transfer stations. The train running time is estimated based on the distance between stops and average train running velocity; the dwell time and transfer time are obtained by historical data and field investigations, respectively.

Secondly, considering the travel times to be the impedance, we assign the OD flow between stops into the rail network by all-or-nothing assignment through the TransCAD (TransCAD is a commercial software package that performs various types of traffic assignment) software, and then the sectional passenger flow between adjacent stops is calculated. Thus, based on the topology and flow data of 13 rail lines and 100 bus routes, the weighted complex MPTN in the L-space is established with 1,504 nodes and 1,728 edges.

##### 2.2. Degree Distribution

In the L-space, the degree of a node represents the number of its consecutive neighbor stops it is linked to. It is calculated that the degree interval of MPTN in Beijing is , which is wider than that of BSN , although their average degrees are quite similar, and , indicating that the connectivity of MPTN has been improved in part because of the addition of the rail system. As shown in Figure 2(a), the degree distribution of BSN appears exponentially distributed and thus is small-world, which is consistent with Sui’s PTN analysis [40] and similar to the degree distribution exponent of the North American power grid; that is, [4]. However, for the MPTN (shown in Figure 2(b)), its degree distribution plot is nearly a straight line on a log-log scale (red dots) and follows a power-law distribution . So, the MPTN is scale-free after the bus stops network is coupled with the rail network. It shows that the topology of Beijing’s MPTN is much more heterogeneous than BSN, and some nodes are highly concentrated due to the limit of two-dimensional geographic space. This can be explained by the fact that the “rich get richer” phenomenon exists in PTNs just because bus routes tend to connect with rail stops.

**(a) BSN degree distribution**

**(b) MPTN degree distribution and its log-log scale plot**

##### 2.3. Strength Distribution

The strength of node is defined as [41]; thus, a stop’s strength in a PTN represents the average daily passenger flow passing the sections between this stop and its connected neighboring stops. Likewise, because of the rail system, the MPTN possesses wider node’s strength interval and higher average strength than that of BSN; and . As shown in Figure 3, there are long tails for strength distribution (blue dots) in both BSN and MPTN, especially in the latter, indicating that some stops transport quite large volume of passengers every day, which is much more than that of most stops. It is noted that the stop with large traffic may differ from the one with large degree. Not considering some stops with very small strengths in the BSN, both the strength distributions of BSN and MPTN on log-log scales are nearly linear and appear to follow power-law distributions with and , respectively. The MPTN’s power-law exponent is smaller than that of BSN, which reveals that the heterogeneity of MPTN has been enhanced when the bus network is coupled with the rail network. The strong heterogeneity of MPTN indicates that there are a few nodes called hubs in the network that have higher strength than other nodes and play a dominant role in preserving connections and serving traffic of the overall network. Such heterogeneity makes the scale-free network more robust to random failures but more vulnerable to deliberate attacks [9].

**(a) BSN strength distribution**

**(b) MPTN strength distribution**

In summary, we find that both the topology and flow distribution structures of MPTN show the scale-free features while the BSN is coupled with small-world topology and scale-free flow distribution, which could make them display different tolerance and robustness under random fault or intentional attack, so they will be further studied in the following sections.

#### 3. A Cascading Failure Analysis Based on Coupled Map Lattices

##### 3.1. A CMLs Model for Weighted Complex Network

A coupled map lattice (CML) is a dynamical system that models the behavior of nonlinear systems (especially partial differential equations) [42]. They are predominantly used to qualitatively study the chaotic dynamics of spatially extended systems. Studied systems include populations, convection, fluid flow, chemical reactions, and biological networks. More recently, CMLs have been applied to computational networks identifying detrimental attack methods and cascading failures. However, the current literature of cascading failure in CMLs is almost based on topological network [43–48], and there is few research on static weighted network [49, 50], not to mention ones in view of dynamic weight. In fact, in the real world, not only topology but also the flow distribution influences the cascading failure of the network. It is often to see that when the flow is beyond the carrying capacity, cascading failures occur, for example, in the urban transportation network, the Internet, and the power grid network. There are also similar cascading failures in a PTN; namely, the redistribution of passenger flow caused by failures in one or a few stops or sections could lead to overload or outage of other nodes and then result in the whole network’s failure. In a PTN, failures may be triggered by the change of network’s topology or the redistribution of passenger flow, whereas, when failures occur, the topology and passenger flow are affected at the same time, so the occurrence and spread of cascading failures are based on the network coupled with “topological structure” and “flow distribution structure.” Therefore, when the passenger flow is loaded on a topological PTN as the weight, it is significant to study the cascading failures and their dynamical behaviors in the weighted PTN which is represented by the coupling function between “topological structure” and “flow distribution structure” in different strength.

Here, we propose a model to describe the cascading failures in weighted networks based on a CML model presented by Wang and Xu [43, 44]. The model is demonstrated as follows: where is a state variable of the th node at the th time step. The connection information among nodes is given by the adjacency matrix . If there is an edge between node and node , ; otherwise, . denotes the degree of node ; represents the weight of edge between node and node ; is the strength of node . means the coupling strength of topological structure and represents that of weighted network which is loaded by passenger flow, respectively, where , . The function demonstrates the local dynamic behaviors which is chosen in this work as the chaotic logistic map, . When and , we use absolute value notation in (2) to guarantee that the state of each node is always nonnegative.

Here, the nonlinear function can be defined as the evolution rule of node ’s capacity. According to the mapping method of L-space, node is said to be in a normal state and its flow is smaller than its capacity at the th time step if , . In contrast, if , it means that the flow is overloaded on node at the th time step and then node is said to be failed, and we assume in this case that , . The state of a node evolves in accordance with the function, if the initial states of all nodes in the network are in the interval and there is not any external perturbation or the flow surges, then all nodes in the network will be in a normal state forever, and the PTN will operate normally.

##### 3.2. Methods for Analysis of Dynamic Robustness Based on CML Model

In order to show how an initial shock at a single node triggers cascading failures, we add an external perturbation to node at the th time step as follows:

In this case, node will be failed at the th time step; namely, stop of a PTN is out of operation due to natural events or other emergencies and then the topological structure will change accordingly and the passenger flow will be redistributed. Therefore, we have for all . At the ()th time step, the states of those nodes directly connected with node will be affected by according to (2), and their states may also be larger than 1 and thus may lead to a new round of nodes’ failures. Nodes’ failures will lead to a redistribution of the flow and spread out with a continued process.

The rule of flow redistribution is like this: when node failed, node and the edges connected with it will be excluded from the network, as shown in Figure 4, and , the weight of edge linked with node and the failed node , will be shared by other edges connected with node , so their original weights will be changed: ; these edges share the flow according to their weights: . Generally, this rule exists in real PTNs because passengers would be much more likely to choose the nearby transit services to escape from the confusion and accident as soon as possible when a stop or route suffers from disaster or attack.

During the spreading process of cascading failures, the problem needed to be studied is as follows: what is the relationship between the scale of cascading failures and the strength of external perturbation in real weighted PTNs? Is there any threshold to avoid the cascading failures? What is the relationship between the spread of cascading failures and different coupling strength of topology and flow distribution structures under different attacks? And what are the similarities and dissimilarities of the cascading failures in different PTN structures?

Before following simulations, the initial states of nodes are all chosen randomly from the interval . A perturbation with is added to a node . is defined as the total number of failed nodes in the network before the th time step, and failure proportion is the ratio of to the network’s scale . The failed nodes and failed edges are excluded from the network and flow is redistributed in terms of rule of Figure 4; then the spreading process of failures can be observed in the network. When there are no failures, is defined as the scale of the failures in the network, .

#### 4. Analysis of Cascading Failures in Beijing’s Weighted BSN

In Sections 4 and 5, we will take Beijing’s BSN and MPTN systems as cases, with consideration of modes of random fault and intentional attack, to analyze their tolerance and robustness with the above CMLs model for weighted network. In the following mode of random fault, all simulation results are averages over 50 random realizations.

##### 4.1. Threshold for Cascading Failure

###### 4.1.1. When a Randomly Chosen Node Fails

Here, under random fault, the thresholds to trigger global cascading failures in Beijing’s BSN are studied with and without flow redistribution, respectively, based on our CMLs model. Given , a perturbation is added to a randomly selected node. As shown in Figure 5(a), considering flow redistribution based on the rule shown in Figure 4, when , failures start to be triggered in the network; however, when not considering flow redistribution, the threshold becomes smaller (Figure 5(b)). It reflects that the passengers’ travel behaviors with autonomy and flexibility can reduce the risk of cascade failure in the BSN. At the same time, we find that since the topology of Beijing’s BSN is small-world and the weighted one is scale-free, the thresholds , are both relatively small, which is in accordance with the results of [43, 44] that cascading failures are much easier to occur in small-world and scale-free topological CMLs than in global CMLs.

**(a) Considering flow redistribution**

**(b) Without considering flow redistribution**

As shown in Figure 6, we find that there is a normal distribution relation between the scale and time step of cascading failures. When considering flow redistribution (Figure 6(a)), no matter how much changes, the failure is triggered earlier, peak times are concentrated in a smaller range , and nodes are all failed in an earlier time step , comparing with that without flow redistribution (Figure 6(b)). It implies that the flow redistribution has the potential to enhance the ability of synchronization in bus transit system.

**(a) Considering flow redistribution**

**(b) Without considering flow redistribution**

###### 4.1.2. When a Specified Node Is Intentionally Attacked

Here, an intentional perturbation is added to nodes with the largest degree or strength, respectively; namely, the most important stations are intentionally attacked in the BSN, which are Guang’anmennei station with and Military Museum station with . Similarly, we set . When the stop with the largest degree is attacked (Figure 7(a)), considering flow redistribution, the threshold of failure is , which is smaller than that of the stop with the largest strength, (Figure 8(a)), indicating that the topology is more vulnerable than the flow distribution structure. The threshold is less than or equal to that of random fault; namely, , but , revealing that topological structure is more vulnerable against intentional attack, but that of the flow distribution structure surprisingly keeps the same robustness against random fault or intentional attack. We also find that the thresholds of degree-based and strength-based attacks are the same with those of the case without considering flow redistribution, respectively (Figures 7(b) and 8(b)), which reflects that when the most central nodes in the network are intentionally attacked, though passengers can change their travel routes, the flow changes in a small scope are not sufficient to reduce the impact of failures because the damage is very huge and failures spread much faster.

**(a) Considering flow redistribution**

**(b) Without considering flow redistribution**

**(a) Considering flow redistribution**

**(b) Without considering flow redistribution**

The further analysis of Figure 7(a) presents that when the degree-based attack occurs and , there is a diversity for the failure proportion distribution and peak time with the change of . When the perturbation is small, that is, , the failures do not spread very quickly at first until and there is a turning point that the failures increase sharply, before which there could be a good opportunity to control failure to spread further; but when , it seems that the spreading processes are synchronized with different , and the peak proportions are all at a similar peak time . However, when the strength-based attack triggers failures (Figure 8(a)), the spreading speeds are similar for different values, and the peak proportions are in a quite small time interval , indicating that once failure is triggered, the perturbation strength has little effect on the failure spreading process for the weighted BSN.

##### 4.2. Effect of Flow Coupling Coefficient

The following will study the impacts of different flow coupling coefficients on the robustness of Beijing’s BSN. Firstly, a perturbation is added to a randomly selected node with and taking the values of 0.15, 0.25, 0.35, 0.45, and 0.55, respectively. Both Figures 9(a) and 9(b) show that, on the whole, with increasing, the failures occur earlier and spread faster with and without flow redistribution. However, when considering passengers change their travel routes, has less influence on spreading processes of failures (shown in Figure 9(a)) comparing with that without flow redistribution (shown in Figure 9(b)), and there is less diversity between the initial occurrence times or spreading speeds of failures with different . In addition, as shown in Figure 9(a), the failures spread faster. These characteristics imply that, because of the flow redistribution in network, it is equivalent to increasing the coupling strength further between other stops and then promoting the spread of failure. It is important to note that when , the peak proportion with flow redistribution is smaller than that of without it, indicating that flexibility of passengers’ travel behaviors will be likely to alleviate the damage of perturbation under a small flow coupling strength.

**(a) Considering flow redistribution**

**(b) Without considering flow redistribution**

For the case of intentional attack, with the same parameter set as the above, a perturbation and is added to the node with the largest degree or strength, respectively. The simulations (shown in Figure 10) show that whether the stop with the largest degree or strength is intentionally attacked, the spreading processes of failures are almost synchronized for different ; that is, the peak times all occur in a small range , and their failure proportions are and , respectively, which reflects that although the topological network is small-world and the flow distribution is scale-free, the flow dynamic behaviors may nearly eliminate the cascading difference between these two structures. The time step that all of nodes are failed is when the largest degree stop is attacked, which is later than that of the largest strength one; that is, , but they are both earlier than that in the mode of random fault , revealing that the spreading process is the most intense when the largest strength node is intentionally attacked.

**(a) Node with the largest degree is intentionally attacked**

**(b) Node with the largest strength is intentionally attacked**

##### 4.3. Effect of Topological Coupling Coefficient

Here, we study the impacts of different topological coupling coefficients on the network. Assume that , and takes the values of 0.15, 0.25, 0.35, 0.45, and 0.55, respectively. When a perturbation is added to a randomly selected node, according to Figure 11, we find that when considering flow redistribution, the spreading process of failures is much consistent and less diverse compared with that without flow redistribution, and both the failure peak times and proportions occur in a small range. It shows that, in random fault mode, because of the coupling function by flow redistribution, the impact of topological coupling strength on the spreading process of failure has been mitigated.

**(a) Considering flow redistribution**

**(b) Without considering flow redistribution**

When the node with the largest degree or strength is intentionally attacked, as shown in Figure 12, if , the failures spread more slowly correspondingly, and there are some fluctuations for failure proportion at certain time steps, unlike other cases which failures always increase before the peak; and the time that reaches the failure peak under the degree-based attack (Figure 12(a)) is later than that of strength-based attack, (Figure 12(b)). However, when and , the spreading processes are nearly consistent for these two attacks; that is, the peak times are and the peak proportion for degree-based attack is and for strength-based is ; the times when all nodes fail are and , respectively, which are also earlier than that of random fault mode. To sum up, when , intentional attack to the most central node in weighted BSN (strength-based attack) will trigger a more intense spreading process of failure than that in the topology (degree-based attack); but when , hardly does influence the failure occurrence time, spreading speed, and scale, implying that, in this case, to optimize the flow distribution structure, for example, by making it more homogenous or evacuating the passengers in the most central stop, maybe is much more significant since the topological coupling strength has little impact on the cascade while the flow redistribution can influence the spread of failure.

**(a) Node with the largest degree is intentionally attacked**

**(b) Node with the largest strength is intentionally attacked**

#### 5. Analysis of Cascading Failures in Beijing’s Weighted MPTN

##### 5.1. Threshold for Cascading Failure

Here, the thresholds for cascading failures in MPTN are studied with consideration of flow redistribution, and the parameters are set the same as those in Section 4.1. As shown in Figure 13, in the random fault mode, when , failures start to be triggered in the network, representing the fact that the threshold of MPTN is smaller than that of BSN . It reveals that the MPTN is more vulnerable than that of BSN under random fault, because both the topology and flow distribution of MPTN display much more heterogeneity according to our analysis in Sections 2.2 and 2.3, which is consistent with earlier works on cascading failures [21, 44], where it has been shown that large-scale cascading failures are much less likely to happen in a homogeneous network than in a heterogeneous network. In addition, as shown in Figure 13(b), when , the initial occurrence time of failure becomes earlier while peak proportion could be smaller with the increase of ; for example, or 5, indicating that the perturbation strength is not linear with the peak failure.

**(a) Spreading process of failures**

**(b) Relationship between failure scale and time step**

When the node with the largest degree or strength is attacked, respectively (Figure 14), that is, Sanyuanqiao station with and Jianguomen station with , the thresholds of failures in MPTN are the same as . Also, they are the same with BSN under strength-based attack , larger than BSN under degree-based attack , and even larger than itself under random fault , which implies that, because of the flow redistribution and the coupling function with two transit modes of bus and rail, though the most important station is attacked, the ability of MPTN to resist perturbation can be surprisingly improved. At the same time, we find that, unlike BSN, since both topology and flow structures of MPTN are more heterogeneous, whether the node with the largest degree or strength is attacked, the initial failure is much more easily triggered with the increase of , and failure spreads faster than that of random fault mode. It also shows that the spreading process under strength-based attack is much faster and more intense than that under degree-based attack, as the flow distribution of MPTN is much more heterogeneous than the topology.

**(a) Node with the largest degree is intentionally attacked**

**(b) Node with the largest strength is intentionally attacked**

##### 5.2. Effect of Flow Coupling Coefficient

As shown in Figure 15, a perturbation is added to a randomly chosen node. When , failure spreads more slowly than those with other values of , and the peak comes later; its proportion is smaller or equal to those with other values of (), indicating there could be an opportunity to control the cascading failure. We also find that, unlike BSN, there is no trend showing that is linearly correlated with time step and failure proportion in the MPTN, and when increases, the dynamic flow redistribution in the network even can delay the failure initial time and reduce the peak scale because of the heterogeneity of MPTN.

**(a) Spreading process of failures**

**(b) Relationship between failure scale and time step**

When the node with the largest degree is attacked (shown in Figure 16(a)), as is being kept at the same value, there is a threshold , which means that when or , no matter how much changes, the spreading processes of failures present two synchronous curves, and the spreading processes with and those with are spectacularly consistent; at the same time, Figure 16(a) indicates that the failure initial times are earlier and the average peaks of failures are larger with than those with .

**(a) Node with the largest degree is intentionally attacked**

**(b) Node with the largest strength is intentionally attacked**

This weak sensitivity of effect on cascading failure from becomes more prominent when the largest strength node is attacked. As shown in Figure 16(b), the spreading processes are always the same and totally not affected by values. According to the relationship between failure scale and time step, under strength-based attack, the cascading failure is much more intense than that under degree-based attack, and the failure peak occurs much earlier; that is, (when ) or 21 (when ), with higher peak value (when ) or 0.072 (when ); the time of network failed globally is also earlier: , which is also earlier than the time in random fault.

##### 5.3. Effect of Topological Coupling Coefficient

In random fault mode, as shown in Figure 17, similar to BSN, with consideration of flow redistribution, has less effect on the spreading processes of failures in MPTN with different values, and the peak times and peak proportions of failures appear in a small range; that is, and . Notably, as shown in Figure 17(b), when a large value of is set as , the failure peak time is relatively late and its proportion is the smallest, indicating that the flow redistribution in a topology with high coupling strength may play a role to relieve the impact of cascading failure.

**(a) Spreading process of failures**

**(b) Relationship between failure scale and time step**

Figure 18 plots the spreading process of cascading failure when the node with the largest degree is intentionally attacked with different and or . We find that there is a threshold of , namely, when , whatever increases, the spreading processes reach a synchronization; meanwhile, when , the initial times of failures are earlier than those when , and the average peak proportion is also relatively larger. Likewise, under strength-based attack (shown in Figure 19), there is also a synchronization for spreading process with a threshold and when , the initial and peak times of failures are earlier and the peak value is larger.

**(a) When**

**(b) When , relationship between failure scale and time step**

Similarly, we find that, no matter how topological coupling strength changes, the spreading process of cascading failure is the most intense when the node with the largest strength is attacked; the threshold in the case that the synchronization of cascade occurs is smaller than that of when the largest degree one is attacked; after occurrence of synchronization, the peak time under strength-based attack is earlier than that of under degree-based attack, and the peak proportion is higher: . It reveals that when the most important station in a weighted network is attacked, even though the topology is not coupled so much, the MPTN will suffer much heavier damage, as both of its topology and flow distribution structures are scale-free, which is consistent with the conclusions of [2, 43, 44].

#### 6. Conclusions

In summary, we find that both weighted BSN and MPTN in Beijing are scale-free networks while the topology of the former is small-world and that of the latter is scale-free, which make them show different robustness against different kind of faults or attacks. According to the thresholds for cascading failures, we find that when considering the dynamic flow behavior, the network displays a higher tolerance against random fault than that without flow redistribution. Particularly, in the weighted PTN based on passenger flow as a scale-free network, even the station with the largest strength is intentionally attacked; because of the dynamic flow redistribution, the network displays a surprisingly increasing degree of robustness compared with topological network with small-world structure against intentional attack, or even with scale-free one against random fault. This should encourage the development of multimodal transit networks in large metropolitan areas. It is the passengers’ choice behaviors that play an important role to improve the robustness of PTN. It can explain why real PTNs rarely suffer complete breakdowns despite frequent disruptions from natural and man-made disasters.

However, once cascading failures are triggered in the network, we find that when the station with the largest strength is intentionally attacked, the damage to the network is much heavier than that of the largest degree-based attack, also, heavier than that of a randomly chosen node failed. This reminds us that we should pay more attention to the most central node (station), that is, the one with the largest strength in a weighted network to control the cascading failure, since the control window is short when cascading failure occurs. As the weighted PTN in Beijing is a scale-free network, these characteristics of vulnerability are consistent with the discoveries of Motter [21].

In essence, the flow redistribution has the ability to promote the synchronization during the spread of failure. Under intentional attack, although there is a certain degree of diversity for the spreading process with different topological coupling strength , some synchronizations tend to occur. However, the flow coupling strength has little impact on the failure spread, especially for strength-based attack, and the synchronizations are much more likely to appear, indicating that when the most important station in the weighted PTN is attacked, the dynamic changes and redistribution of passenger flow can intensify the spreading process of cascading failure, no matter how much the initial flow is coupled. Fortunately, we can find some key thresholds of and that lead to synchronizations or make the cascading failure be triggered later or spread more slowly, which will help us find strategies to contain the spreading and avoid further damage.

The flow redistribution behavior adopted in this work is still primitive. More realistic behavior adaptations of major failures in transportation systems, such as the global redistribution of OD flows, should be explored. In addition, we only considered failures in nodes, while in the real world, failures in links also exist. When a route or route link that goes through a node fails, the node (and all connecting edges) does not necessarily have to be excluded from the network but only the failed links. Link failures in transportation system will be explored in our future study. Last but not least, further studies to better understand the complicated intrinsic properties of cascading failures and the essence of synchronization in weighted complex public transit networks are also worth pursuing.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work is supported in part by the Fundamental Research Funds for the Central Universities of China (Approval no. 2014JBM071), the Major State Basic Research Development Program of China (973 Program) (Grant no. 2012CB725403-5), the Key Program of National Natural Science Foundation of China (Grant no. 71131001-2), and China Scholarship Council (no. 201207095022).

#### References

- D. J. Watts and S. H. Strogatz, “Collective dynamics of “small-world” networks,”
*Nature*, vol. 393, no. 6684, pp. 440–442, 1998. View at: Publisher Site | Google Scholar - A. Barabási and R. Albert, “Emergence of scaling in random networks,”
*Science*, vol. 286, no. 5439, pp. 509–512, 1999. View at: Publisher Site | Google Scholar | MathSciNet - V. Latora and M. Marchiori, “Is the Boston subway a small-world network?”
*Physica A*, vol. 314, no. 1, pp. 109–113, 2002. View at: Publisher Site | Google Scholar - K. A. Seaton and L. M. Hackett, “Stations, trains and small-world networks,”
*Physica A*, vol. 339, no. 3-4, pp. 635–644, 2004. View at: Publisher Site | Google Scholar | MathSciNet - P. Sen, S. Dasgupta, A. Chatterjee, P. A. Sreeram, G. Mukherjee, and S. S. Manna, “Small-world properties of the Indian railway network,”
*Physical Review E*, vol. 67, no. 3, Article ID 036106, 5 pages, 2003. View at: Google Scholar - Y. Wang, T. Zhou, J. Shi, J. Wang, and D. He, “Empirical analysis of dependence between stations in Chinese railway network,”
*Physica A*, vol. 388, no. 14, pp. 2949–2955, 2009. View at: Publisher Site | Google Scholar - J. Sienkiewicz and J. A. Holyst, “Statistical analysis of 22 public transport networks in Poland,”
*Physical Review E*, vol. 72, no. 4, Article ID 046127, 11 pages, 2005. View at: Google Scholar - C. Von Ferber, T. Holovatch, Y. Holovatch, and V. Palchykov, “Public transport networks: empirical analysis and modeling,”
*The European Physical Journal B*, vol. 68, no. 2, pp. 261–275, 2009. View at: Publisher Site | Google Scholar - R. Albert, H. Jeong, and A.-L. Barabási, “Error and attack tolerance of complex networks,”
*Nature*, vol. 406, no. 6794, pp. 378–382, 2000. View at: Publisher Site | Google Scholar - P. Holme, B. J. Kim, C. N. Yoon, and S. K. Han, “Attack vulnerability of complex networks,”
*Physical Review E*, vol. 65, no. 5, Article ID 056109, 14 pages, 2002. View at: Publisher Site | Google Scholar - H. Jeong, S. P. Mason, A.-L. Barabási, and Z. N. Oltvai, “Lethality and centrality in protein networks,”
*Nature*, vol. 411, no. 6833, pp. 41–42, 2001. View at: Publisher Site | Google Scholar - J. A. Dunne, R. J. Williams, and N. D. Martinez, “Network structure and biodiversity loss in food webs: robustness increases with connectance,”
*Ecology Letters*, vol. 5, no. 4, pp. 558–567, 2002. View at: Publisher Site | Google Scholar - M. E. J. Newman, S. Forrest, and J. Balthrop, “Email networks and the spread of computer viruses,”
*Physical Review E*, vol. 66, no. 3, Article ID 035101, 4 pages, 2002. View at: Publisher Site | Google Scholar - R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin, “Resilience of the Internet to random breakdowns,”
*Physical Review Letters*, vol. 85, no. 21, pp. 4626–4628, 2000. View at: Publisher Site | Google Scholar - R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin, “Breakdown of the internet under intentional attack,”
*Physical Review Letters*, vol. 86, no. 16, pp. 3682–3685, 2001. View at: Publisher Site | Google Scholar - B. K. Mishra and A. K. Singh, “Two quarantine models on the attack of malicious objects in computer network,”
*Mathematical Problems in Engineering*, vol. 2012, Article ID 407064, 13 pages, 2012. View at: Publisher Site | Google Scholar | MathSciNet - M. Li and W. Zhao, “Visiting power laws in cyber-physical networking systems,”
*Mathematical Problems in Engineering*, vol. 2012, Article ID 302786, 13 pages, 2012. View at: Publisher Site | Google Scholar - M. Hua, P. Cheng, J. Fei, J. Zhang, and J. Chen, “Network-based robust ${H}_{\infty}$ filtering for the uncertain systems with sensor failures and noise disturbance,”
*Mathematical Problems in Engineering*, vol. 2012, Article ID 945271, 19 pages, 2012. View at: Publisher Site | Google Scholar | MathSciNet - M. Li and W. Zhao, “On $1/f$ noise,”
*Mathematical Problems in Engineering*, vol. 2012, Article ID 673648, 23 pages, 2012. View at: Publisher Site | Google Scholar | MathSciNet - V. Latora and M. Marchiori, “Efficient behavior of small-world networks,”
*Physical Review Letters*, vol. 87, no. 19, Article ID 198701, 4 pages, 2001. View at: Google Scholar - A. E. Motter and Y. Lai, “Cascade-based attacks on complex networks,”
*Physical Review E*, vol. 66, no. 6, Article ID 065102, 4 pages, 2002. View at: Publisher Site | Google Scholar - J. Wang and L. Rong, “Cascade-based attack vulnerability on the US power grid,”
*Safety Science*, vol. 47, no. 10, pp. 1332–1336, 2009. View at: Publisher Site | Google Scholar - Y. Xia, J. Fan, and D. Hill, “Cascading failure in Watts-Strogatz small-world networks,”
*Physica A*, vol. 389, no. 6, pp. 1281–1285, 2010. View at: Publisher Site | Google Scholar - M. Babaei, H. Ghassemieh, and M. Jalili, “Cascading failure tolerance of modular small-world networks,”
*IEEE Transactions on Circuits and Systems II*, vol. 58, no. 8, pp. 527–531, 2011. View at: Publisher Site | Google Scholar - J. Wang and L. Rong, “Edge-based-attack induced cascading failures on scale-free networks,”
*Physica A*, vol. 388, no. 8, pp. 1731–1737, 2009. View at: Publisher Site | Google Scholar - B. Mirzasoleiman, M. Babaei, M. Jalili, and M. Safari, “Cascaded failures in weighted networks,”
*Physical Review E*, vol. 84, no. 4, Article ID 046114, 8 pages, 2011. View at: Publisher Site | Google Scholar - S. V. Buldyrev, R. Parshani, G. Paul, H. E. Stanley, and S. Havlin, “Catastrophic cascade of failures in interdependent networks,”
*Nature*, vol. 464, no. 7291, pp. 1025–1028, 2010. View at: Publisher Site | Google Scholar - C. von Ferber, T. Holovatch, and Y. Holovatch, “Attack vulnerability of public transport networks,” in
*Traffic and Granular Flow '07*, pp. 721–731, Springer, Berlin, Germany, 2007. View at: Google Scholar - B. Berche, C. Von Ferber, T. Holovatch, and Y. Holovatch, “Resilience of public transport networks against attacks,”
*The European Physical Journal B*, vol. 71, no. 1, pp. 125–137, 2009. View at: Publisher Site | Google Scholar - R. Dorbritz and U. Weidmann, “Stability of public transportation systems in case of random failures and intended attacks-a case study from Switzerland,” in
*Proceedings of the 4th IET International Conference on Systems Safety Incorporating the SaRS Annual Conference*, pp. 1–6, 2009. View at: Google Scholar - J. Zhang, X. Xu, L. Hong, S. Wang, and Q. Fei, “Networked analysis of the Shanghai subway network, in China,”
*Physica A*, vol. 390, no. 23-24, pp. 4562–4570, 2011. View at: Publisher Site | Google Scholar - Y. Dang, F. Ding, and F. Gao, “Empirical analysis on flight flow network survivability of China,”
*Journal of Transportation Systems Engineering and Information Technology*, vol. 12, no. 6, pp. 177–185, 2012. View at: Google Scholar - J. J. Wu, Z. Y. Gao, and H. J. Sun, “Model for dynamic traffic congestion in scale-free networks,”
*Europhysics Letters*, vol. 76, no. 5, pp. 787–793, 2006. View at: Publisher Site | Google Scholar - J. J. Wu, H. J. Sun, and Z. Y. Gao, “Cascading failures on weighted urban traffic equilibrium networks,”
*Physica A*, vol. 386, no. 1, pp. 407–413, 2007. View at: Publisher Site | Google Scholar - J. Zheng, Z. Gao, and X. Zhao, “Modeling cascading failures in congested complex networks,”
*Physica A*, vol. 385, no. 2, pp. 700–706, 2007. View at: Publisher Site | Google Scholar - X. Yang, B. Wang, S. Chen, and W. Wang, “Epidemic dynamics behavior in some bus transport networks,”
*Physica A*, vol. 391, no. 3, pp. 917–924, 2012. View at: Publisher Site | Google Scholar - K. Lee, W. Jung, J. S. Park, and M. Y. Choi, “Statistical analysis of the Metropolitan Seoul Subway System: network structure and passenger flows,”
*Physica A*, vol. 387, no. 24, pp. 6231–6234, 2008. View at: Publisher Site | Google Scholar - H. Soh, S. Lim, T. Zhang et al., “Weighted complex network analysis of travel routes on the Singapore public transportation system,”
*Physica A*, vol. 389, no. 24, pp. 5852–5863, 2010. View at: Publisher Site | Google Scholar - A. L. Huang, W. Guan, B. H. Mao, and G. Z. Zang, “Statistical analysis of weighted complex network in Beijing Public Transit Routes System based on passenger flow,”
*Journal of Transportation Systems Engineering and Information*, vol. 13, no. 6, pp. 198–204, 2013. View at: Google Scholar - Y. Sui, F. Shao, R. Sun, and S. Li, “Space evolution model and empirical analysis of an urban public transport network,”
*Physica A*, vol. 391, no. 14, pp. 3708–3717, 2012. View at: Publisher Site | Google Scholar - A. Barrat, M. Barthélemy, R. Pastor-Satorras, and A. Vespignani, “The architecture of complex weighted networks,”
*Proceedings of the National Academy of Sciences of the United States of America*, vol. 101, no. 11, pp. 3747–3752, 2004. View at: Publisher Site | Google Scholar - K. Kaneko, “Overview of coupled map lattices,”
*Chaos*, vol. 2, no. 3, pp. 279–282, 1992. View at: Publisher Site | Google Scholar | PubMed | MathSciNet - X. F. Wang and J. Xu, “Cascading failures in coupled map lattices,”
*Physical Review E*, vol. 70, no. 5, Article ID 056113, 2004. View at: Google Scholar - J. Xu and X. F. Wang, “Cascading failures in scale-free coupled map lattices,”
*Physica A*, vol. 349, no. 3-4, pp. 685–692, 2005. View at: Publisher Site | Google Scholar - D. Cui, Z. Gao, and X. Zhao, “Cascades in small-world modular networks with CML'S method,”
*Modern Physics Letters B*, vol. 21, no. 30, pp. 2055–2062, 2007. View at: Publisher Site | Google Scholar | Zentralblatt MATH - D. Cui, Z. Gao, and X. Zhao, “Cascades with coupled map lattices in preferential attachment community networks,”
*Chinese Physics B*, vol. 17, no. 5, pp. 1703–1708, 2008. View at: Publisher Site | Google Scholar - Z. J. Bao, Y. J. Cao, L. J. Ding, G. Z. Wang, and Z. X. Han, “Synergetic behavior in the cascading failure propagation of scale-free coupled map lattices,”
*Physica A*, vol. 387, no. 23, pp. 5922–5929, 2008. View at: Publisher Site | Google Scholar - C. Di, G. Zi-You, and Z. Jian-Feng, “Tolerance of edge cascades with coupled map lattices methods,”
*Chinese Physics B*, vol. 18, no. 3, pp. 992–996, 2009. View at: Publisher Site | Google Scholar - X. G. Chen, J. Zhou, and Z. T. Zhu, “Cascading failures study of urban traffic system based on CML,”
*Mathematics in Practices and Theory*, vol. 39, no. 7, pp. 79–84, 2009. View at: Google Scholar - X. B. Lu and B. Z. Qin, “Cascading failures in weighted heterogeneous coupled map lattices,” in
*Proceedings of the 1st International Conference on Sustainable Power Generation and Supply (SUPERGEN '09)*, pp. 1–4, April 2009. View at: Publisher Site | Google Scholar

#### Copyright

Copyright © 2015 Ailing Huang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.