Spreading information in complex networks: A modified method

摘要

Spreading information in complex networks is studied by researchers using methods such as k — shell decomposition, degree k, closeness centrality etc. In this paper we discuss the importance of increase in degree of vertiees in a network in spreading information. We also pinpoint some important flaws in the existing methods and propose a modified method to do the identification of the most influential nodes as spreaders.