scholarly journals Identification of Influential Nodes via Effective Distance-based Centrality Mechanism in Complex Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Aman Ullah ◽  
Bin wang ◽  
Jinfang Sheng ◽  
Jun Long ◽  
Nasrullah Khan
Keyword(s):  
Complex Networks ◽  
Real World ◽  
Practical Significance ◽  
Centrality Measures ◽  
Sir Epidemic Model ◽  
Effective Distance ◽  
H Index ◽  
Sir Epidemic ◽  
Spreading Dynamics ◽  
Influential Nodes

Efficient identification of influential nodes is one of the essential aspects in the field of complex networks, which has excellent theoretical and practical significance in the real world. A valuable number of approaches have been developed and deployed in these areas where just a few have used centrality measures along with their concerning deficiencies and limitations in their studies. Therefore, to resolve these challenging issues, we propose a novel effective distance-based centrality (EDBC) algorithm for the identification of influential nodes in concerning networks. EDBC algorithm comprises factors such as the power of K-shell, degree nodes, effective distance, and numerous levels of neighbor’s influence or neighborhood potential. The performance of the proposed algorithm is evaluated on nine real-world networks, where a susceptible infected recovered (SIR) epidemic model is employed to examine the spreading dynamics of each node. Simulation results demonstrate that the proposed algorithm outperforms the existing techniques such as eigenvector, betweenness, closeness centralities, hyperlink-induced topic search, H-index, K-shell, page rank, profit leader, and gravity over a valuable margin.

A dynamic weighted TOPSIS method for identifying influential nodes in complex networks

2018 ◽  
Vol 32 (19) ◽  
pp. 1850216 ◽  
Author(s):  
Pingle Yang ◽  
Xin Liu ◽  
Guiqiong Xu
Keyword(s):  
Complex Networks ◽  
Centrality Measures ◽  
Topsis Method ◽  
Decision Making Problem ◽  
Significant Research ◽  
Order Preference ◽  
Multi Attribute Decision Making ◽  
Influential Nodes ◽  
Influential Node ◽  
Grey Relational

Identifying the influential nodes in complex networks is a challenging and significant research topic. Though various centrality measures of complex networks have been developed for addressing the problem, they all have some disadvantages and limitations. To make use of the advantages of different centrality measures, one can regard influential node identification as a multi-attribute decision-making problem. In this paper, a dynamic weighted Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) is developed. The key idea is to assign the appropriate weight to each attribute dynamically, based on the grey relational analysis method and the Susceptible–Infected–Recovered (SIR) model. The effectiveness of the proposed method is demonstrated by applications to three actual networks, which indicates that our method has better performance than single indicator methods and the original weighted TOPSIS method.

scholarly journals Influential Performance of Nodes Identified by Relative Entropy in Dynamic Networks

2020 ◽  
Vol 08 (01) ◽  
pp. 93-112
Author(s):  
Péter Marjai ◽  
Attila Kiss
Keyword(s):  
Diffusion Process ◽  
Complex Networks ◽  
Relative Entropy ◽  
Information Diffusion ◽  
Dynamic Networks ◽  
Centrality Measures ◽  
Topsis Method ◽  
Cover Time ◽  
Influential Nodes ◽  
Different Characteristics

For decades, centrality has been one of the most studied concepts in the case of complex networks. It addresses the problem of identification of the most influential nodes in the network. Despite the large number of the proposed methods for measuring centrality, each method takes different characteristics of the networks into account while identifying the “vital” nodes, and for the same reason, each has its advantages and drawbacks. To resolve this problem, the TOPSIS method combined with relative entropy can be used. Several of the already existing centrality measures have been developed to be effective in the case of static networks, however, there is an ever-increasing interest to determine crucial nodes in dynamic networks. In this paper, we are investigating the performance of a new method that identifies influential nodes based on relative entropy, in the case of dynamic networks. To classify the effectiveness, the Suspected-Infected model is used as an information diffusion process. We are investigating the average infection capacity of ranked nodes, the Time-Constrained Coverage as well as the Cover Time.

Efficient weighting strategy for enhancing synchronizability of complex networks

2018 ◽  
Vol 32 (11) ◽  
pp. 1850128 ◽  
Author(s):  
Youquan Wang ◽  
Feng Yu ◽  
Shucheng Huang ◽  
Juanjuan Tu ◽  
Yan Chen
Keyword(s):  
Complex Networks ◽  
Structural Properties ◽  
Real World ◽  
Centrality Measures ◽  
Node Degree ◽  
Scale Free ◽  
High Propensity ◽  
Network Link ◽  
Weighting Strategy ◽  
Weighting Methods

Networks with high propensity to synchronization are desired in many applications ranging from biology to engineering. In general, there are two ways to enhance the synchronizability of a network: link rewiring and/or link weighting. In this paper, we propose a new link weighting strategy based on the concept of the neighborhood subgroup. The neighborhood subgroup of a node i through node j in a network, i.e. [Formula: see text], means that node u belongs to [Formula: see text] if node u belongs to the first-order neighbors of j (not include i). Our proposed weighting schema used the local and global structural properties of the networks such as the node degree, betweenness centrality and closeness centrality measures. We applied the method on scale-free and Watts–Strogatz networks of different structural properties and show the good performance of the proposed weighting scheme. Furthermore, as model networks cannot capture all essential features of real-world complex networks, we considered a number of undirected and unweighted real-world networks. To the best of our knowledge, the proposed weighting strategy outperformed the previously published weighting methods by enhancing the synchronizability of these real-world networks.

Analysis of Twitter-based Malware Propagation using SIR Epidemic Model

2018 ◽  
Vol 5 (1) ◽  
pp. 11-19
Author(s):  
Alfius Yonathan
Keyword(s):  
Epidemic Model ◽  
Sir Epidemic Model ◽  
Breaking News ◽  
Sir Epidemic ◽  
Malware Propagation ◽  
Underlying Principle ◽  
Spreading Dynamics ◽  
Information Spread ◽  
News Event ◽  
Propagation Scenario

This paper presented an analysis of malware propagation scenario in which attacker exploit news spreading dynamics on Twitter. The malware propagation starts with an attacker crafting tweets about breaking news, event or tragedy that will lure user to click the short-URL provided in the tweet which then redirect user to malicious website, which in turn installed the malware in the user mobile device or computer. As the information spread in the Twitter then more users will be infected with malware. The underlying principle to analyze this type of malware propagation is that the spreading of information in Twitter can be modeled by using formal epidemic model of disease. The simulation result of the model shows parameters that highly impacting the spread of malware using Twitter as the medium.

scholarly journals Identifying Influential Nodes of Complex Networks Based on Trust-Value

Algorithms ◽  
2020 ◽  
Vol 13 (11) ◽  
pp. 280
Author(s):  
Jinfang Sheng ◽  
Jiafu Zhu ◽  
Yayun Wang ◽  
Bin Wang ◽  
Zheng’ang Hou
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Real World ◽  
Trust Value ◽  
The Real ◽  
The World ◽  
Attribute Information ◽  
Similarity Ratio ◽  
Influential Nodes ◽  
Influential Node

The real world contains many kinds of complex network. Using influence nodes in complex networks can promote or inhibit the spread of information. Identifying influential nodes has become a hot topic around the world. Most of the existing algorithms used for influential node identification are based on the structure of the network such as the degree of the nodes. However, the attribute information of nodes also affects the ranking of nodes’ influence. In this paper, we consider both the attribute information between nodes and the structure of networks. Therefore, the similarity ratio, based on attribute information, and the degree ratio, based on structure derived from trust-value, are proposed. The trust–PageRank (TPR) algorithm is proposed to identify influential nodes in complex networks. Finally, several real networks from different fields are selected for experiments. Compared with some existing algorithms, the results suggest that TPR more rationally and effectively identifies the influential nodes in networks.

A novel method for identifying influential nodes in complex networks based on gravity model

2021 ◽  
Author(s):  
Yuan Jiang ◽  
Song-Qing Yang ◽  
Yu-Wei Yan ◽  
Tian-Chi Tong ◽  
Ji-Yang Dai
Keyword(s):  
Complex Networks ◽  
Gravity Model ◽  
Evaluation Criteria ◽  
Effective Distance ◽  
Network Characteristics ◽  
Structural Hole ◽  
Shortest Distance ◽  
Novel Method ◽  
Influential Nodes ◽  
Local Topology

Abstract How to identify influential nodes in complex networks is an essential issue in the study of network characteristics. A number of methods have been proposed to address this problem, but most of them focus on only one aspect. Based on the gravity model, a novel method is proposed for identifying influential nodes in terms of the local topology and the global location. This method comprehensively examines the structural hole characteristics and K-shell centrality of nodes, replaces the shortest distance with a probabilistically motivated effective distance, and fully considers the influence of nodes and their neighbors from the aspect of gravity. On eight real-world networks from different fields, the monotonicity index, susceptible-infected-recovered (SIR) model, and Kendall's tau coefficient are used as evaluation criteria to evaluate the performance of the proposed method compared with several existing methods. The experimental results show that the proposed method is more efficient and accurate in identifying the influence of nodes and can significantly discriminate the influence of different nodes.

A novel measure to identify influential nodes in complex networks based on network global efficiency

2015 ◽  
Vol 29 (28) ◽  
pp. 1550168 ◽  
Author(s):  
Tingping Zhang ◽  
Bin Fang ◽  
Xinyu Liang
Keyword(s):  
Complex Networks ◽  
Closeness Centrality ◽  
Centrality Measures ◽  
Dynamical Process ◽  
Static Structure ◽  
Structure And Dynamics ◽  
Global Efficiency ◽  
Si Model ◽  
Influential Nodes ◽  
Structure Properties

Identifying influential nodes is a basic measure of characterizing the structure and dynamics in complex networks. In this paper, we use network global efficiency by removing edges to propose a new centrality measure for identifying influential nodes in complex networks. Differing from the traditional network global efficiency, the proposed measure is determined by removing edges from networks, not removing nodes. Instead of static structure properties which are exhibited by other traditional centrality measures, such as degree centrality (DC), betweenness centrality (BC) and closeness centrality (CC), we focus on the perspective of dynamical process and global structure in complex networks. Susceptible-infected (SI) model is utilized to evaluate the performance of the proposed method. Experimental results show that the proposed measure is more effective than the other three centrality measures.

Sign in / Sign up

Export Citation Format

Share Document