ML p(r)ior | Identifying a set of influential spreaders in complex networks

Identifying a set of influential spreaders in complex networks

2016-01-30
Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-$r$ ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and $k$-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effectively iterative method named VoteRank to identify a set of decentralized spreaders with the best spreading ability. In this approach, all nodes vote in a spreader in each turn, and the voting ability of neighbors of elected spreader will be decreased in subsequent turn. Experimental results on four real networks show that under Susceptible-Infected-Recovered (SIR) model, VoteRank outperforms the traditional benchmark methods on both spreading speed and final affected scale. What's more, VoteRank is also superior to other group-spreader identifying methods on computational time.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2018-05-07

Network embedding, which learns low-dimensional vector representation for nodes in the network, has … show more
PDF

Highlights - Most important sentences from the article

2019-03-01

Influence overlap is a universal phenomenon in influence spreading for social networks. In this pape… show more
PDF

Highlights - Most important sentences from the article

2018-12-21
1901.09658 | cs.SI

How to identify influential nodes in complex networks is an important aspect in the study of complex… show more
PDF

Highlights - Most important sentences from the article

2018-08-15

Efficient stochastic simulation algorithms are of paramount importance to the study of spreading phe… show more
PDF

Highlights - Most important sentences from the article

2019-01-10
1901.03425 | cs.SI

Studying networks to predict the emerging interactions is a common research problem for both fields … show more
PDF

Highlights - Most important sentences from the article

2018-12-30
1812.11535 | cs.SI

Network immunization is an extensively recognized issue in several domains like virtual network secu… show more
PDF

Highlights - Most important sentences from the article

2018-12-27
1812.10616 | physics.soc-ph

Ranking node importance is crucial in understanding network structure and function on complex networ… show more
PDF

Highlights - Most important sentences from the article

2019-04-11
1904.05523 | physics.soc-ph

Community identification of network components enables us to understand the mesoscale clustering str… show more
PDF

Highlights - Most important sentences from the article

2018-03-03

A pivotal idea in network science, marketing research and innovation diffusion theories is that a sm… show more
PDF

Highlights - Most important sentences from the article

2018-07-13

Recent research has shown that graph degeneracy algorithms, which decompose a network into a hierarc… show more
PDF

Highlights - Most important sentences from the article

2019-03-02

Identification of influential nodes is an important step in understanding and controlling the dynami… show more
PDF

Highlights - Most important sentences from the article

2015-09-11

Measuring and optimizing the influence of nodes in big-data online social networks are important for… show more
PDF

Highlights - Most important sentences from the article

2018-05-25
1805.10391 | cs.SI

For network scientists, it has always been an interesting problem to identify the influential nodes … show more
PDF

Highlights - Most important sentences from the article

2018-12-21

There is recently a surge in approaches that learn low-dimensional embeddings of nodes in networks. … show more
PDF

Highlights - Most important sentences from the article

2019-03-15

Influential nodes in complex networks are typically defined as those nodes that maximize the asympto… show more
PDF

Highlights - Most important sentences from the article

2018-11-05

This study proposes the usage of a method called VoteRank, created by Zhang et al. (2016), to identi… show more
PDF

Highlights - Most important sentences from the article