Locating multiple sources in social networks under the SIR model: A divide-and-conquer approach

详细信息    查看全文

• 作者：Wenyu Zang^a ; ^{zangwenyu@nelmail.iie.ac.cn" class="auth_mail" title="E-mail the corresponding author} ; Peng Zhang^b ; Chuan Zhou^c ; Li Guo^c
• 关键词：Social network mining ; Source locating ; Community detection
• 刊名：Journal of Computational Science
• 出版年：2015
• 出版时间：September 2015
• 年：2015
• 卷：10
• 期：Complete
• 页码：278-287
• 全文大小：2101 K

文摘

Social networks greatly amplify the spread of information across different communities. However, we recently have observed that various malicious information, such as computer virus and rumors, were broadly spread via social networks. For better controlling the spread of malicious information, it is critical to develop effective methods to locate the diffusion source nodes in social networks. Many pioneer works have explored the source locating problem, but they mostly rely on the assumption that there is only a single source node. In this paper, we present an approximate multi-source locating algorithm by first introducing a new reverse propagation model to detect the recovered and unobserved infected nodes, and then developing a community detection method to cluster the extended infected nodes (including recovered nodes and infected nodes) into multiple infected communities. In doing so, we can identify the source nodes by using the maximum likelihood estimation on each infected community. Numerical simulations on both synthetic and real networks show the performance of the proposed method.