Advertisement

Parallel Simulation of Community-Wide Information Spreading in Online Social Networks

  • Sergey Kesarev
  • Oksana Severiukhina
  • Klavdiya Bochenina
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 965)

Abstract

Models of information spread in online social networks (OSNs) are in high demand these days. Most of them consider peer-to-peer interaction on a predefined topology of friend network. However, in particular types of OSNs the largest information cascades are observed during the community-user interaction when communities play the role of superspreaders for their audience. In the paper, we consider the problem of the parallel simulation of community-wide information spreading in large-scale (up to dozens of millions of nodes) networks. The efficiency of parallel algorithm is studied for synthetic and real-world social networks from VK.com using the Lomonosov supercomputer (Moscow State University, Russian Federation).

Keywords

Parallel simulation Model of information spread Online social networks 

Notes

Acknowledgements

This research was supported by The Russian Scientific Foundation, Agreement #14-21-00137-\(\Pi \) (02.05.2017). The research was carried out using the equipment of the shared research facilities of HPC computing resources at Lomonosov Moscow State University.

References

  1. 1.
    Bisset, K.R., Chen, J., Feng, X., Kumar, V.S.A., Marathe, M.V: EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems. In: Proceedings of the 23rd International Conference on Supercomputing, pp. 430–439 (2009)Google Scholar
  2. 2.
    Barrett, C., Bisset, K.R., Eubank Stephen, G., Feng, X., Marathe, M.: EpiSimdemics: an efficient and scalable framework for simulating the spread of infectious disease on large social networks. In: International Conference for High Performance Computing, Networking, Storage Analysis (2008).  https://doi.org/10.1145/1413370.1413408
  3. 3.
    Bisset, K.R., Chen, J., Deodhar, S., Feng, X., Ma, Y., Marathe, M.V.: Indemics: an interactive high-performance computing framework for data intensive epidemic modeling. ACM Trans. Model. Comput. Simul. 24, 1–32 (2014).  https://doi.org/10.1145/2501602MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Hou, B., Yao, Y., Wang, B., Liao, D.: Modeling and simulation of large-scale social networks using parallel discrete event simulation. Simulation 89, 1173–1183 (2013).  https://doi.org/10.1177/0037549713495752CrossRefGoogle Scholar
  5. 5.
    Hou, B., Yao, Y.: COMMPAR: A community-based model partitioning approach for large-scale networked social dynamics simulation. In: Proceedings - IEEE International Symposium on Distributed Simulation and Real-Time Applications, DS-RT. pp. 7–13. IEEE (2010)Google Scholar
  6. 6.
    Staudt, C.L., Meyerhenke, H.: Engineering parallel algorithms for community detection in massive networks. IEEE Trans. Parallel Distrib. Syst. 27, 171–184 (2016).  https://doi.org/10.1109/TPDS.2015.2390633CrossRefGoogle Scholar
  7. 7.
    Bochenina, K., Kesarev, S., Boukhanovsky, A.: Scalable parallel simulation of dynamical processes on large stochastic Kronecker graphs. Futur. Gener. Comput. Syst. 78, 502–515 (2017).  https://doi.org/10.1016/j.future.2017.07.021CrossRefGoogle Scholar
  8. 8.
    Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing - PODC 2009, p. 6 (2009)Google Scholar
  9. 9.
  10. 10.
    Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: Distributed GraphLab: A Framework for Machine Learning in the Cloud, pp. 716-727 (2012).  https://doi.org/10.14778/2212351.2212354
  11. 11.
    Buluc, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent Advances in Graph Partitioning. CoRR. abs/1311.3, (2013).  https://doi.org/10.1007/978-3-319-49487-6_4
  12. 12.
    Tsourakakis, C.E.: Streaming Graph Partitioning in the Planted Partition Model (2014).  https://doi.org/10.1145/2817946.2817950
  13. 13.
    Severiukhina, O., Bochenina, K., Kesarev, S., Boukhanovsky, A.: Parallel data-driven modeling of information spread in social networks. In: Shi, Y., Fu, H., Tian, Y., Krzhizhanovskaya, V.V., Lees, M.H., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2018. LNCS, vol. 10860, pp. 247–259. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-93698-7_19CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Sergey Kesarev
    • 1
  • Oksana Severiukhina
    • 1
  • Klavdiya Bochenina
    • 1
  1. 1.ITMO UniversitySaint PetersburgRussia

Personalised recommendations