Related papers: Identifying Influential Nodes in Weighted Networks…

Identifying noteworthy spreaders in a network is essential for understanding the spreading process and controlling the reach of the spread in the network. The nodes that are holding more intrinsic power to extend the reach of the spread are…

How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value…

We propose an efficient and accurate measure for ranking spreaders and identifying the influential ones in spreading processes in networks. While the edges determine the connections among the nodes, their specific role in spreading should…

We present a generalized method for calculating the k-shell structure of weighted networks. The method takes into account both the weight and the degree of a network, in such a way that in the absence of weights we resume the shell…

Identifying the most influential spreaders is an important issue in understanding and controlling spreading processes on complex networks. Recent studies showed that nodes located in the core of a network as identified by the k-shell…

Spreading is a ubiquitous process in the social, biological and technological systems. Therefore, identifying influential spreaders, which is important to prevent epidemic spreading and to establish effective vaccination strategies, is full…

Identifying influential spreaders is crucial for understanding and controlling spreading processes on social networks. Via assigning degree-dependent weights onto links associated with the ground node, we proposed a variant to a recent…

Networks portray a multitude of interactions through which people meet, ideas are spread, and infectious diseases propagate within a society. Identifying the most efficient "spreaders" in a network is an important step to optimize the use…

Searching for influential spreaders in complex networks is an issue of great significance for applications across various domains, ranging from the epidemic control, innovation diffusion, viral marketing, social movement to idea…

Graph mining is an important technique that used in many applications such as predicting and understanding behaviors and information dissemination within networks. One crucial aspect of graph mining is the identification and ranking of…

An efficient strategy for the identification of influential spreaders that could be used to control epidemics within populations would be of considerable importance. Generally, populations are characterized by its community structures and…

In recent years, the problem of identifying the spreading ability and ranking social network users according to their influence has attracted a lot of attention; different approaches have been proposed for this purpose. Most of these…

Social networks have enabled user-specific advertisements and recommendations on their platforms, which puts a significant focus on Influence Maximisation (IM) for target advertising and related tasks. The aim is to identify nodes in the…

Influence propagation in networks has enjoyed fruitful applications and has been extensively studied in literature. However, only very limited preliminary studies tackled the challenges in handling highly dynamic changes in real networks.…

Identifying influential nodes in networks is a significant and challenging task. Among many centrality indices, the $k$-shell index performs very well in finding out influential spreaders. However, the traditional method for calculating the…

For network scientists, it has always been an interesting problem to identify the influential nodes in a given network. The k-shell decomposition method is a widely used method which assigns a shell-index value to each node based on its…

Recent study shows that the accuracy of the k-shell method in determining node coreness in a spreading process is largely impacted due to the existence of core-like group, which has a large k-shell index but a low spreading efficiency.…

Ranking the nodes' ability for spreading in networks is a fundamental problem which relates to many real applications such as information and disease control. In the previous literatures, a network decomposition procedure called k-shell…

Identifying influential nodes in complex networks has received increasing attention for its great theoretical and practical applications in many fields. Traditional methods, such as degree centrality, betweenness centrality, closeness…

Identifying influential node groups in complex networks is crucial for optimizing information dissemination, epidemic control, and viral marketing. However, traditional centrality-based methods often focus on individual nodes, resulting in…