2018
DOI: 10.1038/s41598-018-30310-2
|View full text |Cite
|
Sign up to set email alerts
|

Identification of influential spreaders in complex networks using HybridRank algorithm

Abstract: Identifying the influential spreaders in complex networks is crucial to understand who is responsible for the spreading processes and the influence maximization through networks. Targeting these influential spreaders is significant for designing strategies for accelerating the propagation of information that is useful for various applications, such as viral marketing applications or blocking the diffusion of annoying information (spreading of viruses, rumors, online negative behaviors, and cyberbullying). Exis… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 87 publications
(46 citation statements)
references
References 38 publications
0
43
0
Order By: Relevance
“…Centrality which is de ned as the number of connections with the other nodes in the network were widely proved to be associated with the dynamics of transmission of infectious diseases [30,31]. However, centrality measures are simple but maybe less effective for they neglect the whole structure of the network [32,33]. From our analysis above, we can see that it is easy to ignore some important nodes and subgroups by calculating centrality to identify key nodes.…”
Section: Discussionmentioning
confidence: 98%
“…Centrality which is de ned as the number of connections with the other nodes in the network were widely proved to be associated with the dynamics of transmission of infectious diseases [30,31]. However, centrality measures are simple but maybe less effective for they neglect the whole structure of the network [32,33]. From our analysis above, we can see that it is easy to ignore some important nodes and subgroups by calculating centrality to identify key nodes.…”
Section: Discussionmentioning
confidence: 98%
“…Betweenness centrality is based on the shortest paths, wherein a stakeholder can, indeed, reach other stakeholders (neighbouring nodes) through different paths, but only the shortest one is computed [37]. Eigenvector centrality is a proxy of the influence of a stakeholder and its importance in terms of connections with high-scoring (‘central’) nodes [38]. To carry out SNA, average scores were used based on the views of the participants, as well as the association of each organisation/institution with all the other organisations.…”
Section: Methodsmentioning
confidence: 99%
“…This can be useful for identifying the most important network nodes, with very different interpretations. On one side of the coin, in science co-authorship networks, determining which node removals produce higher information spreading reduction may help us to understand who are the nodes/scientists making the greatest contribution to knowledge and idea spreading [30,56,57]. These findings may furnish useful tools for designing policies facilitating the activities of these scholars, who act as "influential spreaders" in the network.…”
Section: Node Removal In Social Networkmentioning
confidence: 99%