{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T02:02:04Z","timestamp":1750471324770,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030484774"},{"type":"electronic","value":"9783030484781"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48478-1_3","type":"book-chapter","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:57:21Z","timestamp":1591059441000},"page":"36-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Information Diffusion in Complex Networks: A Model Based on Hypergraphs and Its Analysis"],"prefix":"10.1007","author":[{"given":"Alessia","family":"Antelmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gennaro","family":"Cordasco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Spagnuolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemys\u0142aw","family":"Szufel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,2]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/comnet\/cnx001","volume":"5","author":"SG Aksoy","year":"2017","unstructured":"Aksoy, S.G., Kolda, T.G., Pinar, A.: Measuring and modeling bipartite graphs with community structure. J. Complex Netw. 5(4), 581\u2013603 (2017)","journal-title":"J. Complex Netw."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/GEM.2018.8516505"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Antelmi, A., et al.: SimpleHypergraphs.jl\u2013novel software framework for modelling and analysis of hypergraphs. In: Algorithms and Models for the Web Graph, pp. 115\u2013129 (2019)","DOI":"10.1007\/978-3-030-25070-6_9"},{"key":"3_CR4","unstructured":"Askwith, I.D.: Television 2.0: reconceptualizing TV as an engagement medium (2007). \nhttps:\/\/dspace.mit.edu\/handle\/1721.1\/41243"},{"key":"3_CR5","unstructured":"Avin, C., Lotker, Z., Peleg, D.: Random preferential attachment hypergraphs. Computer Science 23 (2015)"},{"key":"3_CR6","first-page":"4","volume":"23","author":"A Beveridge","year":"2016","unstructured":"Beveridge, A., Shan, J.: Network of thrones. Math. Horiz. 23, 4 (2016)","journal-title":"Math. Horiz."},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B Bollobas","year":"1976","unstructured":"Bollobas, B., Erd\u00f6s, P.: Cliques in random graphs. Math. Proc. Cambridge Philos. Soc. 80(3), 419\u2013427 (1976)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-319-92871-5_9"},{"key":"3_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0","volume-title":"Hypergraph Theory: An Introduction","author":"A Bretto","year":"2013","unstructured":"Bretto, A.: Hypergraph Theory: An Introduction. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-319-00080-0"},{"issue":"2","key":"3_CR10","first-page":"161","volume":"4","author":"L Bruno","year":"2019","unstructured":"Bruno, L., Miriam, H.: The house of black and white: identities of color and power relations in the game of thrones. Revista N\u00f3s 4(2), 161\u2013182 (2019)","journal-title":"Revista N\u00f3s"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"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\u20133186 (2019)","DOI":"10.1145\/3292500.3332285"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discrete Math. 23(3), 1400\u20131415 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR13","doi-asserted-by":"publisher","DOI":"10.2200\/S00527ED1V01Y201308DTM037","volume-title":"Information and Influence Propagation in Social Networks","author":"W Chen","year":"2013","unstructured":"Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and Influence Propagation in Social Networks. Morgan & Claypool Publishers, San Rafael (2013)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K., Lu, L.: Complex graphs and networks. In: CBMS Regional Conference Series in Mathematics (2006)","DOI":"10.1090\/cbms\/107"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548300001796","volume":"5","author":"C Cooper","year":"1996","unstructured":"Cooper, C., Frieze, A., Molloy, M., Reed, B.: Perfect matchings in random r-regular, s-uniform hypergraphs. Comb. Probab. Comput. 5(1), 1\u201314 (1996)","journal-title":"Comb. Probab. Comput."},{"issue":"6","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1007\/s00453-017-0390-5","volume":"80","author":"G Cordasco","year":"2018","unstructured":"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\u20131833 (2018)","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0408-z","volume":"6","author":"G Cordasco","year":"2016","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: On finding small sets that influence large networks. Soc. Netw. Anal. Min. 6(1), 1\u201320 (2016). \nhttps:\/\/doi.org\/10.1007\/s13278-016-0408-z","journal-title":"Soc. Netw. Anal. Min."},{"key":"3_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)"},{"key":"3_CR19","first-page":"1","volume":"21","author":"D Ellis","year":"2014","unstructured":"Ellis, D., Linial, N.: On regular hypergraphs of high girth. Electron. J. Comb. 21, 1 (2014)","journal-title":"Electron. J. Comb."},{"key":"3_CR20","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of Hungarian Academy Of Science, pp.\u00a017\u201361 (1960)"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.ipm.2019.102056","volume":"57","author":"H Fani","year":"2020","unstructured":"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)","journal-title":"Inf. Process. Manage."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"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\u2013100 (2019)","DOI":"10.1145\/3341161.3342922"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"066118","DOI":"10.1103\/PhysRevE.79.066118","volume":"79","author":"G Ghoshal","year":"2009","unstructured":"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)","journal-title":"Phys. Rev. E: Stat. Nonlin. Soft Matter Phys."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"G\u00f6bel, M., Ara\u00fajo, T.: A network structure analysis of economic crises. In: Complex Networks and Their Applications VIII, pp. 547\u2013560 (2020)","DOI":"10.1007\/978-3-030-36683-4_44"},{"key":"3_CR25","unstructured":"HBO: Game of Thrones (2019). \nhttps:\/\/www.hbo.com\/game-of-thrones"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"H\u00e9ctor, J.P., Rainer, R.: On Jon Snow\u2019s death: plot twist and global fandom in Game of Thrones. Cult. Psychol. (2019). \nhttps:\/\/doi.org\/10.1177\/1354067X19845062","DOI":"10.1177\/1354067X19845062"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-030-36683-4_62"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"2485","DOI":"10.1038\/s41467-019-10431-6","volume":"10","author":"I Iacopini","year":"2019","unstructured":"Iacopini, I., Petri, G., Barrat, A., Latora, V.: Simplicial models of social contagion. Nat. Commun. 10, 2485 (2019)","journal-title":"Nat. Commun."},{"key":"3_CR29","first-page":"493","volume":"77","author":"W Jian-Wei","year":"2010","unstructured":"Jian-Wei, W., Li-Li, R., Qiu-Hong, R., Ji-Yong, Z.: Evolving hypernetwork model. Phys. Condens. Matter 77, 493\u2013498 (2010)","journal-title":"Phys. Condens. Matter"},{"key":"3_CR30","unstructured":"Joslyn, C., et al.: High performance hypergraph analytics of domain name system relationships. In: HICSS Symposium on Cybersecurity Big Data Analytics (2019)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"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.\u00a0137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"3_CR32","unstructured":"Lately, D.: An Army of Eyeballs: The Rise of the Advertisee (2014). \nhttps:\/\/thebaffler.com\/latest\/an-army-of-eyeballs\n\n. (Online; 2019)"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"42052","DOI":"10.1109\/ACCESS.2019.2894155","volume":"7","author":"Q Liqing","year":"2019","unstructured":"Liqing, Q., Jinfeng, Y., Xin, F., Wei, J., Wenwen, G.: Analysis of influence maximization in temporal social networks. IEEE Access 7, 42052\u201342062 (2019)","journal-title":"IEEE Access"},{"issue":"1","key":"3_CR34","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10767-017-9273-7","volume":"32","author":"M Milkoreit","year":"2019","unstructured":"Milkoreit, M.: Pop-cultural mobilization: deploying game of thrones to shift us climate change politics. Int. J. Polit. Cult. Soc. 32(1), 61\u201382 (2019)","journal-title":"Int. J. Polit. Cult. Soc."},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"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\u2013672 (2020)","DOI":"10.1007\/978-3-030-36687-2_55"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-90731-4_9","volume-title":"The Interplay Between Political Theory and Movies","author":"W Muno","year":"2019","unstructured":"Muno, W.: \u201cWinter is coming?\u201d Game of Thrones and realist thinking. In: Hamenst\u00e4dt, U. (ed.) The Interplay Between Political Theory and Movies, pp. 135\u2013149. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-319-90731-4_9"},{"issue":"9","key":"3_CR37","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1136\/bjsports-2017-098170","volume":"53","author":"RE Rhodes","year":"2019","unstructured":"Rhodes, R.E., Zehr, E.P.: Fight, flight or finished: forced fitness behaviours in game of thrones. Br. J. Sports Med. 53(9), 576\u2013580 (2019)","journal-title":"Br. J. Sports Med."},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-030-36683-4_64"},{"issue":"3","key":"3_CR39","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TPAMI.2008.232","volume":"31","author":"J Silva","year":"2008","unstructured":"Silva, J., Willett, R.: Hypergraph-based anomaly detection of high-dimensional co-occurrences. IEEE Trans. Pattern Anal. Mach. Intell. 31(3), 563\u2013569 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0223-3","volume":"5","author":"J Tien","year":"2020","unstructured":"Tien, J., Eisenberg, M., Cherng, S., Porter, M.: Online reactions to the 2017 \u2018unite the right\u2019 rally in charlottesville: measuring polarization in twitter networks using media followership. Appl. Netw. Sci. 5, 1 (2020)","journal-title":"Appl. Netw. Sci."},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Verba, M.A.: \u201cLearning hubs\u201d on the global innovation network. In: Complex Networks and Their Applications VIII, pp. 620\u2013632 (2020)","DOI":"10.1007\/978-3-030-36683-4_50"},{"issue":"4","key":"3_CR42","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1109\/TNSE.2018.2873759","volume":"6","author":"J Zhu","year":"2019","unstructured":"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\u2013811 (2019)","journal-title":"IEEE Trans. Netw. Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48478-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:57:35Z","timestamp":1591059455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48478-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030484774","9783030484781"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48478-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.ryerson.ca\/waw2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was postponed from June 2020 to September 2020 due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}