Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A general method for identifying node spreading influence via the adjacent matrix and spreading rate (1408.6030v1)

Published 26 Aug 2014 in physics.soc-ph, cs.SI, and physics.data-an

Abstract: With great theoretical and practical significance, identifying the node spreading influence of complex network is one of the most promising domains. So far, various topology-based centrality measures have been proposed to identify the node spreading influence in a network. However, the node spreading influence is a result of the interplay between the network topology structure and spreading dynamics. In this paper, we build up the systematic method by combining the network structure and spreading dynamics to identify the node spreading influence. By combining the adjacent matrix $A$ and spreading parameter $\beta$, we theoretical give the node spreading influence with the eigenvector of the largest eigenvalue. Comparing with the Susceptible-Infected-Recovered (SIR) model epidemic results for four real networks, our method could identify the node spreading influence more accurately than the ones generated by the degree, K-shell and eigenvector centrality. This work may provide a systematic method for identifying node spreading influence.

Summary

We haven't generated a summary for this paper yet.