Abstract
This work introduces the problem of social influence diffusion in complex networks, where vertices are linked not only through simple pairwise relationships to other nodes but with groups of nodes of arbitrary size. A challenging problem that arises in this domain is to determine a small subset of nodes S (a target-set) able to spread their influence in the whole network. This problem has been formalized and studied in different ways, and many viable solutions have been found for graphs. These have been applied to study several phenomena in research fields such as social, economic, biological, and physical sciences.
In this contribution, we investigated the social influence problem on hypergraphs. As hypergraphs are mathematical structures generalization of graphs, they can naturally model the many-to-many relationships characterizing a complex network. Given a network represented by a hypergraph \(H=(V,E)\), we consider a dynamic influence diffusion process on H, evolving as follows. At the beginning of the process, the nodes in a given set \(S\subseteq V\) are influenced. Then, at each iteration, the influenced hyperedges set is augmented by all hyperedges having a sufficiently large number of influenced nodes. Consequently, the set of influenced nodes is extended by all the nodes contained in a sufficiently large number of already influenced hyperedges. The process terminates when no new nodes can be influenced.
The so defined problem is an inherent chicken-and-egg question as nodes are influenced by groups of other nodes (or hyperedges), while hyperedges (or group of nodes) are influenced by the nodes they contain. In this paper, we provide a formal definition of the influence diffusion problem on hypergraphs. We propose a set of greedy-based heuristic strategies for finding the minimum influence target set, and we present an in-depth analysis of their performance on several classes of random hypergraphs. Furthermore, we describe an experiment on a real use-case, based on the character co-occurrences network of the Game-of-Thrones TV Series.
The research is financed by NAWA—The Polish National Agency for Academic Exchange.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
- 2.
- 3.
Game of Thrones Datasets and Visualizations. https://github.com/jeffreylancaster/game-of-thrones by Jeffrey Lancaster.
References
Aksoy, S.G., Kolda, T.G., Pinar, A.: Measuring and modeling bipartite graphs with community structure. J. Complex Netw. 5(4), 581–603 (2017)
Antelmi, A., Breslin, J., Young, K.: Understanding user engagement with entertainment media: a case study of the twitter behaviour of Game of Thrones (GoT) fans. In: 2018 IEEE Games, Entertainment, Media Conference (GEM) (2018)
Antelmi, A., et al.: SimpleHypergraphs.jl–novel software framework for modelling and analysis of hypergraphs. In: Algorithms and Models for the Web Graph, pp. 115–129 (2019)
Askwith, I.D.: Television 2.0: reconceptualizing TV as an engagement medium (2007). https://dspace.mit.edu/handle/1721.1/41243
Avin, C., Lotker, Z., Peleg, D.: Random preferential attachment hypergraphs. Computer Science 23 (2015)
Beveridge, A., Shan, J.: Network of thrones. Math. Horiz. 23, 4 (2016)
Bollobas, B., Erdös, P.: Cliques in random graphs. Math. Proc. Cambridge Philos. Soc. 80(3), 419–427 (1976)
Bonato, A., Eikmeier, N., Gleich, D.F., Malik, R.: Dynamic competition networks: detecting alliances and leaders. In: Algorithms and Models for the Web Graph (2018)
Bretto, A.: Hypergraph Theory: An Introduction. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-319-00080-0
Bruno, L., Miriam, H.: The house of black and white: identities of color and power relations in the game of thrones. Revista Nós 4(2), 161–182 (2019)
Cautis, B., Maniu, S., Tziortziotis, N.: Adaptive influence maximization. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 3185–3186 (2019)
Chen, N.: On the approximability of influence in social networks. SIAM J. Discrete Math. 23(3), 1400–1415 (2009)
Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and Influence Propagation in Social Networks. Morgan & Claypool Publishers, San Rafael (2013)
Chung, F.R.K., Lu, L.: Complex graphs and networks. In: CBMS Regional Conference Series in Mathematics (2006)
Cooper, C., Frieze, A., Molloy, M., Reed, B.: Perfect matchings in random r-regular, s-uniform hypergraphs. Comb. Probab. Comput. 5(1), 1–14 (1996)
Cordasco, G., Gargano, L., Mecchia, M., Rescigno, A.A., Vaccaro, U.: Discovering small target sets in social networks: a fast and effective algorithm. Algorithmica 80(6), 1804–1833 (2018)
Cordasco, G., Gargano, L., Rescigno, A.A.: On finding small sets that influence large networks. Soc. Netw. Anal. Min. 6(1), 1–20 (2016). https://doi.org/10.1007/s13278-016-0408-z
Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)
Ellis, D., Linial, N.: On regular hypergraphs of high girth. Electron. J. Comb. 21, 1 (2014)
Erdős, P., Rényi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of Hungarian Academy Of Science, pp. 17–61 (1960)
Fani, H., Jiang, E., Bagheri, E., Al-Obeidat, F., Du, W., Kargar, M.: User community detection via embedding of social network structure and temporal content. Inf. Process. Manage. 57, 2 (2020)
Ghayoori, A., Nagi, R.: Seed investment bounds for viral marketing under generalized diffusion. In: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 95–100 (2019)
Ghoshal, G., Zlatic, V., Caldarelli, G., Newman, M.E.J.: Random hypergraphs and their applications. Phys. Rev. E: Stat. Nonlin. Soft Matter Phys. 79, 066118 (2009)
Göbel, M., Araújo, T.: A network structure analysis of economic crises. In: Complex Networks and Their Applications VIII, pp. 547–560 (2020)
HBO: Game of Thrones (2019). https://www.hbo.com/game-of-thrones
Héctor, J.P., Rainer, R.: On Jon Snow’s death: plot twist and global fandom in Game of Thrones. Cult. Psychol. (2019). https://doi.org/10.1177/1354067X19845062
Hossain, M., Khan, A., Uddin, S.: Understanding the progression of congestive heart failure of type 2 diabetes patient using disease network and hospital claim data. In: Complex Networks and Their Applications, VIII (2020)
Iacopini, I., Petri, G., Barrat, A., Latora, V.: Simplicial models of social contagion. Nat. Commun. 10, 2485 (2019)
Jian-Wei, W., Li-Li, R., Qiu-Hong, R., Ji-Yong, Z.: Evolving hypernetwork model. Phys. Condens. Matter 77, 493–498 (2010)
Joslyn, C., et al.: High performance hypergraph analytics of domain name system relationships. In: HICSS Symposium on Cybersecurity Big Data Analytics (2019)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146 (2003)
Lately, D.: An Army of Eyeballs: The Rise of the Advertisee (2014). https://thebaffler.com/latest/an-army-of-eyeballs. (Online; 2019)
Liqing, Q., Jinfeng, Y., Xin, F., Wei, J., Wenwen, G.: Analysis of influence maximization in temporal social networks. IEEE Access 7, 42052–42062 (2019)
Milkoreit, M.: Pop-cultural mobilization: deploying game of thrones to shift us climate change politics. Int. J. Polit. Cult. Soc. 32(1), 61–82 (2019)
Moutidis, I., Williams, H.T.P.: Utilizing complex networks for event detection in heterogeneous high-volume news streams. In: Complex Networks and Their Applications VIII, pp. 659–672 (2020)
Muno, W.: “Winter is coming?” Game of Thrones and realist thinking. In: Hamenstädt, U. (ed.) The Interplay Between Political Theory and Movies, pp. 135–149. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-90731-4_9
Rhodes, R.E., Zehr, E.P.: Fight, flight or finished: forced fitness behaviours in game of thrones. Br. J. Sports Med. 53(9), 576–580 (2019)
Romero, M., Finke, J., Quimbaya, M., Rocha, C.: In-silico gene annotation prediction using the co-expression network structure. In: Complex Networks and Their Applications, VIII (2020)
Silva, J., Willett, R.: Hypergraph-based anomaly detection of high-dimensional co-occurrences. IEEE Trans. Pattern Anal. Mach. Intell. 31(3), 563–569 (2008)
Tien, J., Eisenberg, M., Cherng, S., Porter, M.: Online reactions to the 2017 ‘unite the right’ rally in charlottesville: measuring polarization in twitter networks using media followership. Appl. Netw. Sci. 5, 1 (2020)
Verba, M.A.: “Learning hubs” on the global innovation network. In: Complex Networks and Their Applications VIII, pp. 620–632 (2020)
Zhu, J., Zhu, J., Ghosh, J., Wu, W., Yuan, J.: Social influence maximization in hypergraph in social networks. IEEE Trans. Netw. Sci. Eng. 6(4), 801–811 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Antelmi, A., Cordasco, G., Spagnuolo, C., Szufel, P. (2020). Information Diffusion in Complex Networks: A Model Based on Hypergraphs and Its Analysis. In: Kamiński, B., Prałat, P., Szufel, P. (eds) Algorithms and Models for the Web Graph. WAW 2020. Lecture Notes in Computer Science(), vol 12091. Springer, Cham. https://doi.org/10.1007/978-3-030-48478-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-48478-1_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-48477-4
Online ISBN: 978-3-030-48478-1
eBook Packages: Computer ScienceComputer Science (R0)