Improving interdependent networks robustness by adding connectivity links

Ji, Xingpei; Wang, Bo; Liu, Dichen; Guo, Chen; Tang, Fei; Wei, Daqian; Tu, Lian

doi:10.1016/j.physa.2015.10.010

Cited by 85 publications

(53 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An interdependent network is generally composed of two or more layers such as an infrastructure connection network and an operation association network. The interdependent relationship among the subnetworks makes the failure of any subnetwork potentially affect its interdependent network and further feedback to the failure source network through the interaction among subnetworks, i.e., the cascading failures of an interdependent network [112][113][114][115][116]. An example among the real world networks is that, in 2015, the power grids in various regions of Ukraine were attacked by hackers, the control servers of the underlying generators or substations were shut down, and the sensing and control functions of the corresponding physical devices were lost, resulting in the operational disruptions of some devices.…”

Section: Dynamic Resilience Of Interdependent Ptnmentioning

confidence: 99%

A Review and Prospect for the Complexity and Resilience of Urban Public Transit Network Based on Complex Network Theory

Zhang

Lü

et al. 2018

Complexity

View full text Add to dashboard Cite

The complexity and resilience of urban public transit network (PTN) are the interdisciplinary study area between transportation engineering and system science, which is a good demonstration of applying complex network theory to promote the development of engineering science. The deep understanding of this study helps to provide a new perspective for analyzing the reliability of urban PTN. Following study process of the complexity and resilience of complex network, this paper reviews the complexity and resilience of PTN from four topics, i.e., the PTN complexity, the static resilience of PTN, the dynamic resilience (cascading failures based resilience) of single layered PTN, and the dynamic resilience of interdependent PTN. In the literature review, multiple key items are, respectively, extracted for each topic, and the engineering applicability of each topic is also analyzed, which are both for obtaining the key features of this study area. Finally, in order to realize the development trend of cyclic and forward—complex network theory, network resilience theory, transforming into a realistic model and method that is close to actual public transit operation, engineering application and practice, and contributing to complex network theory, the study status is summarized and the future development trend is prospected.

show abstract

Section: Dynamic Resilience Of Interdependent Ptnmentioning

confidence: 99%

A Review and Prospect for the Complexity and Resilience of Urban Public Transit Network Based on Complex Network Theory

Zhang

Lü

et al. 2018

Complexity

View full text Add to dashboard Cite

show abstract

“…Centrality has numerous measures for finding the influential users. Degree centrality [17] is the first measure, defined as the number of direct neighbors of any vertex or node. It measures the density of a graph.…”

Section: Social Network Measuresmentioning

confidence: 99%

Ranking Authors in an Academic Network Using Social Network Measures

et al. 2018

View full text Add to dashboard Cite

Online social networks are widely used platforms that enable people to connect with each other. These social media channels provide an active communication platform for people, and they have opened new venues of research for the academic world and business. One of these research areas is measuring the influential users in online social networks; and the same is true for academic networks where finding influential authors is an area of interest. In an academic network, citation count, h-index and their variations are used to find top authors. In this article, we propose the adoption of established social network measures, including centrality and prestige, in an academic network to compute the rank of authors. For the empirical analysis, the widely-used dataset of the Digital Bibliography and Library Project (DBLP) is exploited in this research, and the micro-level properties of the network formed in the DBLP co-authorship network are studied. Afterwards, the results are computed using social network measures and evaluated using the standard ranking performance evaluation measures, including Kendall correlation, Overlapping Similarlity (OSim) and Spearman rank-order correlation. The results reveal that the centrality measures are significantly correlated with the citation count and h-index. Consequently, social network measures have potential to be used in an academic network to rank the authors.

show abstract

“…A rich body of link addition strategies have been proposed both in single network [31] and interdependent networks [32][33][34][35]. For instance, Stippinger et al [30] develop a dynamic healing model for the competition between the cascading failures and the healing that bridge functioning neighbors of failed node by add new connectivity links.…”

Section: Introductionmentioning

confidence: 99%

The Effective Healing Strategy against Localized Attacks on Interdependent Spatially Embedded Networks

Gong

Liu

et al. 2019

Complexity

View full text Add to dashboard Cite

Many real infrastructure networks, such as power grids and communication networks, are not only depend on one another to function, but also embedded in space. A lot of works have been devoted to reveal the vulnerability of interdependent spatially embedded networks considers random failures. However, recently research show that they are susceptible to geographically localized attacks or failures cased by natural disasters or terrorist attacks, which affect all nodes within a given radius. In particular, small localized attacks may lead to catastrophic consequences. As a remedy of the collapse instability, one research introduced a dynamic healing strategy and the possibility of new connectivity link with a probability, called random healing, to bridge two remaining neighbors of a failed node. The random strategy is straightforward. Here, unlike previous strategy, we propose a simple but effective strategy, called healing strategy by prioritizing minimum degree(HPMD), which establishing a new link between two functioning neighbors with minimum degree during the cascading failures. In addition, we consider the distance between two nodes to avoid change the network structures. Afterwards, a comparison is made between HPMD and three healing strategies: random, degree centrality and local centrality to identify which a pair of neighbors have high priority. Simulation experiments are presented for two square lattices with the same size as interdependent spatially embedded networks under localized attacks. Results demonstrated that HPMD strategy has an outstanding performance against localized attacks, even when ratio of healing is vary. Moreover, HPMD is more timely, more applicability and costless. Our method is meaningful in practice as it can greatly enhance the resilience and robustness of interdependent spatially embedded networks against localized attacks, and eradicate catastrophic collapse in spatial system. keywords: interdependent spatially embedded networks, localized attacks, cascading failures, healing strategy corresponding

show abstract

Improving interdependent networks robustness by adding connectivity links

Cited by 85 publications

References 38 publications

A Review and Prospect for the Complexity and Resilience of Urban Public Transit Network Based on Complex Network Theory

A Review and Prospect for the Complexity and Resilience of Urban Public Transit Network Based on Complex Network Theory

Ranking Authors in an Academic Network Using Social Network Measures

The Effective Healing Strategy against Localized Attacks on Interdependent Spatially Embedded Networks

Contact Info

Product

Resources

About