Parallel Simulation of Community-Wide Information Spreading in Online Social Networks
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).
KeywordsParallel simulation Model of information spread Online social networks
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.
- 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.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
- 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
- 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.Apache Giraph. http://giraph.apache.org/
- 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.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.Tsourakakis, C.E.: Streaming Graph Partitioning in the Planted Partition Model (2014). https://doi.org/10.1145/2817946.2817950
- 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