Advertisement

Approximation Methods for Influence Maximization in Temporal Networks

  • Tsuyoshi MurataEmail author
  • Hokuto Koga
Chapter
Part of the Computational Social Sciences book series (CSS)

Abstract

The process of rumor spreading among people can be represented as information diffusion in a social network. The scale of the rumor spread can change greatly depending on the starting nodes. If we can select nodes that trigger large scale diffusion events, the nodes are expected to be important for viral marketing. Given a network and the number of starting nodes, the problem of selecting nodes for maximizing information diffusion is called as influence maximization problem. We propose three new approximation methods (Dynamic Degree Discount, Dynamic CI, and Dynamic RIS) for influence maximization problem in temporal networks. These methods are the extensions of previous methods for static networks to temporal networks. Although the performance of MC greedy was better than the three methods, it was computationally expensive and intractable for large-scale networks. The computational time of our proposed methods was more than 10 times faster than MC greedy. When compared with Osawa, the performances of the three methods were better for most of the cases.

Keywords

Influence maximization Temporal networks Diffusion SI model Degree discount 

Notes

Acknowledgement

This work was supported by JSPS Grant-in-Aid for Scientific Research(B) (Grant Number 17H01785).

References

  1. 1.
    Afshar, M., Asadpour, M.: Opinion formation by informed agents. J. Artif. Soc. Soc. Simul. 13(4), 1–5 (2010)CrossRefGoogle Scholar
  2. 2.
    Babaei, M., Mirzasoleiman, B., Jalili, M., Safari, M.A.: Revenue maximization in social networks through discounting. Soc. Netw. Anal. Min. 3(4), 1249–1262 (2013)CrossRefGoogle Scholar
  3. 3.
    Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946–957. (2014)Google Scholar
  4. 4.
    Braha, D., Bar-Yam, Y.: From centrality to temporary fame: Dynamic centrality in complex networks. Complexity 12(2), 59–63 (2006)CrossRefGoogle Scholar
  5. 5.
    Braha, D., Bar-Yam, Y.: Time-dependent complex networks: Dynamic centrality, dynamic motifs, and cycles of social interactions. In: Adaptive Networks: Theory, Models and Applications, pp. 39–50. Springer, Berlin (2009)Google Scholar
  6. 6.
    Chen, W., Lu, W., Zhang, N.: Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, pp. 592–598 (2012)Google Scholar
  7. 7.
    Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACMS IGKDD international conference on Knowledge discovery and data mining - KDD ’10, pp. 1029–1038 (2010)Google Scholar
  8. 8.
    Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD ’09, pp. 199–207 (2009)Google Scholar
  9. 9.
    Feng, S., Chen, X., Cong, G., Yifeng, Z., Yeow, Meng, C., Yanping, X.: Influence Maximization with Novelty Decay in Social Networks. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 37–43 (2014)Google Scholar
  10. 10.
    Garimella, K., Morales, G.D.F., Mathioudakis, M., Gionis, A.: Polarization on social media. Web Conf 2018 Tutorial 1(1), 1–191 (2018)Google Scholar
  11. 11.
    Gemmetto, V., Barrat, A., Cattuto, C.: Mitigation of infectious disease at school: targeted class closure vs school closure. BMC Infect. Dis. 14(1), 1 (2014)CrossRefGoogle Scholar
  12. 12.
    Habiba, Yu, Y., Berger-Wolf, T.Y., Saia, J.: Finding spread blockers in dynamic networks. In: Advances in Social Network Mining and Analysis, vol. 5498, pp. 55–76 (2010)CrossRefGoogle Scholar
  13. 13.
    Hill, S.A., Braha, D.: Dynamic model of time-dependent complex networks. Phys. Rev. E 82(046105), 1–7 (2010)Google Scholar
  14. 14.
    Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88(234), 1–30 (2015)Google Scholar
  15. 15.
    Holme, P., Saramäki, J.: Temporal networks. Phys. Rep. 519(3), 97–125 (2012)ADSCrossRefGoogle Scholar
  16. 16.
    Jalili, M.: Effects of leaders and social power on opinion formation in complex networks. Simulation 89(5), 578–588 (2012)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Jalili, M.: Social power and opinion formation in complex networks. Physica A 392(4), 959–966 (2013)ADSCrossRefGoogle Scholar
  18. 18.
    Jalili, M., Perc, M.: Information cascades in complex networks. J. Complex Networks 5(5), 665–693 (2017)MathSciNetGoogle Scholar
  19. 19.
    Jiang, Q., Song, G., Cong, G., Wang, Y., Si, W., Xie, K.: Simulated Annealing Based Influence Maximization in Social Networks. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, pp. 127–132 (2011)Google Scholar
  20. 20.
    Kempe, D., Kleinberg, J., 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 - KDD ’03, pp. 137–146 (2003)Google Scholar
  21. 21.
    Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective Outbreak Detection in Networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining- KDD ’07, pp. 420–429 (2007)Google Scholar
  22. 22.
    Mastrandrea, R., Fournet, J., Barrat, A.: Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PloS one 10(9), e0136497 (2015)CrossRefGoogle Scholar
  23. 23.
    Mihara, S., Tsugawa, S., Ohsaki, H.: Influence Maximization Problem for Unknown Social Networks. In: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015 - ASONAM ’15, pp. 1539–1546 (2015)Google Scholar
  24. 24.
    Morone, F., Makse, H.A.: Influence maximization in complex networks through optimal percolation. Nature 524(7563), 65–68 (2015)ADSCrossRefGoogle Scholar
  25. 25.
    Murata, T., Koga, H.: Methods for Influence Maximization in Dynamic Networks. In: Proceedings of the 6th International Conference on Complex Networks and Their Applications (Complex Networks 2017), Studies in Computational Intelligence, pp. 955–966. Springer, Berlin (2017)Google Scholar
  26. 26.
    Murata, T., Koga, H.: Extended Methods for Influence Maximization in Dynamic Networks. Comput. Soc. Networks 5(8), 1–21 (2018)Google Scholar
  27. 27.
    Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K.i.: Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 138–144 (2014)Google Scholar
  28. 28.
    Osawa, S., Murata, T.: Selecting Seed Nodes for Influence Maximization in Dynamic Networks. In: Proceedings of the 6th Workshop on Complex Networks (CompleNet 2015), Studies in Computational Intelligence, pp. 91–98. Springer, Berlin (2015)Google Scholar
  29. 29.
    Stehlé, J., Voirin, N., Barrat, A., Cattuto, C., Isella, L., Pinton, J.F., Quaggiotto, M., den Broeck, W., Régis, C., Lina, B., et al.: High-resolution measurements of face-to-face contact patterns in a primary school. PloS one 6(8), e23176 (2011)ADSCrossRefGoogle Scholar
  30. 30.
    Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75–86 (2014)Google Scholar
  31. 31.
    Vanhems, P., Barrat, A., Cattuto, C., Pinton, J.F., Khanafer, N., Régis, C., Kim, B.a., Comte, B., Voirin, N.: Estimating potential infection transmission routes in hospital wards using wearable proximity sensors. PloS one 8(9), e73970 (2013)ADSCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceSchool of Computing, Tokyo Institute of TechnologyMeguroJapan

Personalised recommendations