{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:14:32Z","timestamp":1781194472665,"version":"3.54.1"},"reference-count":85,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Australian Research Council, Dynamics and Control of Complex Social Networks","award":["DP190101087"],"award-info":[{"award-number":["DP190101087"]}]},{"DOI":"10.13039\/501100004281","name":"Polish National Science Centre","doi-asserted-by":"crossref","award":["2016\/21\/D\/ST6\/02408"],"award-info":[{"award-number":["2016\/21\/D\/ST6\/02408"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Understanding how influence is seeded and spreads through social networks is an increasingly important study area. While there are many methods to identify seed nodes that are used to initialize a spread of influence, the idea of using methods for selecting driver nodes from the control field in the context of seed selection has not been explored yet. In this work, we present the first study of using control approaches as seed selection methods. We employ a Minimum Dominating Set to develop a candidate set of driver nodes. We propose methods based upon driver nodes (i.e. Driver-Random, Driver-Degree, Driver-Closeness, Driver-Betweenness, Driver-Degree-Closeness-Betweenness, Driver-Kempe, Driver-Ranked) for selecting seeds from this set. These methods make use of centrality measures to rank the driver nodes in terms of their potential as seed nodes. We compare proposed methods to existing approaches using the Linear Threshold model on both real and synthetic networks. Our experiment results show that the proposed methods consistently outperform the benchmarks. We conclude that using driver nodes as seeds in the influence spread results in faster and thus more effective spread than when applying traditional methods.<\/jats:p>","DOI":"10.1007\/s41109-024-00647-x","type":"journal-article","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T11:02:49Z","timestamp":1721127769000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A bridge between influence models and control methods"],"prefix":"10.1007","volume":"9","author":[{"given":"Abida","family":"Sadaf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luke","family":"Mathieson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piotr","family":"Br\u00f3dka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katarzyna","family":"Musial","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"issue":"1","key":"647_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47","journal-title":"Rev Mod Phys"},{"issue":"9","key":"647_CR2","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2020) A survey on influence maximization in a social network. Knowl Inf Syst 62(9):3417\u20133455","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"647_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1287\/mnsc.15.5.215","volume":"15","author":"FM Bass","year":"1969","unstructured":"Bass FM (1969) A new product growth for model consumer durables. Manag Sci 15(5):215\u2013227","journal-title":"Manag Sci"},{"key":"647_CR4","doi-asserted-by":"publisher","first-page":"10316","DOI":"10.1109\/ACCESS.2020.2965547","volume":"8","author":"P Br\u00f3dka","year":"2020","unstructured":"Br\u00f3dka P, Musial K, Jankowski J (2020) Interacting spreading processes in multilayer networks: a systematic review. IEEE Access 8:10316\u201310341","journal-title":"IEEE Access"},{"issue":"7291","key":"647_CR5","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1038\/nature08932","volume":"464","author":"SV Buldyrev","year":"2010","unstructured":"Buldyrev SV, Parshani R, Paul G, Stanley HE, Havlin S (2010) Catastrophic cascade of failures in interdependent networks. Nature 464(7291):1025\u20131028","journal-title":"Nature"},{"issue":"1","key":"647_CR6","volume":"1","author":"G Chen","year":"2022","unstructured":"Chen G (2022) Controllability robustness of complex networks. J Autom Intell 1(1):100004","journal-title":"J Autom Intell"},{"issue":"4","key":"647_CR7","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","volume":"391","author":"D Chen","year":"2012","unstructured":"Chen D, L\u00fc L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Phys A 391(4):1777\u20131787","journal-title":"Phys A"},{"issue":"10","key":"647_CR8","doi-asserted-by":"publisher","first-page":"77455","DOI":"10.1371\/journal.pone.0077455","volume":"8","author":"D-B Chen","year":"2013","unstructured":"Chen D-B, Gao H, L\u00fc L, Zhou T (2013) Identifying influential nodes in large-scale directed networks: the role of clustering. PLoS One 8(10):77455","journal-title":"PLoS One"},{"key":"647_CR9","doi-asserted-by":"publisher","first-page":"6121","DOI":"10.1038\/srep06121","volume":"4","author":"Y-Z Chen","year":"2014","unstructured":"Chen Y-Z, Huang Z-G, Lai Y-C (2014) Controlling extreme events on complex networks. Sci Rep 4:6121","journal-title":"Sci Rep"},{"key":"647_CR10","unstructured":"D\u2019Angelo G, Severini L, Velaj Y (2016) Influence maximization in the independent cascade model. In: ICTCS, pp 269\u2013274"},{"key":"647_CR11","volume-title":"Introduction to dynamic systems: theory, models and applications","author":"GL David","year":"1979","unstructured":"David GL (1979) Introduction to dynamic systems: theory, models and applications. Wiley, Chichester"},{"key":"647_CR12","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1038\/srep01626","volume":"3","author":"D Delpini","year":"2013","unstructured":"Delpini D, Battiston S, Riccaboni M, Gabbi G, Pammolli F, Caldarelli G (2013) Evolution of controllability in interbank networks. Sci Rep 3:1626","journal-title":"Sci Rep"},{"issue":"1","key":"647_CR13","first-page":"23","volume":"33","author":"G DuanW","year":"2009","unstructured":"DuanW G (2009) Whinstonab. Inform Cascades Softw Adop Internet 33(1):23","journal-title":"Inform Cascades Softw Adop Internet"},{"issue":"5","key":"647_CR14","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","journal-title":"Entropy"},{"key":"647_CR15","doi-asserted-by":"crossref","unstructured":"Erlandsson F, Br\u00f3dka P, Borg A (2017) Seed selection for information cascade in multilayer networks. In: International conference on complex networks and their applications, Springer pp 426\u2013436","DOI":"10.1007\/978-3-319-72150-7_35"},{"issue":"1","key":"647_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ecolmodel.2007.04.029","volume":"208","author":"BD Fath","year":"2007","unstructured":"Fath BD, Scharler UM, Ulanowicz RE, Hannon B (2007) Ecological network analysis: network construction. Ecol Model 208(1):49\u201355","journal-title":"Ecol Model"},{"key":"647_CR17","doi-asserted-by":"publisher","first-page":"24456","DOI":"10.1038\/srep24456","volume":"6","author":"AJ Gates","year":"2016","unstructured":"Gates AJ, Rocha LM (2016) Control of complex networks requires both structure and dynamics. Sci Rep 6:24456","journal-title":"Sci Rep"},{"key":"647_CR18","doi-asserted-by":"crossref","unstructured":"Guo W-F, Zhang S-W, Zeng T, Li Y, Gao J, Chen L (2018) A novel structure-based control method for analyzing nonlinear dynamics in biological networks. bioRxiv, 503565","DOI":"10.1101\/503565"},{"issue":"4","key":"647_CR19","doi-asserted-by":"publisher","DOI":"10.1063\/1.4947420","volume":"26","author":"Q Guo","year":"2016","unstructured":"Guo Q, Lei Y, Jiang X, Ma Y, Huo G, Zheng Z (2016) Epidemic spreading with activity-driven awareness diffusion on multiplex network. Chaos Interdiscip J Nonlinear Sci 26(4):043110","journal-title":"Chaos Interdiscip J Nonlinear Sci"},{"key":"647_CR20","doi-asserted-by":"crossref","unstructured":"Guo G, Zhang J, Thalmann D, Yorke-Smith N (2014) Etaf: An extended trust antecedents framework for trust prediction. In: 2014 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM 2014), pp 540\u2013547. IEEE","DOI":"10.1109\/ASONAM.2014.6921639"},{"key":"647_CR21","doi-asserted-by":"crossref","unstructured":"Harary F (1972) Recent results on generalized ramsey theory for graphs. In: Graph theory and applications, Springer p 125","DOI":"10.1007\/BFb0067364"},{"issue":"1","key":"647_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjds5","volume":"1","author":"T Hogg","year":"2012","unstructured":"Hogg T, Lerman K (2012) Social dynamics of Digg. EPJ Data Sci 1(1):1\u201326","journal-title":"EPJ Data Sci"},{"key":"647_CR23","doi-asserted-by":"crossref","unstructured":"Holley RA, Liggett TM (1975) Ergodic theorems for weakly interacting infinite systems and the voter model. Ann Prob pp 643\u2013663","DOI":"10.1214\/aop\/1176996306"},{"key":"647_CR24","unstructured":"Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat pp 65\u201370"},{"issue":"4","key":"647_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft JE, Karp RM (1973) An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J Comput 2(4):225\u2013231","journal-title":"SIAM J Comput"},{"issue":"10","key":"647_CR26","doi-asserted-by":"publisher","first-page":"0205130","DOI":"10.1371\/journal.pone.0205130","volume":"13","author":"J Jankowski","year":"2018","unstructured":"Jankowski J, Waniek M, Alshamsi A, Br\u00f3dka P, Michalski R (2018) Strategic distribution of seeds to support diffusion in complex networks. PLoS One 13(10):0205130","journal-title":"PLoS One"},{"issue":"5","key":"647_CR27","doi-asserted-by":"publisher","first-page":"1989","DOI":"10.1214\/11-AAP822","volume":"22","author":"S Janson","year":"2012","unstructured":"Janson S, \u0141uczak T, Turova T, Vallier T (2012) Bootstrap percolation on the random graph g\u2212{n, p}. Ann Appl Probab 22(5):1989\u20132047","journal-title":"Ann Appl Probab"},{"key":"647_CR28","doi-asserted-by":"publisher","first-page":"2354","DOI":"10.1038\/srep02354","volume":"3","author":"T Jia","year":"2013","unstructured":"Jia T, Barab\u00e1si A-L (2013) Control capacity and a random sampling method in exploring controllability of complex networks. Sci Rep 3:2354","journal-title":"Sci Rep"},{"key":"647_CR29","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) 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\u2013146","DOI":"10.1145\/956750.956769"},{"key":"647_CR30","doi-asserted-by":"crossref","unstructured":"Koutsopoulos I, Halkidi M (2018) Efficient and fair item coverage in recommender systems. In: 2018 IEEE 16th international conference on dependable, autonomic and secure computing, 16th international conference on pervasive intelligence and computing, 4th international conference on big data intelligence and computing and cyber science and technology congress (DASC\/PiCom\/DataCom\/CyberSciTech), pp 912\u2013918. IEEE","DOI":"10.1109\/DASC\/PiCom\/DataCom\/CyberSciTec.2018.000-9"},{"key":"647_CR31","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"key":"647_CR32","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"647_CR33","unstructured":"Liu Y-Y, Barab\u00e1si A-L (2015) Control principles of complex networks. arXiv preprint arXiv:1508.05384"},{"issue":"3","key":"647_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.88.035006","volume":"88","author":"Y-Y Liu","year":"2016","unstructured":"Liu Y-Y, Barab\u00e1si A-L (2016) Control principles of complex systems. Rev Mod Phys 88(3):035006","journal-title":"Rev Mod Phys"},{"issue":"7346","key":"647_CR35","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1038\/nature10011","volume":"473","author":"Y-Y Liu","year":"2011","unstructured":"Liu Y-Y, Slotine J-J, Barab\u00e1si A-L (2011) Controllability of complex networks. Nature 473(7346):167","journal-title":"Nature"},{"issue":"9","key":"647_CR36","doi-asserted-by":"publisher","first-page":"44459","DOI":"10.1371\/journal.pone.0044459","volume":"7","author":"Y-Y Liu","year":"2012","unstructured":"Liu Y-Y, Slotine J-J, Barab\u00e1si A-L (2012) Control centrality and hierarchical structure in complex networks. PLoS One 7(9):44459","journal-title":"PLoS One"},{"issue":"1","key":"647_CR37","first-page":"1","volume":"5","author":"Y Liu","year":"2015","unstructured":"Liu Y, Tang M, Zhou T, Do Y (2015) Improving the accuracy of the k-shell method by removing redundant links: from a perspective of spreading dynamics. Sci Rep 5(1):1","journal-title":"Sci Rep"},{"issue":"5","key":"647_CR38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.75.056110","volume":"75","author":"A Lombardi","year":"2007","unstructured":"Lombardi A, H\u00f6rnquist M (2007) Controllability analysis of networks. Phys Rev E 75(5):056110","journal-title":"Phys Rev E"},{"issue":"32","key":"647_CR39","doi-asserted-by":"publisher","first-page":"1950395","DOI":"10.1142\/S0217979219503958","volume":"33","author":"P Lu","year":"2019","unstructured":"Lu P, Dong C (2019) Ranking the spreading influence of nodes in complex networks based on mixing degree centrality and local structure. Int J Mod Phys B 33(32):1950395","journal-title":"Int J Mod Phys B"},{"issue":"6","key":"647_CR40","doi-asserted-by":"publisher","first-page":"21202","DOI":"10.1371\/journal.pone.0021202","volume":"6","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhang Y-C, Yeung CH, Zhou T (2011) Leaders in social networks, the delicious case. PLoS One 6(6):21202","journal-title":"PLoS One"},{"key":"647_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","volume":"650","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc L, Chen D, Ren X-L, Zhang Q-M, Zhang Y-C, Zhou T (2016) Vital nodes identification in complex networks. Phys Rep 650:1\u201363","journal-title":"Phys Rep"},{"key":"647_CR42","unstructured":"McAuley JJ, Leskovec J (2012) Learning to discover social circles in ego networks. In: NIPS, vol. 2012, pp 548\u201356. Citeseer"},{"issue":"7","key":"647_CR43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.113.078701","volume":"113","author":"G Menichetti","year":"2014","unstructured":"Menichetti G, Dall\u2019Asta L, Bianconi G (2014) Network controllability is determined by the density of low in-degree and out-degree nodes. Phys Rev Lett 113(7):078701","journal-title":"Phys Rev Lett"},{"issue":"7563","key":"647_CR44","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","volume":"524","author":"F Morone","year":"2015","unstructured":"Morone F, Makse HA (2015) Influence maximization in complex networks through optimal percolation. Nature 524(7563):65\u201368","journal-title":"Nature"},{"key":"647_CR45","doi-asserted-by":"crossref","unstructured":"Musia\u0142 K, Kazienko P, Brodka P (2009) User position measures in social networks. In: Proceedings of 3rd workshop on social network mining and analysis, pp 1\u20139","DOI":"10.1145\/1731011.1731017"},{"issue":"7","key":"647_CR46","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/14\/7\/073005","volume":"14","author":"JC Nacher","year":"2012","unstructured":"Nacher JC, Akutsu T (2012) Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control. New J Phys 14(7):073005","journal-title":"New J Phys"},{"key":"647_CR47","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1038\/srep01647","volume":"3","author":"JC Nacher","year":"2013","unstructured":"Nacher JC, Akutsu T (2013) Structural controllability of unidirectional bipartite networks. Sci Rep 3:1647","journal-title":"Sci Rep"},{"issue":"1","key":"647_CR48","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2010","unstructured":"Narayanam R, Narahari Y (2010) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"647_CR49","volume-title":"The structure and dynamics of networks","author":"ME Newman","year":"2006","unstructured":"Newman ME, Barab\u00e1si A-LE, Watts DJ (2006) The structure and dynamics of networks. Princeton University Press, Princeton"},{"issue":"1","key":"647_CR50","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TCNS.2014.2310254","volume":"1","author":"F Pasqualetti","year":"2014","unstructured":"Pasqualetti F, Zampieri S, Bullo F (2014) Controllability metrics, limitations and algorithms for complex networks. IEEE Trans Control Netw Syst 1(1):40\u201352","journal-title":"IEEE Trans Control Netw Syst"},{"issue":"14","key":"647_CR51","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras R, Vespignani A (2001) Epidemic spreading in scale-free networks. Phys Rev Lett 86(14):3200","journal-title":"Phys Rev Lett"},{"issue":"8","key":"647_CR52","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aced66","volume":"25","author":"T Qin","year":"2023","unstructured":"Qin T, Duan G, Li A (2023) Detecting the driver nodes of temporal networks. New J Phys 25(8):083031","journal-title":"New J Phys"},{"key":"647_CR53","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence. AAAI\u201915, pp 4292\u20134293. AAAI Press","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"2","key":"647_CR54","first-page":"014","volume":"9","author":"B Rozemberczki","year":"2021","unstructured":"Rozemberczki B, Allen C, Sarkar R (2021) Multi-scale attributed node embedding. J Complex Netw 9(2):014","journal-title":"J Complex Netw"},{"key":"647_CR55","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Davies R, Sarkar R, Sutton C (2019) Gemsec: graph embedding with self clustering. In: Proceedings of the 2019 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 65\u201372","DOI":"10.1145\/3341161.3342890"},{"key":"647_CR56","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Sarkar R (2020) Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM international conference on information & knowledge management, pp 1325\u20131334","DOI":"10.1145\/3340531.3411866"},{"issue":"6177","key":"647_CR57","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1126\/science.1242063","volume":"343","author":"J Ruths","year":"2014","unstructured":"Ruths J, Ruths D (2014) Control profiles of complex networks. Science 343(6177):1373\u20131376","journal-title":"Science"},{"key":"647_CR58","doi-asserted-by":"crossref","unstructured":"Sadaf A, Mathieson L, Musial K (2021) An insight into network structure measures and number of driver nodes. In: Proceedings of the 2021 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 471\u2013478","DOI":"10.1145\/3487351.3488557"},{"issue":"1","key":"647_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep37105","volume":"6","author":"M Scat\u00e0","year":"2016","unstructured":"Scat\u00e0 M, Di Stefano A, Li\u00f2 P, La Corte A (2016) The impact of heterogeneity and awareness in modeling epidemic spreading on multiplex networks. Sci Rep 6(1):1\u201313","journal-title":"Sci Rep"},{"issue":"6825","key":"647_CR60","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz SH (2001) Exploring complex networks. Nature 410(6825):268","journal-title":"Nature"},{"issue":"1","key":"647_CR61","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aa574f","volume":"19","author":"PG Sun","year":"2017","unstructured":"Sun PG, Ma X (2017) Understanding the controllability of complex networks from the microcosmic to the macrocosmic. New J Phys 19(1):013022","journal-title":"New J Phys"},{"key":"647_CR62","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2022.101738","volume":"62","author":"O Ugurlu","year":"2022","unstructured":"Ugurlu O (2022) Comparative analysis of centrality measures for identifying critical nodes in complex networks. J Comput Sci 62:101738","journal-title":"J Comput Sci"},{"issue":"4","key":"647_CR63","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1109\/TCSS.2021.3067711","volume":"8","author":"M Vitoropoulou","year":"2021","unstructured":"Vitoropoulou M, Tsitseklis K, Karyotis V, Papavassiliou S (2021) Cover: An information diffusion aware approach for efficient recommendations under user coverage constraints. IEEE Trans Comput Soc Syst 8(4):894\u2013905","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"647_CR64","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.procs.2018.07.289","volume":"126","author":"A Wahid-Ul-Ashraf","year":"2018","unstructured":"Wahid-Ul-Ashraf A, Budka M, Musial K (2018) Netsim-the framework for complex network generator. Proc Comput Sci 126:547\u2013556","journal-title":"Proc Comput Sci"},{"issue":"1","key":"647_CR65","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MCAS.2003.1228503","volume":"3","author":"XF Wang","year":"2003","unstructured":"Wang XF, Chen G (2003) Complex networks: small-world, scale-free and beyond. IEEE Circuits Syst Mag 3(1):6\u201320","journal-title":"IEEE Circuits Syst Mag"},{"issue":"04","key":"647_CR66","doi-asserted-by":"publisher","first-page":"04011","DOI":"10.1088\/1742-5468\/2012\/04\/P04011","volume":"2012","author":"B Wang","year":"2012","unstructured":"Wang B, Gao L, Gao Y (2012) Control range: a controllability-based index for node significance in directed networks. J Stat Mech Theory Exp 2012(04):04011","journal-title":"J Stat Mech Theory Exp"},{"issue":"8","key":"647_CR67","first-page":"0135491","volume":"10","author":"B Wang","year":"2015","unstructured":"Wang B, Gao L, Zhang Q, Li A, Deng Y, Guo X (2015) Diversified control paths: a significant way disease genes perturb the human regulatory network. PLoS One 10(8):0135491","journal-title":"PLoS One"},{"issue":"4","key":"647_CR68","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1086\/518527","volume":"34","author":"DJ Watts","year":"2007","unstructured":"Watts DJ, Dodds PS (2007) Influentials, networks, and public opinion formation. J Consum Res 34(4):441\u2013458","journal-title":"J Consum Res"},{"key":"647_CR69","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.physa.2014.11.012","volume":"420","author":"B Wei","year":"2015","unstructured":"Wei B, Liu J, Wei D, Gao C, Deng Y (2015) Weighted k-shell decomposition for complex networks based on potential edge weights. Phys A 420:277\u2013283","journal-title":"Phys A"},{"key":"647_CR70","unstructured":"Weihe K (1998) Covering trains by stations or the power of data reduction. Proc Algorithms Exp ALEX pp 1\u20138"},{"key":"647_CR71","doi-asserted-by":"crossref","unstructured":"Weng J, Lim E-P, Jiang J, He Q (2010) Twitterrank: finding topic-sensitive influential twitterers. In: Proceedings of the Third ACM international conference on web search and data mining, p 261","DOI":"10.1145\/1718487.1718520"},{"issue":"1","key":"647_CR72","volume":"5","author":"AJ Whalen","year":"2015","unstructured":"Whalen AJ, Brennan SN, Sauer TD, Schiff SJ (2015) Observability and controllability of nonlinear networks: the role of symmetry. Phys Rev X 5(1):011005","journal-title":"Phys Rev X"},{"issue":"19","key":"647_CR73","doi-asserted-by":"publisher","first-page":"7156","DOI":"10.1073\/pnas.1311231111","volume":"111","author":"S Wuchty","year":"2014","unstructured":"Wuchty S (2014) Controllability in protein interaction networks. Proc Natl Acad Sci 111(19):7156\u20137160","journal-title":"Proc Natl Acad Sci"},{"issue":"21","key":"647_CR74","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.218703","volume":"108","author":"G Yan","year":"2012","unstructured":"Yan G, Ren J, Lai Y-C, Lai C-H, Li B (2012) Controlling complex networks: how much energy is needed? Phys Rev Lett 108(21):218703","journal-title":"Phys Rev Lett"},{"issue":"1","key":"647_CR75","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"key":"647_CR76","doi-asserted-by":"crossref","unstructured":"Yi-Run R, Song-Yang L, Jun T, Liang B, Yan-Ming G (2022) Node importance ranking method in complex network based on gravity method. ACTA Phys Sinica 71(17)","DOI":"10.7498\/aps.71.20220565"},{"issue":"3","key":"647_CR77","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1093\/bioinformatics\/btg009","volume":"19","author":"L You","year":"2003","unstructured":"You L, Hoonlor A, Yin J (2003) Modeling biological systems using dynetica\u2014a simulator of dynamic networks. Bioinformatics 19(3):435\u2013436","journal-title":"Bioinformatics"},{"issue":"4","key":"647_CR78","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"key":"647_CR79","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1016\/j.physa.2017.11.076","volume":"492","author":"H Zang","year":"2018","unstructured":"Zang H (2018) The effects of global awareness on the spreading of epidemics in multiplex networks. Phys A 492:1495\u20131506","journal-title":"Phys A"},{"issue":"28","key":"647_CR80","doi-asserted-by":"publisher","first-page":"7234","DOI":"10.1073\/pnas.1617387114","volume":"114","author":"JGT Za\u00f1udo","year":"2017","unstructured":"Za\u00f1udo JGT, Yang G, Albert R (2017) Structure-based control of complex networks with nonlinear dynamics. Proc Natl Acad Sci 114(28):7234\u20137239","journal-title":"Proc Natl Acad Sci"},{"key":"647_CR81","unstructured":"Zareie A, Sakellariou R (2021) Influence maximization in social networks: a survey of behaviour-aware methods. arXiv preprint arXiv:2108.03438"},{"issue":"11","key":"647_CR82","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0112039","volume":"9","author":"X Zhang","year":"2014","unstructured":"Zhang X, Lv T, Yang X, Zhang B (2014) Structural controllability of complex networks based on preferential matching. PLoS One 9(11):112039","journal-title":"PLoS One"},{"key":"647_CR83","doi-asserted-by":"publisher","first-page":"27823","DOI":"10.1038\/srep27823","volume":"6","author":"J-X Zhang","year":"2016","unstructured":"Zhang J-X, Chen D-B, Dong Q, Zhao Z-D (2016) Identifying a set of influential spreaders in complex networks. Sci Rep 6:27823","journal-title":"Sci Rep"},{"issue":"07n08","key":"647_CR84","doi-asserted-by":"publisher","first-page":"1950014","DOI":"10.1142\/S0219525919500140","volume":"22","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Garas A, Schweitzer F (2019) Control contribution identifies top driver nodes in complex networks. Adv Complex Syst 22(07n08):1950014","journal-title":"Adv Complex Syst"},{"key":"647_CR85","unstructured":"Zhou H, Ou-Yang Z-c (2003) Maximum matching on random graphs. arXiv preprint arXiv:cond-mat\/0309348"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00647-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-024-00647-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00647-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T11:03:45Z","timestamp":1721127825000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-024-00647-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":85,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s41109-024-00647-x","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"26 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"38"}}