ترغب بنشر مسار تعليمي؟ اضغط هنا

Accurate ranking of influential spreaders in networks based on dynamically asymmetric link-impact

99   0   0.0 ( 0 )
 نشر من قبل Ming Tang
 تاريخ النشر 2017
والبحث باللغة English




اسأل ChatGPT حول البحث

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 be considered explicitly. An edge connecting nodes i and j may differ in its importance for spreading from i to j and from j to i. The key issue is whether node j, after infected by i through the edge, would reach out to other nodes that i itself could not reach directly. It becomes necessary to invoke two unequal weights wij and wji characterizing the importance of an edge according to the neighborhoods of nodes i and j. The total asymmetric directional weights originating from a node leads to a novel measure si which quantifies the impact of the node in spreading processes. A s-shell decomposition scheme further assigns a s-shell index or weighted coreness to the nodes. The effectiveness and accuracy of rankings based on si and the weighted coreness are demonstrated by applying them to nine real-world networks. Results show that they generally outperform rankings based on the nodes degree and k-shell index, while maintaining a low computational complexity. Our work represents a crucial step towards understanding and controlling the spread of diseases, rumors, information, trends, and innovations in networks.



قيم البحث

اقرأ أيضاً

133 - Qian Li , Tao Zhou , Linyuan Lv 2013
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 ranking algori thm named LeaderRank [L. Lv et al., PLoS ONE 6 (2011) e21202]. According to the simulations on the standard SIR model, the weighted LeaderRank performs better than LeaderRank in three aspects: (i) the ability to find out more influential spreaders, (ii) the higher tolerance to noisy data, and (iii) the higher robustness to intentional attacks.
214 - Qi Zeng , Ying Liu , Liming Pan 2021
Identifying the most influential spreaders is important to understand and control the spreading process in a network. As many real-world complex systems can be modeled as multilayer networks, the question of identifying important nodes in multilayer network has attracted much attention. Existing studies focus on the multilayer network structure, while neglecting how the structural and dynamical coupling of multiple layers influence the dynamical importance of nodes in the network. Here we investigate on this question in an information-disease coupled spreading dynamics on multiplex networks. Firstly, we explicitly reveal that three interlayer coupling factors, which are the two-layer relative spreading speed, the interlayer coupling strength and the two-layer degree correlation, significantly impact the spreading influence of a node on the contact layer. The suppression effect from the information layer makes the structural centrality on the contact layer fail to predict the spreading influence of nodes in the multiplex network. Then by mapping the coevolving spreading dynamics into percolation process and using the message-passing approach, we propose a method to calculate the size of the disease outbreaks from a single seed node, which can be used to estimate the nodes spreading influence in the coevolving dynamics. Our work provides insights on the importance of nodes in the multiplex network and gives a feasible framework to investigate influential spreaders in the asymmetrically coevolving dynamics.
Measuring and optimizing the influence of nodes in big-data online social networks are important for many practical applications, such as the viral marketing and the adoption of new products. As the viral spreading on social network is a global proce ss, it is commonly believed that measuring the influence of nodes inevitably requires the knowledge of the entire network. Employing percolation theory, we show that the spreading process displays a nucleation behavior: once a piece of information spread from the seeds to more than a small characteristic number of nodes, it reaches a point of no return and will quickly reach the percolation cluster, regardless of the entire network structure, otherwise the spreading will be contained locally. Thus, we find that, without the knowledge of entire network, any nodes global influence can be accurately measured using this characteristic number, which is independent of the network size. This motivates an efficient algorithm with constant time complexity on the long standing problem of best seed spreaders selection, with performance remarkably close to the true optimum.
How to identify influential nodes in social networks is of theoretical significance, which relates to how to prevent epidemic spreading or cascading failure, how to accelerate information diffusion, and so on. In this Letter, we make an attempt to fi nd emph{effective multiple spreaders} in complex networks by generalizing the idea of the coloring problem in graph theory to complex networks. In our method, each node in a network is colored by one kind of color and nodes with the same color are sorted into an independent set. Then, for a given centrality index, the nodes with the highest centrality in an independent set are chosen as multiple spreaders. Comparing this approach with the traditional method, in which nodes with the highest centrality from the emph{entire} network perspective are chosen, we find that our method is more effective in accelerating the spreading process and maximizing the spreading coverage than the traditional method, no matter in network models or in real social networks. Meanwhile, the low computational complexity of the coloring algorithm guarantees the potential applications of our method.
99 - Pengli Lu , Chen Dong 2020
The safety and robustness of the network have attracted the attention of people from all walks of life, and the damage of several key nodes will lead to extremely serious consequences. In this paper, we proposed the clustering H-index mixing (CHM) ce ntrality based on the H- index of the node itself and the relative distance of its neighbors. Starting from the node itself and combining with the topology around the node, the importance of the node and its spreading capability were determined. In order to evaluate the performance of the proposed method, we use Susceptible-Infected-Recovered (SIR) model, monotonicity and resolution as the evaluation standard of experiment. Experimental results in artificial networks and real-world networks show that CHM centrality has excellent performance in identifying node importance and its spreading capability.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا