Weighted k-shell decomposition for complex networks based on potential edge weights
Identifying influential nodes in complex networks has attracted much attention because of its great theoretical significance and wide application. Existing methods consider the edges equally when designing identifying methods for the unweighted networks. In this paper, we propose an edge weighting method based on adding the degree of its two end nodes and for the constructed weighted networks, we propose a weighted k-shell decomposition method (Wks). Further investigations on the epidemic spreading process of the Susceptible–Infected–Recovered (SIR) model and Susceptible–Infected (SI) model in real complex networks verify that our method is effective for detecting the node influence.
Year of publication: |
2015
|
---|---|
Authors: | Wei, Bo ; Liu, Jie ; Wei, Daijun ; Gao, Cai ; Deng, Yong |
Published in: |
Physica A: Statistical Mechanics and its Applications. - Elsevier, ISSN 0378-4371. - Vol. 420.2015, C, p. 277-283
|
Publisher: |
Elsevier |
Subject: | Complex networks | Centrality measure | k-shell decomposition | Spreading |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Ranking the spreading ability of nodes in complex networks based on local structure
Gao, Shuai, (2014)
-
Identifying influential nodes in complex networks
Chen, Duanbing, (2012)
-
A new method of identifying influential nodes in complex networks based on TOPSIS
Du, Yuxian, (2014)
- More ...
Similar items by person