scholarly journals Rank correlation between centrality metrics in complex networks: an empirical study

Open Physics ◽  
2018 ◽  
Vol 16 (1) ◽  
pp. 1009-1023 ◽  
Author(s):  
Chengcheng Shao ◽  
Pengshuai Cui ◽  
Peng Xun ◽  
Yuxing Peng ◽  
Xinwen Jiang
Keyword(s):  
Pearson Correlation ◽  
Rank Correlation ◽  
Low Complexity ◽  
Middle Level ◽  
High Complexity ◽  
Computation Complexity ◽  
Scale Free ◽  
Centrality Metrics ◽  
Scale Free Networks ◽  
Better Than

Abstract Centrality is widely used to measure which nodes are important in a network. In recent decades, numerous metrics have been proposed with varying computation complexity. To test the idea that approximating a high-complexity metric by a low-complexity metric, researchers have studied the correlation between them. However, these works are based on Pearson correlation which is sensitive to the data distribution. Intuitively, a centrality metric is a ranking of nodes (or edges). It would be more reasonable to use rank correlation to do the measurement. In this paper, we use degree, a low-complexity metric, as the base to approximate three other metrics: closeness, betweenness, and eigenvector. We first demonstrate that rank correlation performs better than the Pearson one in scale-free networks. Then we study the correlation between centrality metrics in real networks, and find that the betweenness occupies the highest coefficient, closeness is at the middle level, and eigenvector fluctuates dramatically. At last, we evaluate the performance of using top degree nodes to approximate three other metrics in the real networks. We find that the intersection ratio of betweenness is the highest, and closeness and eigenvector follows; most often, the largest degree nodes could approximate largest betweenness and closeness nodes, but not the largest eigenvector nodes.

scholarly journals Scale-Free Networks with the Same Degree Distribution: Different Structural Properties

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
José H. H. Grisi-Filho ◽  
Raul Ossada ◽  
Fernando Ferreira ◽  
Marcos Amaku
Keyword(s):  
Structural Properties ◽  
Degree Distribution ◽  
Pearson Correlation ◽  
Clustering Coefficient ◽  
The Other ◽  
Scale Free ◽  
Component Size ◽  
Global Efficiency ◽  
Nearest Neighbours ◽  
Scale Free Networks

We have analysed some structural properties of scale-free networks with the same degree distribution. Departing from a degree distribution obtained from the Barabási-Albert (BA) algorithm, networks were generated using four additional different algorithms (Molloy-Reed, Kalisky, and two new models named A and B) besides the BA algorithm itself. For each network, we have calculated the following structural measures: average degree of the nearest neighbours, central point dominance, clustering coefficient, the Pearson correlation coefficient, and global efficiency. We found that different networks with the same degree distribution may have distinct structural properties. In particular, model B generates decentralized networks with a larger number of components, a smaller giant component size, and a low global efficiency when compared to the other algorithms, especially compared to the centralized BA networks that have all vertices in a single component, with a medium to high global efficiency. The other three models generate networks with intermediate characteristics between B and BA models. A consequence of this finding is that the dynamics of different phenomena on these networks may differ considerably.

Temporal Variation of the Node Centrality Metrics for Scale-Free Networks

2018 ◽  
pp. 78-97
Keyword(s):  
Temporal Variation ◽  
Closeness Centrality ◽  
The Other ◽  
Centrality Measures ◽  
Degree Centrality ◽  
Eigenvector Centrality ◽  
Scale Free ◽  
Centrality Metrics ◽  
Scale Free Networks ◽  
Free Network

Scale-free networks are a type of complex networks in which the degree distribution of the nodes is according to the power law. In this chapter, the author uses the widely studied Barabasi-Albert (BA) model to simulate the evolution of scale-free networks and study the temporal variation of degree centrality, eigenvector centrality, closeness centrality, and betweenness centrality of the nodes during the evolution of a scale-free network according to the BA model. The model works by adding new nodes to the network, one at a time, with the new node connected to m of the currently existing nodes. Accordingly, nodes that have been in the network for a longer time have greater chances of acquiring more links and hence a larger degree centrality. While the degree centrality of the nodes has been observed to show a concave down pattern of increase with time, the temporal (time) variation of the other centrality measures has not been analyzed until now.

scholarly journals Correlation Analysis between Maximal Clique Size and Centrality Metrics for Random Networks and Scale-Free Networks

2016 ◽  
Vol 9 (2) ◽  
pp. 41 ◽  
Author(s):  
Natarajan Meghanathan
Keyword(s):  
Correlation Coefficient ◽  
Random Network ◽  
Maximal Clique ◽  
Random Networks ◽  
Font Size ◽  
Scale Free ◽  
Node Centrality ◽  
Centrality Metrics ◽  
Scale Free Networks ◽  
The Impact

<p><span style="font-size: 10.5pt; font-family: 'Times New Roman','serif'; mso-bidi-font-size: 12.0pt; mso-fareast-font-family: 宋体; mso-font-kerning: 1.0pt; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;" lang="EN-US">The high-level contribution of this paper is a comprehensive analysis of the correlation levels between node centrality (a computationally light-weight metric) and maximal clique size (a computationally hard metric) in random network and scale-free network graphs generated respectively from the well-known Erdos-Renyi (ER) and Barabasi-Albert (BA) models. We use three well-known measures for evaluating the level of correlation: Product-moment based Pearson's correlation coefficient, Rank-based Spearman's correlation coefficient and Concordance-based Kendall's correlation coefficient. For each of the several variants of the theoretical graphs generated from the ER and BA models, we compute the above three correlation coefficient values between the maximal clique size for a node (maximum size of the clique the node is part of) and each of the four prominent node centrality metrics (degree, eigenvector, betweenness and closeness). We also explore the impact of the operating parameters of the theoretical models for generating random networks and scale-free networks on the correlation between maximal clique size and the centrality metrics.</span></p>

OPTIMIZED SCALE-FREE NETWORKS AGAINST CASCADING FAILURES

2012 ◽  
Vol 23 (11) ◽  
pp. 1250075 ◽  
Author(s):  
JIANWEI WANG
Keyword(s):  
Correlation Coefficient ◽  
Path Length ◽  
Pearson Correlation ◽  
Network Robustness ◽  
Cascading Failures ◽  
Pearson Correlation Coefficient ◽  
Scale Free ◽  
Dynamical Characteristics ◽  
Degree Correlation ◽  
Scale Free Networks

According to the dynamical characteristics of the local redistribution of the load on a removal node, by the reconnection of the neighboring edge of the most vulnerable node, we propose an effective method to improve the network robustness against cascading failures. Under two constraints, i.e. keeping the degree of each node unchanged and fixing the total protective cost of a network, we investigate the efficiency of the swap method on scale-free networks and analyze the correlation between the optimized network and the Pearson correlation coefficient. We numerically show that effective swapping of the small part of connections can dramatically improve the network robust level against cascading failures and find that the optimized networks obtained by the swap method exhibit an extremely disassortative degree–degree correlation, that is, the disassortativity decreases the robustness of the optimized network against cascading failures. While the extent of the disassortative mixing is decided by the parameters in the cascading model. In addition, we also compare the average path length and the diameter of the optimized and the original networks.

scholarly journals Dynamics analysis of an online gambling spreading model on scale-free networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yu Kong ◽  
Tao Li ◽  
Yuanmei Wang ◽  
Xinming Cheng ◽  
He Wang ◽  
...  
Keyword(s):  
Network Topology ◽  
Negative Impact ◽  
Online Gambling ◽  
Basic Reproductive Number ◽  
Reproductive Number ◽  
Scale Free ◽  
Spreading Model ◽  
Spreading Dynamics ◽  
Scale Free Networks ◽  
Gambling Policy

AbstractNowadays, online gambling has a great negative impact on the society. In order to study the effect of people’s psychological factors, anti-gambling policy, and social network topology on online gambling dynamics, a new SHGD (susceptible–hesitator–gambler–disclaimer) online gambling spreading model is proposed on scale-free networks. The spreading dynamics of online gambling is studied. The basic reproductive number $R_{0}$ R 0 is got and analyzed. The basic reproductive number $R_{0}$ R 0 is related to anti-gambling policy and the network topology. Then, gambling-free equilibrium $E_{0}$ E 0 and gambling-prevailing equilibrium $E_{ +} $ E + are obtained. The global stability of $E_{0}$ E 0 is analyzed. The global attractivity of $E_{ +} $ E + and the persistence of online gambling phenomenon are studied. Finally, the theoretical results are verified by some simulations.

scholarly journals Network robustness improvement via long-range links

2019 ◽  
Vol 6 (1) ◽  
Author(s):  
Vincenza Carchiolo ◽  
Marco Grassia ◽  
Alessandro Longheu ◽  
Michele Malgeri ◽  
Giuseppe Mangioni
Keyword(s):  
Complex Networks ◽  
Long Range ◽  
Real World ◽  
Network Robustness ◽  
Scale Free ◽  
Area Of Interest ◽  
Before And After ◽  
Significant Area ◽  
Better Than

AbstractMany systems are today modelled as complex networks, since this representation has been proven being an effective approach for understanding and controlling many real-world phenomena. A significant area of interest and research is that of networks robustness, which aims to explore to what extent a network keeps working when failures occur in its structure and how disruptions can be avoided. In this paper, we introduce the idea of exploiting long-range links to improve the robustness of Scale-Free (SF) networks. Several experiments are carried out by attacking the networks before and after the addition of links between the farthest nodes, and the results show that this approach effectively improves the SF network correct functionalities better than other commonly used strategies.

scholarly journals Effective gravitation path routing strategy on scale-free networks

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Jinlong Ma ◽  
Junfeng Zhang ◽  
Yongqiang Zhang
Keyword(s):  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks

scholarly journals Distinguishing Planting Structures of Different Complexity from UAV Multispectral Images

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1994
Author(s):  
Qian Ma ◽  
Wenting Han ◽  
Shenjin Huang ◽  
Shide Dong ◽  
Guang Li ◽  
...  
Keyword(s):  
Remote Sensing ◽  
Confusion Matrix ◽  
Object Oriented ◽  
Low Complexity ◽  
Classification Model ◽  
Recursive Feature Elimination ◽  
Support Vector ◽  
Multispectral Images ◽  
High Complexity ◽  
Structure Complexity

This study explores the classification potential of a multispectral classification model for farmland with planting structures of different complexity. Unmanned aerial vehicle (UAV) remote sensing technology is used to obtain multispectral images of three study areas with low-, medium-, and high-complexity planting structures, containing three, five, and eight types of crops, respectively. The feature subsets of three study areas are selected by recursive feature elimination (RFE). Object-oriented random forest (OB-RF) and object-oriented support vector machine (OB-SVM) classification models are established for the three study areas. After training the models with the feature subsets, the classification results are evaluated using a confusion matrix. The OB-RF and OB-SVM models’ classification accuracies are 97.09% and 99.13%, respectively, for the low-complexity planting structure. The equivalent values are 92.61% and 99.08% for the medium-complexity planting structure and 88.99% and 97.21% for the high-complexity planting structure. For farmland with fragmentary plots and a high-complexity planting structure, as the planting structure complexity changed from low to high, both models’ overall accuracy levels decreased. The overall accuracy of the OB-RF model decreased by 8.1%, and that of the OB-SVM model only decreased by 1.92%. OB-SVM achieves an overall classification accuracy of 97.21%, and a single-crop extraction accuracy of at least 85.65%. Therefore, UAV multispectral remote sensing can be used for classification applications in highly complex planting structures.

Sign in / Sign up

Export Citation Format

Share Document