Network Science 2010
DOI: 10.1007/978-1-84996-396-1_2
|View full text |Cite
|
Sign up to set email alerts
|

Resistance Distance, Information Centrality, Node Vulnerability and Vibrations in Complex Networks

Abstract: We discuss three seemingly unrelated quantities that have been introduced in different fields of science for complex networks. The three quantities are the resistance distance, the information centrality and the node displacement. We first prove various relations among them. Then we focus on the node displacement, showing its usefulness as an index of node vulnerability. We argue that the node displacement has a better resolution as a measure of node vulnerability than the degree and the information centrality. Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(10 citation statements)
references
References 35 publications
(57 reference statements)
0
10
0
Order By: Relevance
“…Interesting connections between message passing algorithms and electrical networks are discussed in [11]. In fact, electrical networks have also been put in connection with social networks, especially because of the notion of resistance distance [5].…”
Section: A Related Workmentioning
confidence: 99%
“…Interesting connections between message passing algorithms and electrical networks are discussed in [11]. In fact, electrical networks have also been put in connection with social networks, especially because of the notion of resistance distance [5].…”
Section: A Related Workmentioning
confidence: 99%
“…Furthermore, we have studied the Laplacian eigenvalue spectrum and the scaling of the second largest eigenvalue with system size, finding that the two systems are compatible. Using the findings from [14,29] we can infer that the structure of vibrational modes and relaxation properties produced by the model are similar to those found in biological proteins.…”
Section: Discussionmentioning
confidence: 63%
“…As two additional features roughly characterizing the dynamic properties of protein residue networks, we consider the distribution and scaling of Laplacian eigenvalues. The Laplacian of a network captures both its interaction topology and its relaxation and vibration properties [14,29]. If the PRN were made only of the central atoms, the Laplacian would exactly quantify the networks vibrational and relaxational modes.…”
Section: Distribution and Scaling Of Laplacian Eigenvaluesmentioning
confidence: 99%
“…This section will introduce a cyber‐physical technique to measure the grids risk to cyberattack based on the proposed security graph and contingency rankings. Graph resistance method has been applied to analyse the previously proposed algorithms to quantify the system vulnerability [34]. As identified in [11], attack difficulty is based on the length and quantity of paths between attackers and defenders.…”
Section: Attack Analysis Metricsmentioning
confidence: 99%
“…Previously, a very few works considered closeness centrality and betweenness centrality to find the criticality of the substation [20,36]. In this paper, the resistance distance is used as an index of node vulnerability to quantify an attack difficulty to travel various paths where a larger resistance distance is less vulnerable due to increased effort required for the attacker to traverse the security mechanisms [34]. Also, resistance distance acts as a key performance measure to study the robustness of a graph network when we have security mechanism insertion and/or removal.…”
Section: Resistance Distancementioning
confidence: 99%