Minimizing the Influence Propagation in Social Networks for Linear Threshold Models

Abstract Innovation or information propagation in social networks has been widely studied in recent years. Most of the previous works are focused on solving the problem of influence maximization, which aims to identify a small subset of early adopters in a social network to maximize the influence propagation under a given diffusion model. In this paper, motivated by practical scenarios, we propose two different influence minimization problems. We consider a Linear Threshold diffusion model and provide a general solution to the first problem solving a linear integer programming. For the second problem, we provide a technique to search for an optimal solution that works only in particular cases and discuss a simple heuristic to find a solution in the general case.

[1]  Xiaodong Liu,et al.  IMGPU: GPU-Accelerated Influence Maximization in Large-Scale Social Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[2]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Sergey Brin,et al.  Reprint of: The anatomy of a large-scale hypertextual web search engine , 2012, Comput. Networks.

[4]  Y. Narahari,et al.  A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.

[5]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Yu Wang,et al.  Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method , 2015, IEEE Transactions on Parallel and Distributed Systems.