Rumor Containment by Blocking Nodes in Social Networks

Abstract

Rumor spreads fast in social networks and may seriously damage our society. In this article, we present a mathematical programming formulation based on integer linear programming (ILP) to minimize rumor spread by blocking a subset of nodes (called blockers) in complex social networks modeled as a linear threshold model. We also propose a modified approach which solves the top- <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$</tex-math> </inline-formula> blockers problem with a reduced computational effort and formally proves that its performance is still optimal. Then, the presented method is evaluated for its effectiveness of containing rumor spread in four different networks and its performance is compared with a greedy-based and two centrality-based approaches. The experimental analysis shows that the ILP-based method outperforms the other three approaches and is applicable to large-scale networks.