{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T08:01:25Z","timestamp":1781596885729,"version":"3.54.5"},"reference-count":92,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T00:00:00Z","timestamp":1745971200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T00:00:00Z","timestamp":1745971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Science Centre, Poland","award":["2022\/45\/B\/ST6\/04145"],"award-info":[{"award-number":["2022\/45\/B\/ST6\/04145"]}]},{"name":"National Science Centre, Poland","award":["2022\/45\/B\/ST6\/04145"],"award-info":[{"award-number":["2022\/45\/B\/ST6\/04145"]}]},{"DOI":"10.13039\/100018693","name":"HORIZON EUROPE Framework Programme","doi-asserted-by":"publisher","award":["101086321"],"award-info":[{"award-number":["101086321"]}],"id":[{"id":"10.13039\/100018693","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018693","name":"HORIZON EUROPE Framework Programme","doi-asserted-by":"publisher","award":["101086321"],"award-info":[{"award-number":["101086321"]}],"id":[{"id":"10.13039\/100018693","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The problem of selecting an optimal seed set to maximise influence in networks has been a subject of intense research in recent years. However, despite numerous works addressing this area, it remains a topic that requires further elaboration. Most often, it is considered within the scope of classically defined graphs with a spreading model in the form of Independent Cascades. In this work, we focus on the problem of budget-constrained influence maximisation in multilayer networks using a Linear Threshold Model. Both the graph model and the spreading process we employ are less prevalent in the literature, even though their application allows for a more precise representation of the opinion dynamics in social networks. This paper aims to answer which of the sixteen evaluated seed selection methods is the most effective and how similar they are. Additionally, we focus our analysis on the impact of spreading model parameters, network characteristics, a budget, and the seed selection methods on the diffusion effectiveness in multilayer networks. Our contribution also includes extending several centrality measures and heuristics to the case of such graphs. The results indicate that all the factors mentioned above collectively contribute to the effectiveness of influence maximisation. Moreover, there is no seed selection method which always provides the best results. However, the seeds chosen with VoteRank-based methods (especially with the\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$v-rnk-m$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>v<\/mml:mi>\n                            <mml:mo>-<\/mml:mo>\n                            <mml:mi>r<\/mml:mi>\n                            <mml:mi>n<\/mml:mi>\n                            <mml:mi>k<\/mml:mi>\n                            <mml:mo>-<\/mml:mo>\n                            <mml:mi>m<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    variant we propose) usually provide the most extensive diffusion.\n                  <\/jats:p>","DOI":"10.1007\/s13278-025-01454-7","type":"journal-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T07:41:37Z","timestamp":1746171697000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Rank-refining seed selection methods for budget constrained influence maximisation in multilayer networks under linear threshold model"],"prefix":"10.1007","volume":"15","author":[{"given":"Micha\u0142","family":"Czuba","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piotr","family":"Br\u00f3dka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,30]]},"reference":[{"key":"1454_CR1","doi-asserted-by":"publisher","unstructured":"Asgharian Rezaei A, Munoz J, Jalili M, Khayyam H (2023) A machine learning-based approach for vital node identification in complex networks. Expert Systems with Applications 214: 119086 https:\/\/doi.org\/10.1016\/j.eswa.2022.119086","DOI":"10.1016\/j.eswa.2022.119086"},{"issue":"11","key":"1454_CR2","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.physleta.2017.01.043","volume":"381","author":"ZK Bao","year":"2017","unstructured":"Bao ZK, Liu JG, Zhang HF (2017) Identifying multiple influential spreaders by a heuristic clustering algorithm. Phys Lett A 381(11):976\u2013983. https:\/\/doi.org\/10.1016\/j.physleta.2017.01.043","journal-title":"Phys Lett A"},{"key":"1454_CR3","unstructured":"Bollobas B, Borgs C, Chayes J, Riordan O (2003) Directed Scale-Free Graphs, In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003), pp. 132\u2013139. https:\/\/www.microsoft.com\/en-us\/research\/publication\/directed-scale-free-graphs\/"},{"key":"1454_CR4","doi-asserted-by":"publisher","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Society for Industrial and Applied Mathematics, USA, 2014), SODA \u201914, p. 946-957https:\/\/doi.org\/10.5555\/2634074.2634144","DOI":"10.5555\/2634074.2634144"},{"key":"1454_CR5","doi-asserted-by":"publisher","unstructured":"Br\u00f3dka P, Jankowski J, Michalski R (2021) Sequential seeding in multilayer networks. Chaos: An Interdisciplinary Journal of Nonlinear Science 31(3), 033130 https:\/\/doi.org\/10.1063\/5.0023427","DOI":"10.1063\/5.0023427"},{"issue":"1","key":"1454_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-77536-7","volume":"10","author":"D Bucur","year":"2020","unstructured":"Bucur D (2020) Top influencers can be identified universally by combining classical centralities. Sci Rep 10(1):1\u201314. https:\/\/doi.org\/10.1038\/s41598-020-77536-7","journal-title":"Sci Rep"},{"issue":"1344","key":"1454_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep01344","volume":"3","author":"A Cardillo","year":"2013","unstructured":"Cardillo A, G\u00f3mez-Garde\u00f1es J, Zanin M, Romance M, Papo D, Pozo Fd, Boccaletti S (2013) Emergence of network features from multiplexity. Sci Rep 3(1344):1\u20136. https:\/\/doi.org\/10.1038\/srep01344","journal-title":"Sci Rep"},{"issue":"27","key":"1454_CR8","doi-asserted-by":"publisher","first-page":"11150","DOI":"10.1073\/pnas.0701175104","volume":"104","author":"S Carmi","year":"2007","unstructured":"Carmi S, Havlin S, Kirkpatrick S, Shavitt Y, Shir E (2007) A model of internet topology using<i>k<\/i>-shell decomposition. Proc Natl Acad Sci 104(27):11150\u201311154. https:\/\/doi.org\/10.1073\/pnas.0701175104","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"1454_CR9","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1631\/1\/012064","volume":"1631","author":"J Chen","year":"2020","unstructured":"Chen J, Liu J (2020) Research on a novel influence maximization algorithm based on community structure. J Phys: Conf Ser 1631(1):012064. https:\/\/doi.org\/10.1088\/1742-6596\/1631\/1\/012064","journal-title":"J Phys: Conf Ser"},{"issue":"3","key":"1454_CR10","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0229201","volume":"15","author":"Y Chen","year":"2020","unstructured":"Chen Y, Wang W, Feng J, Lu Y, Gong X (2020) Maximizing multiple influences and fair seed allocation on multilayer social networks. PLoS ONE 15(3):e0229201. https:\/\/doi.org\/10.1371\/journal.pone.0229201","journal-title":"PLoS ONE"},{"key":"1454_CR11","doi-asserted-by":"publisher","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng H (2013) StaticGreedy: solving the scalability-accuracy dilemma in influence maximization, In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management (Association for Computing Machinery, New York, NY, USA), CIKM \u201913, pp. 509\u2013518https:\/\/doi.org\/10.1145\/2505515.2505541","DOI":"10.1145\/2505515.2505541"},{"key":"1454_CR12","doi-asserted-by":"publisher","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks, In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Association for Computing Machinery, New York, NY, USA, 2009), KDD \u201909, p. 199-208https:\/\/doi.org\/10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"key":"1454_CR13","doi-asserted-by":"publisher","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable Influence Maximization in Social Networks under the Linear Threshold Model. In: 2010 IEEE International Conference on Data Mining, pp. 88\u20139https:\/\/doi.org\/10.1109\/ICDM.2010.118","DOI":"10.1109\/ICDM.2010.118"},{"issue":"4","key":"1454_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.2307\/2785979","volume":"20","author":"J Coleman","year":"1957","unstructured":"Coleman J, Katz E, Menzel H (1957) The diffusion of an innovation among physicians. Sociometry 20(4):253\u2013270","journal-title":"Sociometry"},{"key":"1454_CR15","unstructured":"Conover WJ (1999) Practical Nonparametric Statistics (Wiley, Hoboken, NJ, USA, 1999). https:\/\/www.wiley.com\/en-us\/Practical+Nonparametric+Statistics%2C+3rd+Edition-p-9780471160687"},{"issue":"3","key":"1454_CR16","doi-asserted-by":"publisher","first-page":"637","DOI":"10.26599\/BDMA.2024.9020010","volume":"7","author":"M Czuba","year":"2024","unstructured":"Czuba M, Nurek M, Serwata D, Qi YX, Jia M, Musial K, Michalski R, Br\u00f3dka P (2024) Network diffusion framework to simulate spreading processes in complex networks. Big Data Mining Anal 7(3):637\u2013654. https:\/\/doi.org\/10.26599\/BDMA.2024.9020010","journal-title":"Big Data Mining Anal"},{"key":"1454_CR17","doi-asserted-by":"publisher","unstructured":"Czuba M, Br\u00f3dka P (2022) Simulating Spreading of Multiple Interacting Processes in Complex Networks, In: 2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA) (IEEE, Shenzhen, China, 2022), pp. 1\u201310https:\/\/doi.org\/10.1109\/DSAA54385.2022.10032425","DOI":"10.1109\/DSAA54385.2022.10032425"},{"key":"1454_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.5.011027","volume":"5","author":"M De Domenico","year":"2015","unstructured":"De Domenico M, Lancichinetti A, Arenas A, Rosvall M (2015) Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems. Phys Rev X 5:011027. https:\/\/doi.org\/10.1103\/PhysRevX.5.011027","journal-title":"Phys Rev X"},{"key":"1454_CR19","doi-asserted-by":"publisher","unstructured":"Dice LR (1945) Measures of the amount of ecologic association. Between Spec. https:\/\/doi.org\/10.2307\/1932409","DOI":"10.2307\/1932409"},{"key":"1454_CR20","doi-asserted-by":"publisher","unstructured":"Dickison ME, Magnani M, Rossi L (2016) Multilayer social networks (Cambridge University Press, Cambridge, England, UK, 2016)https:\/\/doi.org\/10.1017\/CBO9781139941907","DOI":"10.1017\/CBO9781139941907"},{"issue":"1","key":"1454_CR21","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, R\u00e9nyi A et al (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(1):17\u201360","journal-title":"Publ Math Inst Hung Acad Sci"},{"issue":"5","key":"1454_CR22","doi-asserted-by":"publisher","first-page":"164","DOI":"10.3390\/e18050164","volume":"18","author":"F Erlandsson","year":"2016","unstructured":"Erlandsson F, Br\u00f3dka P, Borg A, Johnson H (2016) Finding influential users in social media using association rule learning. Entropy 18(5):164. https:\/\/doi.org\/10.3390\/e18050164","journal-title":"Entropy"},{"key":"1454_CR23","doi-asserted-by":"publisher","unstructured":"Erlandsson F, Br\u00f3dka P, Borg A (2018) Seed Selection for Information Cascade in Multilayer Networks. In: Complex Networks & Their Applications VI: Proceedings of Complex Networks 2017 (The Sixth International Conference on Complex Networks and Their Applications) (Springer, 2018), pp. 426\u2013436https:\/\/doi.org\/10.1007\/978-3-319-72150-7_35","DOI":"10.1007\/978-3-319-72150-7_35"},{"issue":"3","key":"1454_CR24","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TCSS.2018.2852742","volume":"5","author":"D Goldenberg","year":"2018","unstructured":"Goldenberg D, Sela A, Shmueli E (2018) Timing matters: Influence maximization in social networks through scheduled seeding. IEEE Trans Comput Soc Syst 5(3):621\u2013638. https:\/\/doi.org\/10.1109\/TCSS.2018.2852742","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"6","key":"1454_CR25","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420\u20131443","journal-title":"Am J Sociol"},{"key":"1454_CR26","doi-asserted-by":"crossref","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring Network Structure, Dynamics, and Function using NetworkX, In: Proceedings of the 7th Python in Science Conference, ed. by G.\u00a0Varoquaux, T.\u00a0Vaught, J.\u00a0Millman (Pasadena, CA USA, 2008), pp. 11 \u2013 15. https:\/\/aric.hagberg.org\/papers\/hagberg-2008-exploring.pdf","DOI":"10.25080\/TCWV9851"},{"key":"1454_CR27","doi-asserted-by":"publisher","unstructured":"Hajarathaiah K, Enduri MK, Dhuli S, Anamalamudi S, Cenkeramaddi LR (2023) Generalization of relative change in a centrality measure to identify vital nodes in complex networks. IEEE Access 11: 808\u2013824 https:\/\/doi.org\/10.1109\/ACCESS.2022.3232288","DOI":"10.1109\/ACCESS.2022.3232288"},{"key":"1454_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.124919","volume":"370","author":"BA Hassan","year":"2020","unstructured":"Hassan BA, Rashid TA (2020) Operational framework for recent advances in backtracking search optimisation algorithm: A systematic review and performance evaluation. Appl Math Comput 370:124919. https:\/\/doi.org\/10.1016\/j.amc.2019.124919","journal-title":"Appl Math Comput"},{"issue":"12","key":"1454_CR29","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0162066","volume":"10","author":"JL He","year":"2015","unstructured":"He JL, Fu Y, Chen DB (2015) A novel top-k strategy for influence maximization in complex networks with community structure. PLoS ONE 10(12):e0145283. https:\/\/doi.org\/10.1371\/journal.pone.0162066","journal-title":"PLoS ONE"},{"key":"1454_CR30","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.asoc.2018.02.016","volume":"66","author":"Q He","year":"2018","unstructured":"He Q, Wang X, Huang M, Lv J, Ma L (2018) Heuristics-based influence maximization for opinion formation in social networks. Appl Soft Comput 66:360\u2013369. https:\/\/doi.org\/10.1016\/j.asoc.2018.02.016","journal-title":"Appl Soft Comput"},{"key":"1454_CR31","doi-asserted-by":"publisher","unstructured":"He X, Kempe D (2016) Robust Influence Maximization, In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Association for Computing Machinery, New York, NY, USA, 2016), KDD \u201916, p. 885-894https:\/\/doi.org\/10.1145\/2939672.2939760","DOI":"10.1145\/2939672.2939760"},{"key":"1454_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpa.2021.100107","author":"G Iacca","year":"2021","unstructured":"Iacca G, Konotopska K, Bucur D, Tonda A (2021) An evolutionary framework for maximizing influence propagation in social networks. Softw Impacts. https:\/\/doi.org\/10.1016\/j.simpa.2021.100107","journal-title":"Softw Impacts"},{"key":"1454_CR33","doi-asserted-by":"publisher","first-page":"126480","DOI":"10.1016\/j.physa.2021.126480","volume":"586","author":"J Jabari Lotf","year":"2022","unstructured":"Jabari Lotf J, Abdollahi Azgomi M, Ebrahimi Dishabi MR (2022) An improved influence maximization method for social networks based on genetic algorithm. Physica A: Statist Mech Appl 586:126480. https:\/\/doi.org\/10.1016\/j.physa.2021.126480","journal-title":"Physica A: Statist Mech Appl"},{"issue":"891","key":"1454_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-017-00937-8","volume":"7","author":"J Jankowski","year":"2017","unstructured":"Jankowski J, Br\u00f3dka P, Kazienko P, Szymanski BK, Michalski R, Kajdanowicz T (2017) Balancing speed and coverage by sequential seeding in complex networks. Sci Rep 7(891):1\u201311. https:\/\/doi.org\/10.1038\/s41598-017-00937-8","journal-title":"Sci Rep"},{"issue":"1","key":"1454_CR35","doi-asserted-by":"publisher","DOI":"10.1038\/sdata.2017.144","volume":"4","author":"J Jankowski","year":"2017","unstructured":"Jankowski J, Michalski R, Br\u00f3dka P (2017) A multilayer network dataset of interaction and influence spreading in a virtual world. Sci Data 4(1):170144. https:\/\/doi.org\/10.1038\/sdata.2017.144","journal-title":"Sci Data"},{"issue":"1","key":"1454_CR36","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343. https:\/\/doi.org\/10.1007\/BF02289026","journal-title":"Psychometrika"},{"key":"1454_CR37","doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the Spread of Influence Through a Social Network. In: 9th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 137\u2013146. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"1454_CR38","doi-asserted-by":"publisher","unstructured":"Kim J, Kim SK, Yu H (2013) Scalable and parallelizable processing of influence maximization for large-scale social networks?. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 266\u2013277https:\/\/doi.org\/10.1109\/ICDE.2013.6544831","DOI":"10.1109\/ICDE.2013.6544831"},{"key":"1454_CR39","doi-asserted-by":"publisher","unstructured":"Kimura M, Saito K (2006) Tractable Models for Information Diffusion in Social Networks. In: Knowledge Discovery in Databases: PKDD 2006, ed. by J.\u00a0F\u00fcrnkranz, T.\u00a0Scheffer, M.\u00a0Spiliopoulou (Springer Berlin Heidelberg, Berlin, Heidelberg, 2006), pp. 259\u201327https:\/\/doi.org\/10.1007\/11871637_27","DOI":"10.1007\/11871637_27"},{"key":"1454_CR40","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6:888\u2013893. https:\/\/doi.org\/10.1038\/nphys1746","journal-title":"Nat Phys"},{"issue":"3","key":"1454_CR41","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1093\/comnet\/cnu016","volume":"2","author":"M Kivel\u00e4","year":"2014","unstructured":"Kivel\u00e4 M, Arenas A, Barthelemy M, Gleeson JP, Moreno Y, Porter MA (2014) Multilayer networks. J Complex Netw 2(3):203\u2013271. https:\/\/doi.org\/10.1093\/comnet\/cnu016","journal-title":"J Complex Netw"},{"key":"1454_CR42","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.neucom.2023.01.078","volume":"530","author":"J Kou","year":"2023","unstructured":"Kou J, Jia P, Liu J, Dai J, Luo H (2023) Identify influential nodes in social networks with graph multi-head attention regression model. Neurocomputing 530:23\u201336. https:\/\/doi.org\/10.1016\/j.neucom.2023.01.078","journal-title":"Neurocomputing"},{"issue":"2","key":"1454_CR43","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TCSS.2018.2813262","volume":"5","author":"A Kuhnle","year":"2018","unstructured":"Kuhnle A, Alim MA, Li X, Zhang H, Thai MT (2018) Multiplex influence maximization in online social networks with heterogeneous diffusion models. IEEE Trans Comput Soc Syst 5(2):418\u2013429. https:\/\/doi.org\/10.1109\/TCSS.2018.2813262","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"11","key":"1454_CR44","doi-asserted-by":"publisher","first-page":"7647","DOI":"10.1007\/s10489-021-02266-w","volume":"51","author":"S Kumar","year":"2021","unstructured":"Kumar S, Singhla L, Jindal K, Grover K, Panda BS (2021) IM-ELPR: Influence maximization in social networks using label propagation based community structure. Appl Intell 51(11):7647\u20137665. https:\/\/doi.org\/10.1007\/s10489-021-02266-w","journal-title":"Appl Intell"},{"key":"1454_CR45","doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Association for Computing Machinery, New York, NY, USA, 2007), KDD \u201907, p. 420-429https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"key":"1454_CR46","doi-asserted-by":"publisher","unstructured":"Ling C, Jiang J, Wang J, Thai MT, Xue L, Song J, Qiu M, Zhao L (2023) Deep graph representation learning and optimization for influence maximization. In: Proceedings of the 40th International Conference on Machine Learning (JMLR.org, 2023), ICML\u201923https:\/\/doi.org\/10.5555\/3618408.3619288","DOI":"10.5555\/3618408.3619288"},{"key":"1454_CR47","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2023.0625","author":"Y Liu","year":"2024","unstructured":"Liu Y, Wang X, Wang X, Yan L, Zhao S, Wang Z (2024) Individual-centralized seeding strategy for influence maximization in information-limited networks. J R Soc Interface. https:\/\/doi.org\/10.1098\/rsif.2023.0625","journal-title":"J. R. Soc. Interface"},{"issue":"4","key":"1454_CR48","doi-asserted-by":"publisher","first-page":"3111","DOI":"10.1109\/TNET.2024.3382546","volume":"32","author":"Y Liu","year":"2024","unstructured":"Liu Y, Wang X, Wang X, Wang Z (2024) Fast outbreak sense and effective source inference via minimum observer set. IEEE\/ACM Trans Netw 32(4):3111\u20133125. https:\/\/doi.org\/10.1109\/TNET.2024.3382546","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1454_CR49","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1109\/TIFS.2023.3338423","volume":"19","author":"Y Liu","year":"2024","unstructured":"Liu Y, Liang G, Wang X, Zhu P, Wang Z (2024) Diffusion containment in complex networks through collective influence of connections. IEEE Trans Inf Forensics Secur 19:1510\u20131524. https:\/\/doi.org\/10.1109\/TIFS.2023.3338423","journal-title":"IEEE Trans Inf Forensics Secur"},{"issue":"4","key":"1454_CR50","doi-asserted-by":"publisher","first-page":"3838","DOI":"10.1109\/TNSE.2024.3388994","volume":"11","author":"Y Liu","year":"2024","unstructured":"Liu Y, Zhong Y, Li X, Zhu P, Wang Z (2024) Vital nodes identification via evolutionary algorithm with percolation optimization in complex networks. IEEE Trans Netw Sci Eng 11(4):3838\u20133850. https:\/\/doi.org\/10.1109\/TNSE.2024.3388994","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"1","key":"1454_CR51","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1109\/TNNLS.2023.3321767","volume":"36","author":"Y Liu","year":"2025","unstructured":"Liu Y, Wang X, Wang X, Wang Z, Kurths J (2025) Diffusion source inference for large-scale complex networks based on network percolation. IEEE Trans Neural Netw Learning Syst 36(1):1453\u20131466. https:\/\/doi.org\/10.1109\/TNNLS.2023.3321767","journal-title":"IEEE Trans Neural Netw Learning Syst"},{"key":"1454_CR52","doi-asserted-by":"publisher","unstructured":"Li H, Xu M, Bhowmick SS, Sun C, Jiang Z, Cui J (2019) Disco: Influence maximization meets network embedding and deep learning https:\/\/doi.org\/10.48550\/arXiv.1906.07378","DOI":"10.48550\/arXiv.1906.07378"},{"key":"1454_CR53","doi-asserted-by":"publisher","unstructured":"Lu Q, Bu Z, Wang Y (2020) A Multiobjective Evolutionary Approach for Influence Maximization in Multilayer Networks, In: Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence (Association for Computing Machinery, New York, NY, USA, 2020), ICCAI \u201920, p. 431-438https:\/\/doi.org\/10.1145\/3404555.3404568","DOI":"10.1145\/3404555.3404568"},{"key":"1454_CR54","doi-asserted-by":"publisher","unstructured":"Lu W, Lakshmanan LV (2012) Profit Maximization over Social Networks, In: 2012 IEEE 12th International Conference on Data Mining, pp. 479\u2013488https:\/\/doi.org\/10.1109\/ICDM.2012.145","DOI":"10.1109\/ICDM.2012.145"},{"key":"1454_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v098.i08","volume":"98","author":"M Magnani","year":"2021","unstructured":"Magnani M, Rossi L, Vega D (2021) Analysis of multiplex social networks with r. J Stat Softw 98:1\u201330","journal-title":"J Stat Softw"},{"key":"1454_CR56","doi-asserted-by":"publisher","unstructured":"Magnani M, Rossi L (2011) The ML-Model for Multi-layer Social Networks, In: 2011 International Conference on Advances in Social Networks Analysis and Mining (2011), pp. 5\u201312https:\/\/doi.org\/10.1109\/ASONAM.2011.114","DOI":"10.1109\/ASONAM.2011.114"},{"issue":"3","key":"1454_CR57","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s00354-014-0402-9","volume":"32","author":"R Michalski","year":"2014","unstructured":"Michalski R, Kajdanowicz T, Br\u00f3dka P, Kazienko P (2014) Seed selection for spread of influence in social networks: Temporal vs. static approach. N Gener Comput 32(3):213\u2013235. https:\/\/doi.org\/10.1007\/s00354-014-0402-9","journal-title":"N Gener Comput"},{"key":"1454_CR58","doi-asserted-by":"publisher","unstructured":"Michalski R, Kazienko P, Jankowski J (2013) Convince a dozen more and succeed\u2013the influence in multi-layered social networks, In: 2013 International Conference on Signal-Image Technology & Internet-Based Systems (IEEE, 2013), pp. 499\u2013505https:\/\/doi.org\/10.1109\/SITIS.2013.85","DOI":"10.1109\/SITIS.2013.85"},{"issue":"1","key":"1454_CR59","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam R, Narahari Y (2011) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130\u2013147. https:\/\/doi.org\/10.1109\/TASE.2010.2052042","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1454_CR61","doi-asserted-by":"publisher","DOI":"10.1007\/s42524-022-0190-8","author":"Y Ou","year":"2022","unstructured":"Ou Y, Guo Q, Liu J (2022) Identifying spreading influence nodes for social networks. Front Eng Manag. https:\/\/doi.org\/10.1007\/s42524-022-0190-8","journal-title":"Front Eng Manag"},{"key":"1454_CR62","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab . http:\/\/ilpubs.stanford.edu:8090\/422\/. Previous number = SIDL-WP-1999-0120"},{"key":"1454_CR63","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2023.109916","volume":"234","author":"KV Rao","year":"2023","unstructured":"Rao KV, Chowdary CR (2023) K++ Shell: Influence maximization in multilayer networks using community detection. Comput Netw 234:109916. https:\/\/doi.org\/10.1016\/j.comnet.2023.109916","journal-title":"Comput Netw"},{"issue":"5","key":"1454_CR64","doi-asserted-by":"publisher","first-page":"5173","DOI":"10.1007\/s10489-021-02656-0","volume":"52","author":"KV Rao","year":"2022","unstructured":"Rao KV, Katukuri M, Jagarapu M (2022) CIM: clique-based heuristic for finding influential nodes in multilayer networks. Appl Intell 52(5):5173\u20135184. https:\/\/doi.org\/10.1007\/s10489-021-02656-0","journal-title":"Appl Intell"},{"key":"1454_CR65","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.chaos.2014.12.022","volume":"72","author":"L Rossi","year":"2015","unstructured":"Rossi L, Magnani M (2015) Towards effective visual analytics on multiplex and multilayer networks. Chaos, Solitons & Fractals 72:68\u201376. https:\/\/doi.org\/10.1016\/j.chaos.2014.12.022. (Multiplex Networks: Structure, Dynamics and Applications)","journal-title":"Chaos, Solitons & Fractals"},{"key":"1454_CR66","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-031-35445-8_10","volume":"25","author":"A Sadaf","year":"2023","unstructured":"Sadaf A, Mathieson L, Br\u00f3dka P, Musial K (2023) Maximising influence spread in complex networks by utilising community-based driver nodes as seeds. Inf Manag Big Data 25:126\u2013141. https:\/\/doi.org\/10.1007\/978-3-031-35445-8_10","journal-title":"Inf Manag Big Data"},{"issue":"2","key":"1454_CR67","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/TNSE.2015.2425961","volume":"2","author":"M Salehi","year":"2015","unstructured":"Salehi M, Sharma R, Marzolla M, Magnani M, Siyari P, Montesi D (2015) Spreading processes in multilayer networks. IEEE Trans Netw Sci Eng 2(2):65\u201383. https:\/\/doi.org\/10.1109\/TNSE.2015.2425961","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"1454_CR68","doi-asserted-by":"publisher","unstructured":"Seeman L, Singer Y (2013) Adaptive Seeding in Social Networks, In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 459\u2013468https:\/\/doi.org\/10.1109\/FOCS.2013.56","DOI":"10.1109\/FOCS.2013.56"},{"key":"1454_CR69","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.eswa.2018.04.016","volume":"107","author":"A Sela","year":"2018","unstructured":"Sela A, Goldenberg D, Ben-Gal I, Shmueli E (2018) Active viral marketing: incorporating continuous active seeding efforts into the diffusion model. Expert Syst Appl 107:45\u201360. https:\/\/doi.org\/10.1016\/j.eswa.2018.04.016","journal-title":"Expert Syst Appl"},{"key":"1454_CR70","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.physa.2015.04.035","volume":"436","author":"A Sheikhahmadi","year":"2015","unstructured":"Sheikhahmadi A, Nematbakhsh MA (2015) Shokrollahi A (2015) Improving detection of influential nodes in complex networks. Physica A: Stat Mech Appl 436:833\u2013845. https:\/\/doi.org\/10.1016\/j.physa.2015.04.035","journal-title":"Physica A: Stat Mech Appl"},{"key":"1454_CR71","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105554","author":"SS Singh","year":"2019","unstructured":"Singh SS, Kumar A, Singh K, Biswas B (2019) Lapso-im: a learning-based influence maximization approach for social networks. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2019.105554","journal-title":"Appl Soft Comput"},{"issue":"9","key":"1454_CR72","doi-asserted-by":"publisher","first-page":"7570","DOI":"10.1016\/j.jksuci.2021.08.009","volume":"34","author":"SS Singh","year":"2022","unstructured":"Singh SS, Srivastva D, Verma M, Singh J (2022) Influence maximization frameworks, performance, challenges and directions on social network: a theoretical study. J King Saud Univ-Comput Inf Sci 34(9):7570\u20137603. https:\/\/doi.org\/10.1016\/j.jksuci.2021.08.009","journal-title":"J King Saud Univ-Comput Inf Sci"},{"issue":"1","key":"1454_CR73","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1111\/j.1467-9531.2006.00176.x","volume":"36","author":"TAB Snijders","year":"2006","unstructured":"Snijders TAB, Pattison PE, Robins GL, Handcock MS (2006) New specifications for exponential random graph models. Sociol Methodol 36(1):99\u2013153. https:\/\/doi.org\/10.1111\/j.1467-9531.2006.00176.x","journal-title":"Sociol Methodol"},{"key":"1454_CR74","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108130","volume":"120","author":"PG Sun","year":"2021","unstructured":"Sun PG, Miao Q, Staab S (2021) Community-based k-shell decomposition for identifying influential spreaders. Pattern Recogn 120:108130. https:\/\/doi.org\/10.1016\/j.patcog.2021.108130","journal-title":"Pattern Recogn"},{"key":"1454_CR75","doi-asserted-by":"publisher","unstructured":"Sun G, Chen CC (2021) Influence Maximization Algorithm Based on Reverse Reachable Set. Mathematical Problems in Engineering 2021 https:\/\/doi.org\/10.1155\/2021\/5535843","DOI":"10.1155\/2021\/5535843"},{"issue":"1","key":"1454_CR76","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko M (2004) A note on maximizing a submodular set function subject to a knapsack constraint. Oper Res Lett 32(1):41\u201343. https:\/\/doi.org\/10.1016\/S0167-6377(03)00062-2","journal-title":"Oper Res Lett"},{"key":"1454_CR77","doi-asserted-by":"publisher","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp. 1539\u20131554https:\/\/doi.org\/10.1145\/2723372.2723734","DOI":"10.1145\/2723372.2723734"},{"key":"1454_CR78","doi-asserted-by":"publisher","unstructured":"Tang J, Tang X, Yuan J (2018) Towards Profit Maximization for Online Social Network Providers, In: IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, pp. 1178\u20131186https:\/\/doi.org\/10.1109\/INFOCOM.2018.8485975","DOI":"10.1109\/INFOCOM.2018.8485975"},{"key":"1454_CR79","doi-asserted-by":"publisher","unstructured":"Tiukhova E, Penaloza E, \u00d3skarsd\u00f3ttir M, Garcia H, Bahnsen AC, Baesens B, Snoeck M, Bravo C (2022) Influencer detection with dynamic graph neural networks https:\/\/doi.org\/10.48550\/arXiv.2307.08131","DOI":"10.48550\/arXiv.2307.08131"},{"key":"1454_CR60","unstructured":"U.D. of\u00a0Health & Human\u00a0Services. HPV Infection (2024). https:\/\/www.cdc.gov\/hpv\/parents\/about-hpv.html. [Online; accessed 18. May 2024]"},{"key":"1454_CR80","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.ins.2022.07.103","volume":"609","author":"K Venkatakrishna Rao","year":"2022","unstructured":"Venkatakrishna Rao K, Chowdary CR (2022) Cbim: Community-based influence maximization in multilayer networks. Inf Sci 609:578\u2013594. https:\/\/doi.org\/10.1016\/j.ins.2022.07.103","journal-title":"Inf Sci"},{"key":"1454_CR81","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108697","volume":"246","author":"S Wang","year":"2022","unstructured":"Wang S, Tan X (2022) Determining seeds with robust influential ability from multi-layer networks: a multi-factorial evolutionary approach. Knowl-Based Syst 246:108697. https:\/\/doi.org\/10.1016\/j.knosys.2022.108697","journal-title":"Knowl-Based Syst"},{"key":"1454_CR82","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108750","volume":"121","author":"S Wang","year":"2022","unstructured":"Wang S, Tan X (2022) Solving the robust influence maximization problem on multi-layer networks via a memetic algorithm. Appl Soft Comput 121:108750. https:\/\/doi.org\/10.1016\/j.asoc.2022.108750","journal-title":"Appl Soft Comput"},{"key":"1454_CR83","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.physa.2016.05.020","volume":"461","author":"X Wang","year":"2016","unstructured":"Wang X, Su Y, Zhao C, Yi D (2016) Effective identification of multiple influential spreaders by degreepunishment. Physica A 461:238\u2013247. https:\/\/doi.org\/10.1016\/j.physa.2016.05.020","journal-title":"Physica A"},{"key":"1454_CR84","doi-asserted-by":"publisher","unstructured":"Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-K influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Association for Computing Machinery, New York, NY, USA, 2010), KDD \u201910, p. 1039-1048https:\/\/doi.org\/10.1145\/1835804.1835935","DOI":"10.1145\/1835804.1835935"},{"issue":"2","key":"1454_CR85","doi-asserted-by":"publisher","first-page":"231","DOI":"10.3390\/e25020231","volume":"25","author":"P W\u0105troba","year":"2023","unstructured":"W\u0105troba P, Br\u00f3dka P (2023) Influence of information blocking on the spread of virus in multilayer networks. Entropy 25(2):231. https:\/\/doi.org\/10.3390\/e25020231","journal-title":"Entropy"},{"key":"1454_CR86","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107497","volume":"233","author":"X Xie","year":"2021","unstructured":"Xie X, Li J, Sheng Y, Wang W, Yang W (2021) Competitive influence maximization considering inactive nodes and community homophily. Knowl-Based Syst 233:107497. https:\/\/doi.org\/10.1016\/j.knosys.2021.107497","journal-title":"Knowl-Based Syst"},{"issue":"20","key":"1454_CR87","doi-asserted-by":"publisher","first-page":"22475","DOI":"10.1609\/aaai.v38i20.30255","volume":"38","author":"Z Yuan","year":"2024","unstructured":"Yuan Z, Shao M, Chen Z (2024) Graph bayesian optimization for multiplex influence maximization. AAAI 38(20):22475\u201322483. https:\/\/doi.org\/10.1609\/aaai.v38i20.30255","journal-title":"AAAI"},{"issue":"1","key":"1454_CR88","doi-asserted-by":"publisher","first-page":"27823","DOI":"10.1038\/srep27823","volume":"6","author":"JX Zhang","year":"2016","unstructured":"Zhang JX, Chen DB, Dong Q, Zhao ZD (2016) Identifying a set of influential spreaders in complex networks. Sci Rep 6(1):27823. https:\/\/doi.org\/10.1038\/srep27823","journal-title":"Sci Rep"},{"issue":"1","key":"1454_CR89","doi-asserted-by":"publisher","DOI":"10.1088\/0031-8949\/89\/01\/015203","volume":"89","author":"D Zhao","year":"2013","unstructured":"Zhao D, Li L, Li S, Huo Y, Yang Y (2013) Identifying influential spreaders in interconnected networks. Phys Scr 89(1):015203. https:\/\/doi.org\/10.1088\/0031-8949\/89\/01\/015203","journal-title":"Phys Scr"},{"issue":"3","key":"1454_CR90","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1109\/TCNS.2021.3088782","volume":"9","author":"YD Zhong","year":"2022","unstructured":"Zhong YD, Srivastava V, Leonard NE (2022) Influence spread in the heterogeneous multiplex linear threshold model. IEEE Trans Control Netw Syst 9(3):1080\u20131091. https:\/\/doi.org\/10.1109\/TCNS.2021.3088782","journal-title":"IEEE Trans Control Netw Syst"},{"issue":"10","key":"1454_CR91","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou C, Zhang P, Zang W, Guo L (2015) On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans Knowl Data Eng 27(10):2770\u20132783. https:\/\/doi.org\/10.1109\/TKDE.2015.2419659","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1454_CR92","doi-asserted-by":"publisher","unstructured":"Zio\u0142o M, Br\u00f3dka P, Spoz A, Jankowski J (2022) Modeling the impact of external influence on green behaviour spreading in multilayer financial networks. 2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA) pp. 1\u201310 https:\/\/doi.org\/10.1109\/DSAA54385.2022.10032397","DOI":"10.1109\/DSAA54385.2022.10032397"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01454-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-025-01454-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01454-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:25:33Z","timestamp":1765959933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-025-01454-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,30]]},"references-count":92,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1454"],"URL":"https:\/\/doi.org\/10.1007\/s13278-025-01454-7","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,30]]},"assertion":[{"value":"4 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"46"}}