Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Influence maximization on temporal networks: a review (2307.00181v1)

Published 1 Jul 2023 in cs.SI

Abstract: Influence maximization (IM) is an important topic in network science where a small seed set is chosen to maximize the spread of influence on a network. Recently, this problem has attracted attention on temporal networks where the network structure changes with time. IM on such dynamically varying networks is the topic of this review. We first categorize methods into two main paradigms: single and multiple seeding. In single seeding, nodes activate at the beginning of the diffusion process, and most methods either efficiently estimate the influence spread and select nodes with a greedy algorithm, or use a node-ranking heuristic. Nodes activate at different time points in the multiple seeding problem, via either sequential seeding, maintenance seeding or node probing paradigms. Throughout this review, we give special attention to deploying these algorithms in practice while also discussing existing solutions for real-world applications. We conclude by sharing important future research directions and challenges.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (84)
  1. L. Garton, C. Haythornthwaite, and B. Wellman, “Studying online social networks,” J. Comput.-Mediat. Commun., vol. 3, no. 1, p. JCMC313, 1997.
  2. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, “Measurement and analysis of online social networks,” in Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, 2007, pp. 29–42.
  3. S. Phuvipadawat and T. Murata, “Breaking news detection and tracking in twitter,” in 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, vol. 3.   IEEE, 2010, pp. 120–123.
  4. V. Latora and M. Marchiori, “Vulnerability and protection of infrastructure networks,” Phys. Rev. E, vol. 71, no. 1, p. 015103, 2005.
  5. W. Liu and Z. Song, “Review of studies on the resilience of urban critical infrastructure networks,” Reliab. Eng. Syst. Saf., vol. 193, p. 106617, 2020.
  6. R. Guimera and L. A. N. Amaral, “Modeling the world-wide airport network,” Eur. Phys. J. B, vol. 38, pp. 381–385, 2004.
  7. M. Girvan and M. E. Newman, “Community structure in social and biological networks,” Proc. Natl. Acad. Sci. USA, vol. 99, no. 12, pp. 7821–7826, 2002.
  8. G. A. Pavlopoulos, M. Secrier, C. N. Moschopoulos, T. G. Soldatos, S. Kossida, J. Aerts, R. Schneider, and P. G. Bagos, “Using graph theory to analyze biological networks,” BioData Min., vol. 4, pp. 1–27, 2011.
  9. D. López-Pintado, “Diffusion in complex social networks,” Games Econ. Behav., vol. 62, no. 2, pp. 573–590, 2008.
  10. M. G. Rodriguez, D. Balduzzi, and B. Schölkopf, “Uncovering the temporal dynamics of diffusion networks,” arXiv preprint arXiv:1105.0697, 2011.
  11. B. Xu and L. Liu, “Information diffusion through online social networks,” in 2010 IEEE International Conference on Emergency Management and Management Sciences.   IEEE, 2010, pp. 53–56.
  12. U. Harush and B. Barzel, “Dynamic patterns of information flow in complex networks,” Nat. Commun., vol. 8, no. 1, p. 2181, 2017.
  13. J. L. Moreno and H. H. Jennings, “Statistics of social configurations,” Sociometry, vol. 1, no. 3/4, pp. 342–274, 1938.
  14. P. Domingos and M. Richardson, “Mining the network value of customers,” in Proceedings of the seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2001, pp. 57–66.
  15. J. Leskovec, L. A. Adamic, and B. A. Huberman, “The dynamics of viral marketing,” ACM Trans. Web, vol. 1, no. 1, pp. 5–es, 2007.
  16. O. Hinz, B. Skiera, C. Barrot, and J. U. Becker, “Seeding strategies for viral marketing: An empirical comparison,” J. Mark., vol. 75, no. 6, pp. 55–71, 2011.
  17. L. Lü, D. Chen, X.-L. Ren, Q.-M. Zhang, Y.-C. Zhang, and T. Zhou, “Vital nodes identification in complex networks,” Phys. Rep., vol. 650, pp. 1–63, 2016.
  18. S. Bhattacharya, K. Gaurav, and S. Ghosh, “Viral marketing on social networks: An epidemiological perspective,” Physica A, vol. 525, pp. 478–490, 2019.
  19. J. L. Herlocker, J. A. Konstan, L. G. Terveen, and J. T. Riedl, “Evaluating collaborative filtering recommender systems,” ACM Trans. Info. Syst., vol. 22, no. 1, pp. 5–53, 2004.
  20. J. Bobadilla, F. Ortega, A. Hernando, and A. Gutiérrez, “Recommender systems survey,” Knowl. Based Syst., vol. 46, pp. 109–132, 2013.
  21. Q. Zhang, J. Lu, and Y. Jin, “Artificial intelligence in recommender systems,” Complex Intell. Syst., vol. 7, pp. 439–457, 2021.
  22. S. Huang, W. Lin, Z. Bao, and J. Sun, “Influence maximization in real-world closed social networks,” arXiv preprint arXiv:2209.10286, 2022.
  23. A. Yadav, H. Chan, A. X. Jiang, H. Xu, E. Rice, and M. Tambe, “Using social networks to aid homeless shelters: Dynamic influence maximization under uncertainty,” in AAMAS, vol. 16, 2016, pp. 740–748.
  24. A. Yadav, B. Wilder, E. Rice, R. Petering, J. Craddock, A. Yoshioka-Maxwell, M. Hemler, L. Onasch-Vera, M. Tambe, and D. Woo, “Bridging the gap between theory and practice in influence maximization: Raising awareness about hiv among homeless youth.” in IJCAI, 2018, pp. 5399–5403.
  25. B. Wilder, A. Yadav, N. Immorlica, E. Rice, and M. Tambe, “Uncharted but not uninfluenced: Influence maximization with an uncertain network,” in Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017, pp. 1305–1313.
  26. B. Wilder, L. Onasch-Vera, J. Hudson, J. Luna, N. Wilson, R. Petering, D. Woo, M. Tambe, and E. Rice, “End-to-end influence maximization in the field.” in AAMAS, vol. 18, 2018, pp. 1414–1422.
  27. M. Waniek, P. Holme, M. Cebrian, and T. Rahwan, “Social diffusion sources can escape detection,” iScience, vol. 25, no. 9, p. 104956, 2022.
  28. P. Holme, “Three faces of node importance in network epidemiology: Exact results for small graphs,” Phys. Rev. E, vol. 96, p. 062305, 2017.
  29. ——, “Efficient local strategies for vaccination and network attack,” Europhys. Lett., vol. 68, no. 6, p. 908, 2004.
  30. S. Lee, L. E. C. Rocha, F. Liljeros, and P. Holme, “Exploiting temporal network structures of human interaction to effectively immunize populations,” PLOS One, vol. 7, p. e36439, 2012.
  31. N. A. Christakis and J. H. Fowler, “Social network sensors for early detection of contagious outbreaks,” PLOS ONE, vol. 5, no. 9, p. 12948, 09 2010.
  32. Y. Bai, B. Yang, L. Lin, J. L. Herrera, Z. Du, and P. Holme, “Optimizing sentinel surveillance in temporal network epidemiology,” Sci. Rep., vol. 7, p. 4804, 2017.
  33. D. Kempe, J. Kleinberg, and É. Tardos, “Maximizing the spread of influence through a social network,” in Proceedings of the ninth ACM SIGKDD International Conference on Knowledge discovery and data mining, 2003, pp. 137–146.
  34. S. Bharathi, D. Kempe, and M. Salek, “Competitive influence maximization in social networks,” in Internet and Network Economics: Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007. Proceedings 3.   Springer, 2007, pp. 306–311.
  35. W. Chen, Y. Wang, and S. Yang, “Efficient influence maximization in social networks,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge discovery and data mining, 2009, pp. 199–208.
  36. A. Goyal, W. Lu, and L. V. Lakshmanan, “Celf++ optimizing the greedy algorithm for influence maximization in social networks,” in Proceedings of the 20th International Conference Companion on World Wide Web, 2011, pp. 47–48.
  37. Y. Li, J. Fan, Y. Wang, and K.-L. Tan, “Influence maximization on social graphs: A survey,” IEEE Trans Knowl Data Eng, vol. 30, no. 10, pp. 1852–1872, 2018.
  38. M. Azaouzi, W. Mnasri, and L. B. Romdhane, “New trends in influence maximization models,” Comput. Sci. Rev., vol. 40, p. 100393, 2021.
  39. P. Holme and J. Saramäki, “Temporal networks,” Phys. Rep., vol. 519, no. 3, pp. 97–125, 2012.
  40. N. Ohsaka, T. Akiba, Y. Yoshida, and K.-i. Kawarabayashi, “Fast and accurate influence maximization on large networks with pruned monte-carlo simulations,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 28, 2014.
  41. Y. Yang and J. Pei, “Influence analysis in evolving networks: A survey,” IEEE Trans Knowl Data Eng, vol. 33, no. 3, pp. 1045–1063, 2019.
  42. N. Hafiene, W. Karoui, and L. B. Romdhane, “Influential nodes detection in dynamic social networks: A survey,” Expert Syst. Appl., vol. 159, p. 113642, 2020.
  43. K. Saito, R. Nakano, and M. Kimura, “Prediction of information diffusion probabilities for independent cascade model,” in Knowledge-Based Intelligent Information and Engineering Systems: 12th International Conference, KES 2008, Zagreb, Croatia, September 3-5, 2008, Proceedings, Part III 12.   Springer, 2008, pp. 67–75.
  44. R. Pastor-Satorras, C. Castellano, P. Van Mieghem, and A. Vespignani, “Epidemic processes in complex networks,” Rev. Mod. Phys., vol. 87, no. 3, p. 925, 2015.
  45. Ş. Erkol, D. Mazzilli, and F. Radicchi, “Effective submodularity of influence maximization on temporal networks,” Phys. Rev. E, vol. 106, no. 3, p. 034301, 2022.
  46. S. Osawa and T. Murata, “Selecting seed nodes for influence maximization in dynamic networks,” in Complex Networks VI.   Springer, 2015, pp. 91–98.
  47. T. Murata and H. Koga, “Extended methods for influence maximization in dynamic networks,” Computational social networks, vol. 5, no. 1, pp. 1–21, 2018.
  48. W. Chen, Y. Yuan, and L. Zhang, “Scalable influence maximization in social networks under the linear threshold model,” in 2010 IEEE International Conference on data mining.   IEEE, 2010, pp. 88–97.
  49. N. Pathak, A. Banerjee, and J. Srivastava, “A generalized linear threshold model for multiple cascades,” in 2010 IEEE International Conference on Data Mining.   IEEE, 2010, pp. 965–970.
  50. C. C. Aggarwal, S. Lin, and P. S. Yu, “On influential node discovery in dynamic social networks,” in Proceedings of the 2012 SIAM International Conference on Data Mining.   SIAM, 2012, pp. 636–647.
  51. P. Grindrod, M. C. Parsons, D. J. Higham, and E. Estrada, “Communicability across evolving networks,” Phys. Rev. E, vol. 83, no. 4, p. 046120, 2011.
  52. Ş. Erkol, D. Mazzilli, and F. Radicchi, “Influence maximization on temporal networks,” Physical Review E, vol. 102, no. 4, p. 042307, 2020.
  53. R. Michalski, T. Kajdanowicz, P. Bródka, and P. Kazienko, “Seed selection for spread of influence in social networks: Temporal vs. static approach,” New Generation Computing, vol. 32, no. 3, pp. 213–235, 2014.
  54. F. Morone and H. A. Makse, “Influence maximization in complex networks through optimal percolation,” Nature, vol. 524, no. 7563, pp. 65–68, 2015.
  55. C. Borgs, M. Brautbar, J. Chayes, and B. Lucier, “Maximizing social influence in nearly optimal time,” in Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms.   SIAM, 2014, pp. 946–957.
  56. Y. Tang, X. Xiao, and Y. Shi, “Influence maximization: Near-optimal time complexity meets practical efficiency,” in Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, 2014, pp. 75–86.
  57. R. Michalski, J. Jankowski, and P. Pazura, “Entropy-based measure for influence maximization in temporal networks,” in Computational Science–ICCS 2020: 20th International Conference, Amsterdam, The Netherlands, June 3–5, 2020, Proceedings, Part IV 20.   Springer, 2020, pp. 277–290.
  58. F. Hao, C. Zhu, M. Chen, L. T. Yang, and Z. Pei, “Influence strength aware diffusion models for dynamic influence maximization in social networks,” in 2011 International Conference on Internet of Things and 4th International Conference on Cyber, Physical and Social Computing.   IEEE, 2011, pp. 317–322.
  59. N. T. Gayraud, E. Pitoura, and P. Tsaparas, “Diffusion maximization in evolving social networks,” in Proceedings of the 2015 ACM Conference on Online Social Networks, 2015, pp. 125–135.
  60. A. Albano, J.-L. Guillaume, S. Heymann, and B. L. Grand, “A matter of time-intrinsic or extrinsic-for diffusion in evolving complex networks,” in Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2013, pp. 202–206.
  61. E. Yanchenko, T. Murata, and P. Holme, “Link prediction for ex ante influence maximization on temporal networks,” arXiv preprint arXiv:2305.09965, 2023.
  62. R. Michalski, J. Jankowski, and P. Bródka, “Effective influence spreading in temporal networks with sequential seeding,” IEEE Access, vol. 8, pp. 151 208–151 218, 2020.
  63. G. Tong, W. Wu, S. Tang, and D.-Z. Du, “Adaptive influence maximization in dynamic social networks,” IEEE/ACM Trans. Netw., vol. 25, no. 1, pp. 112–125, 2016.
  64. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, “Cost-effective outbreak detection in networks,” in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007, pp. 420–429.
  65. X. Chen, G. Song, X. He, and K. Xie, “On influential nodes tracking in dynamic social networks,” in Proceedings of the 2015 SIAM International Conference on Data Mining.   SIAM, 2015, pp. 613–621.
  66. G. Song, Y. Li, X. Chen, X. He, and J. Tang, “Influential node tracking on dynamic social network: An interchange greedy approach,” IEEE Trans Knowl Data Eng, vol. 29, no. 2, pp. 359–372, 2016.
  67. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, “An analysis of approximations for maximizing submodular set functions—i,” Mathematical programming, vol. 14, pp. 265–294, 1978.
  68. N. Ohsaka, T. Akiba, Y. Yoshida, and K.-i. Kawarabayashi, “Dynamic influence analysis in evolving networks,” Proc. VLDB Endow., vol. 9, no. 12, pp. 1077–1088, 2016.
  69. X. Wu, L. Fu, J. Meng, and X. Wang, “Maximizing influence diffusion over evolving social networks,” in Proceedings of the Fourth International Workshop on Social Sensing, 2019, pp. 6–11.
  70. Y. Wang, J. Zhu, and Q. Ming, “Incremental influence maximization for dynamic social networks,” in Data Science: Third International Conference of Pioneering Computer Scientists, Engineers and Educators, ICPCSEE 2017, Changsha, China, September 22–24, 2017, Proceedings, Part II.   Springer, 2017, pp. 13–27.
  71. Y. Wang, Q. Fan, Y. Li, and K.-L. Tan, “Real-time influence maximization on dynamic social streams,” arXiv preprint arXiv:1702.01586, 2017.
  72. J. Chandran and V. M. Viswanatham, “Dynamic node influence tracking based influence maximization on dynamic social networks,” Microprocess. Microsyst., vol. 95, p. 104689, 2022.
  73. H. Min, J. Cao, T. Yuan, and B. Liu, “Topic based time-sensitive influence maximization in online social networks,” World Wide Web, vol. 23, pp. 1831–1859, 2020.
  74. A. K. Singh and L. Kailasam, “Link prediction-based influence maximization in online social networks,” Neurocomputing, vol. 453, pp. 151–163, 2021.
  75. X. Li, N. Du, H. Li, K. Li, J. Gao, and A. Zhang, “A deep learning approach to link prediction in dynamic networks,” in Proceedings of the 2014 SIAM International Conference on data mining.   SIAM, 2014, pp. 289–297.
  76. B. Peng, “Dynamic influence maximization,” Adv. Neural Inf. Process. Syst., vol. 34, pp. 10 718–10 731, 2021.
  77. H. Zhuang, Y. Sun, J. Tang, J. Zhang, and X. Sun, “Influence maximization in dynamic social networks,” in 2013 IEEE 13th International Conference on Data Mining.   IEEE, 2013, pp. 1313–1318.
  78. M. Han, M. Yan, Z. Cai, Y. Li, X. Cai, and J. Yu, “Influence maximization by probing partial communities in dynamic online social networks,” Transactions on Emerging Telecommunications Technologies, vol. 28, no. 4, p. e3054, 2017.
  79. Y. Zhou, H. Cheng, and J. X. Yu, “Graph clustering based on structural/attribute similarities,” Proc. VLDB Endow., vol. 2, no. 1, pp. 718–729, 2009.
  80. Y. Yang, Z. Wang, J. Pei, and E. Chen, “Tracking influential individuals in dynamic networks,” IEEE Trans Knowl Data Eng, vol. 29, no. 11, pp. 2615–2628, 2017.
  81. A. Yadav, B. Wilder, E. Rice, R. Petering, J. Craddock, A. Yoshioka-Maxwell, M. Hemler, L. Onasch-Vera, M. Tambe, and D. Woo, “Influence maximization in the field: The arduous journey from emerging to deployed application,” in Proceedings of the 16th conference on autonomous agents and multiagent systems, 2017, pp. 150–158.
  82. M. Kim and J. Leskovec, “The network completion problem: Inferring missing nodes and edges in networks,” in Proceedings of the 2011 SIAM International Conference on data mining.   SIAM, 2011, pp. 47–58.
  83. S. L. Feld, “Why your friends have more friends than you do,” Am. J. Sociol., vol. 96, no. 6, pp. 1464–1477, 1991.
  84. J. Qiu, J. Tang, H. Ma, Y. Dong, K. Wang, and J. Tang, “Deepinf: Social influence prediction with deep learning,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018, pp. 2110–2119.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Eric Yanchenko (14 papers)
  2. Tsuyoshi Murata (23 papers)
  3. Petter Holme (101 papers)
Citations (5)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now