ABSTRACT
How can we optimize the topology of a networked system to bring a flu under control, propel a video to popularity, or stifle a network malware in its infancy? Previous work on information diffusion has focused on modeling the diffusion dynamics and selecting nodes to maximize/minimize influence. Only a paucity of recent studies have attempted to address the network modification problems, where the goal is to either facilitate desirable spreads or curtail undesirable ones by adding or deleting a small subset of network nodes or edges. In this paper, we focus on the widely studied linear threshold diffusion model, and prove, for the first time, that the network modification problems under this model have supermodular objective functions. This surprising property allows us to design efficient data structures and scalable algorithms with provable approximation guarantees, despite the hardness of the problems in question. Both the time and space complexities of our algorithms are linear in the size of the network, which allows us to experiment with millions of nodes and edges. We show that our algorithms outperform an array of heuristics in terms of their effectiveness in controlling diffusion processes, often beating the next best by a significant margin.
Supplemental Material
- I. Bogunovic. Robust protection of networks against cascading phenomena. Master's thesis, ETHZ, 2012.Google Scholar
- U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2), 2001.Google ScholarCross Ref
- W. Chen, L. V. Lakshmanan, and C. Castillo. Information and influence propagation in social networks. Synthesis Lectures on Data Management, 2013. Google ScholarDigital Library
- W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In IEEE ICDM, pages 88--97, 2010. Google ScholarDigital Library
- E. Cohen. Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences, 55(3):441--453, 1997. Google ScholarDigital Library
- P. Domingos and M. Richardson. Mining the network value of customers. In ACM KDD, pages 57--66, 2001. Google ScholarDigital Library
- N. Du, L. Song, H. Zha, and M. Gomez Rodriguez. Scalable influence estimation in continuous time diffusion networks. In NIPS, 2013.Google Scholar
- C. Gao, J. Liu, and N. Zhong. Network immunization and virus propagation in email networks: experimental evaluation and analysis. KAIS, 27(2):253--279, 2011. Google ScholarDigital Library
- X. He, G. Song, W. Chen, and Q. Jiang. Influence blocking maximization in social networks under the competitive linear threshold model. In SDM, 2012.Google ScholarCross Ref
- H. W. Hethcote. The mathematics of infectious diseases. SIAM review, 42(4):599--653, 2000. Google ScholarDigital Library
- R. Iyer, S. Jegelka, and J. Bilmes. Fast semidifferential-based submodular function optimization. In ICML, 2013.Google Scholar
- D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In ACM KDD, pages 137--146. ACM, 2003. Google ScholarDigital Library
- M. Kimura, K. Saito, and H. Motoda. Solving the contamination minimization problem on networks for the linear threshold model. In PRICAI. 2008. Google ScholarDigital Library
- M. Kimura, K. Saito, and H. Motoda. Blocking links to minimize contamination spread in a social network. ACM TKDD, 3(2):9, 2009. Google ScholarDigital Library
- C. J. Kuhlman, G. Tuli, S. Swarup, M. V. Marathe, and S. Ravi. Blocking simple and complex contagion by edge removal. In IEEE ICDM, 2013.Google ScholarCross Ref
- J. Leskovec, L. Backstrom, and J. Kleinberg. Meme-tracking and the dynamics of the news cycle. In ACM KDD, pages 497--506. ACM, 2009. Google ScholarDigital Library
- J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani. Kronecker graphs: An approach to modeling networks. 11(Feb):985--1042, 2010. Google ScholarDigital Library
- G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14, 1978.Google Scholar
- S. Peng, S. Yu, and A. Yang. Smartphone malware and its propagation modeling: A survey. IEEE Communications Surveys Tutorials, PP(99):1--17, 2013.Google Scholar
- C. M. Schneider, T. Mihaljev, S. Havlin, and H. J. Herrmann. Suppressing epidemics with a limited amount of immunization units. Physical Review E, 84(6), 2011.Google ScholarCross Ref
- D. Sheldon, B. Dilkina, A. N. Elmachtoub, R. Finseth, et al. Maximizing the spread of cascades using network design. UAI, 2010.Google ScholarDigital Library
- H. Tong, B. A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos. Gelling, and melting, large graphs by edge manipulation. In ACM CIKM, 2012. Google ScholarDigital Library
Index Terms
- Scalable diffusion-aware optimization of network topology
Recommendations
Energy-Efficient network routing with discrete cost functions
TAMC'12: Proceedings of the 9th Annual international conference on Theory and Applications of Models of ComputationEnergy consumption is an important issue in the design and use of networks. In this paper, we explore energy savings in networks via a rate adaptation model. This model can be represented by a cost-minimization network routing problem with discrete cost ...
Structural virality estimation and maximization in diffusion networks
AbstractSocial media usage is one of the most popular online activities and people shares millions of message in a short time; however this information rarely goes viral. The diffusion process begins with an initial set of source nodes and ...
Highlights- Investigating the structural properties of diffusion patterns in message virality.
Dynamic graph neural network for fake news detection
Highlights- We study a novel problem of discrete-time dynamic news propagation network-based fake news detection task.
AbstractThe widespread of fake news on social media and other platforms can bring significant damage to the harmony and stability of our society. To defend against fake news, researchers have suggested various ways of dealing with fake news. ...
Comments