Skip to main content

Advertisement

Springer Nature Link
Log in

Efficient information diffusion in time-varying graphs through deep reinforcement learning

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Network seeding for efficient information diffusion over time-varying graphs (TVGs) is a challenging task with many real-world applications. There are several ways to model this spatio-temporal influence maximization problem, but the ultimate goal is to determine the best moment for a node to start the diffusion process. In this context, we propose Spatio-Temporal Influence Maximization (STIM), a model trained with Reinforcement Learning and Graph Embedding over a set of artificial TVGs that is capable of learning the temporal behavior and connectivity pattern of each node, allowing it to predict the best moment to start a diffusion through the TVG. We focus on the scenario where some nodes in the TVG present periodic connectivity patterns, an aspect that received little attention in previous approaches. We also develop a special set of artificial TVGs used for training that simulate a stochastic diffusion process in TVGs, showing that the STIM network can learn an efficient policy even over a non-deterministic environment. After trained, STIM can be used in TVGs of any size, since the number of parameters of the model is independent to the size of the TVG being processed. STIM is also evaluated in two real-world TVGs, where it also manages to efficiently propagate information through the nodes. Finally, we also show that the STIM model has a time complexity of O(|E|). STIM is also highly versatile, where one can change the goal of the model by simply changing the adopted reward function.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. https://github.com/MatheusMRFM/STIM

  2. http://snap.stanford.edu/data/email-Eu-core-temporal.html

  3. http://www.sociopatterns.org/datasets/

References

  1. Bao, Y, Wang, X, Wang, Z, Wu, C, Lau, FCM: Online influence maximization in non-stationary social networks. In: 2016 IEEE/ACM 24th international symposium on quality of service (IWQoS), pp 1–6 (2016)

  2. Barabási, AL, Albert, R: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bellemare, MG, Dabney, W, Munos, R: A distributional perspective on reinforcement learning. In: Proceedings of the international conference on machine learning, ICML ’17, pp 449–458 (2017)

  4. Berahmand, K, Bouyer, A, Samadi, N: A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks. Chaos, Solitons & Fractals 110, 41–54 (2018)

    Article  MATH  Google Scholar 

  5. 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. SIAM, pp 946–957 (2014)

  6. Casteigts, A, Flocchini, P, Quattrociocchi, W, Santoro, N: Time-varying graphs and dynamic networks. Int J Parallel Emergent Distrib Syst 27(5), 387–408 (2012)

    Article  Google Scholar 

  7. Cattuto, C, Van den Broeck, W, Barrat, A, Colizza, V, Pinton, JF, Vespignani, A: Dynamics of person-to-person interactions from distributed rfid sensor networks. PLOS ONE 5(7), 1–9 (2010)

    Article  Google Scholar 

  8. Chen, D, Lü, L, Shang, MS, Zhang, Y, Zhou, T: Identifying influential nodes in complex networks. Physica A: Stat Mech Applic 391 (4), 1777–1787 (2012)

    Article  Google Scholar 

  9. Chen, W, Wang, Y, Yang, S: Efficient influence maximization in social networks. In: International conference on knowledge discovery and data mining, KDD ’09. ACM, pp 199–208 (2009)

  10. Chiu, SI, Hsu, KW: Information diffusion on facebook: a case study of the sunflower student movement in taiwan. In: International conference on ubiquitous information management and communication, IMCOM ’17. ACM, New York (2017)

  11. Costa, EC, Vieira, AB, Wehmuth, K, Ziviani, A, Da Silva, APC: Time centrality in dynamic complex networks. Advances in Complex Systems 18(07n08) (2015)

  12. Dai, H, Dai, B, Song, L: Discriminative embeddings of latent variable models for structured data. In: International conference on machine learning, ICML’16, pp 2702–2711 (2016)

  13. de Souza, R, Figueiredo, D, de Rocha, AA, Ziviani, A: Efficient network seeding under variable node cost and limited budget for social networks. Inform Sci 514, 369–384 (2020)

    Article  MathSciNet  Google Scholar 

  14. Goldenberg, J, Libai, B, Muller, E: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Market Lett 12(3), 211–223 (2001)

    Article  Google Scholar 

  15. Hochreiter, S, Schmidhuber, J: Long short-term memory. Neur Comput 9(8), 1735–1780 (1997)

    Article  Google Scholar 

  16. Joyce, KE, Laurienti, PJ, Burdette, JH, Hayasaka, S: A new measure of centrality for brain networks. PloS ONE 5(8), e12200 (2010)

    Article  Google Scholar 

  17. Kamarthi, H, Vijayan, P, Wilder, B, Ravindran, B, Tambe, M: Influence maximization in unknown social networks: learning policies for effective graph sampling, p 575–583. International Foundation for Autonomous Agents and Multiagent Systems. Richland. SC (2020)

  18. Kempe, D, Kleinberg, J, Tardos, E: Maximizing the spread of influence through a social network. In: ACM SIGKDD International conference on knowledge discovery and data mining, KDD ’03. ACM, pp 137–146 (2003)

  19. Kempe, D, Kleinberg, J, Tardos, É: Programming Influential nodes in a diffusion model for social networks. In: Caires, L, Italiano, GF, Monteiro, L, Palamidessi, C, Yung, M (eds.) Languages automata, pp 1127–1138. Springer, Berlin (2005)

  20. Khalil, E, Dai, H, Zhang, Y, Dilkina, B, Song, L: Learning combinatorial optimization algorithms over graphs. In: Advances in neural information processing systems 30 (NIPS), pp 6348–6358. Curran Associates Inc (2017)

  21. Kim, H, Yoneki, E: Influential neighbours selection for information diffusion in online social networks. In: International conference on computer communications and networks (ICCCN), pp 1–7 (2012)

  22. Kipf, TN, Welling, M: Semi-supervised classification with graph convolutional networks. In: International conference on learning representations (ICLR) (2017)

  23. Kitsak, M, Gallos, LK, Havlin, S, Liljeros, F, Muchnik, L, Stanley, HE, Makse, HA: Identification of influential spreaders in complex networks. Nat Phys 6(11), 888–893 (2010)

    Article  Google Scholar 

  24. Leskovec, J, Kleinberg, J, Faloutsos, C: Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1), 2–es (2007)

    Article  Google Scholar 

  25. Liu, J, Xiong, Q, Shi, W, Shi, X, Wang, K: Evaluating the importance of nodes in complex networks. Physica A: Stat Mech Applic 452, 209–219 (2016)

    Article  Google Scholar 

  26. Liu, N, An, H, Gao, X, Li, H, Hao, X: Breaking news dissemination in the media via propagation behavior based on complex network theory. Physica A: Stat Mech Applic 453, 44–54 (2016)

    Article  Google Scholar 

  27. Magnien, C, Tarissan, F: Time evolution of the importance of nodes in dynamic networks. In: International conference on advances in social networks analysis and mining, pp 1200–1207 (2015)

  28. Nadini, M, Sun, K, Ubaldi, E, Starnini, M, Rizzo, A, Perra, N: Epidemic spreading in modular time-varying networks. Sci Rep 8(1), 1–11 (2018)

    Article  Google Scholar 

  29. Ohsaka, N, Akiba, T, Yoshida, Y, Kawarabayashi, Ki: Dynamic influence analysis in evolving networks. Proc VLDB Endow 9(12), 1077–1088 (2016)

    Article  Google Scholar 

  30. Ohsaka, N, Yamaguchi, Y, Kakimura, N, Kawarabayashi, KI: Maximizing time-decaying influence in social networks. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 132–147 (2016)

  31. Qiu, J, Tang, J, Ma, H, Dong, Y, Wang, K, Tang, J: Deepinf: social influence prediction with deep learning. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, p 2110–2119 (2018)

  32. Tong, G, Wu, W, Tang, S, Du, D: Adaptive influence maximization in dynamic social networks. IEEE/ACM Trans Network 25(1), 112–125 (2017)

    Article  Google Scholar 

  33. Wang, Z, Pei, X, Wang, Y, Yao, Y: Ranking the key nodes with temporal degree deviation centrality on complex networks. In: Chinese control and decision conference (CCDC), pp 1484–1489 (2017)

  34. Wehmuth, K, Fleury, É, Ziviani, A: Multiaspect graphs: algebraic representation and algorithms. Algorithms 10(1) (2017)

  35. Wehmuth, K, Ziviani, A: DACCER: distributed assessment of the closeness centrality ranking in complex networks. Comput Netw 57(13), 2536–2548 (2013)

    Article  Google Scholar 

  36. Wu, X, Fu, L, Zhang, Z, Long, H, Meng, J, Wang, X, Chen, G: Evolving influence maximization in evolving networks. ACM Trans Internet Technol 20(4) (2020)

  37. Ying, R, You, J, Morris, C, Ren, X, Hamilton, WL, Leskovec, J: Hierarchical graph representation learning with differentiable pooling. In: Proceedings of the 32nd international conference on neural information processing systems, NIPS’18, pp 4805–4815. Curran Associates Inc., Red Hook (2018)

  38. Zhang, B, Zhang, L, Mu, C, Zhao, Q, Song, Q, Hong, X: A most influential node group discovery method for influence maximization in social networks: a trust-based perspective. Data & Knowl Eng 121, 71–87 (2019)

    Article  Google Scholar 

Download references

Acknowledgements

This work has been partially supported by CAPES, CNPq, and FAPERJ. Authors also acknowledge the INCT in Data Science – INCT-CiD. Moreover, this paper is dedicated to the memory of our dear co-worker Artur Ziviani, who passed away while this paper was being peer-reviewed. Artur was a brilliant researcher and a dedicated advisor.

Author information

Author notes

  1. Matheus R. F. Mendonça

    Present address: Microsoft Research, São Paulo, SP, Brazil

  2. André M. S. Barreto

    Present address: DeepMind, London, UK

Authors and Affiliations

  1. National Laboratory for Scientific Computing (LNCC), Petrópolis, RJ, Brazil

    Matheus R. F. Mendonça, André M. S. Barreto & Artur Ziviani

Authors
  1. Matheus R. F. Mendonça
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. André M. S. Barreto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Artur Ziviani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matheus R. F. Mendonça.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article belongs to the Topical Collection: Special Issue on Computational Aspects of Network Science

Guest Editors: Apostolos N. Papadopoulos and Richard Chbeir

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mendonça, M.R.F., Barreto, A.M.S. & Ziviani, A. Efficient information diffusion in time-varying graphs through deep reinforcement learning. World Wide Web 25, 2535–2560 (2022). https://doi.org/10.1007/s11280-021-00998-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-021-00998-w

Keywords

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy