Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering

• Published in: PloS one Vol. 8; no. 10; p. e77455
• Main Authors: Chen, Duan-Bing, Gao, Hui, Lü, Linyuan, Zhou, Tao
• Format: Journal Article
• Language: English
• Published: United States Public Library of Science 31.10.2013; Public Library of Science (PLoS)
• Subjects: Algorithms; Cluster Analysis; Clustering; Collaboration; Computer Communication Networks; Computer science; Computer Simulation; Epidemics; Humans; Infectivity; Information dissemination; Information Services; Methods; Networks; Nodes; Search algorithms; Search engines; Social networks; Social organization; Social Support; Spreading; United States > US; Switzerland; China
• DOI: 10.1371/journal.pone.0077455
• ISSN: 1932-6203

Identifying influential nodes in very large-scale directed networks is a big challenge relevant to disparate applications, such as accelerating information propagation, controlling rumors and diseases, designing search engines, and understanding hierarchical organization of social and biological networks. Known methods range from node centralities, such as degree, closeness and betweenness, to diffusion-based processes, like PageRank and LeaderRank. Some of these methods already take into account the influences of a node's neighbors but do not directly make use of the interactions among it's neighbors. Local clustering is known to have negative impacts on the information spreading. We further show empirically that it also plays a negative role in generating local connections. Inspired by these facts, we propose a local ranking algorithm named ClusterRank, which takes into account not only the number of neighbors and the neighbors' influences, but also the clustering coefficient. Subject to the susceptible-infected-recovered (SIR) spreading model with constant infectivity, experimental results on two directed networks, a social network extracted from delicious.com and a large-scale short-message communication network, demonstrate that the ClusterRank outperforms some benchmark algorithms such as PageRank and LeaderRank. Furthermore, ClusterRank can also be applied to undirected networks where the superiority of ClusterRank is significant compared with degree centrality and k-core decomposition. In addition, ClusterRank, only making use of local information, is much more efficient than global methods: It takes only 191 seconds for a network with about [Formula: see text] nodes, more than 15 times faster than PageRank.