{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T09:52:19Z","timestamp":1769161939013,"version":"3.49.0"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"national key research and development program of china","award":["2018YFB1003602"],"award-info":[{"award-number":["2018YFB1003602"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10489-022-03262-4","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T13:14:57Z","timestamp":1648214097000},"page":"16586-16604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Escape velocity centrality: escape influence-based key nodes identification in complex networks"],"prefix":"10.1007","volume":"52","author":[{"given":"Aman","family":"Ullah","sequence":"first","affiliation":[]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"JinFang","family":"Sheng","sequence":"additional","affiliation":[]},{"given":"Nasrullah","family":"Khan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"key":"3262_CR1","doi-asserted-by":"crossref","unstructured":"Li H, Zhang R, Zhao Z, Liu X, Yuan Y (2021) Identification of top-k influential nodes based on discrete crow search algorithm optimization for influence maximization. Appl Intell:1\u201317","DOI":"10.1007\/s10489-021-02283-9"},{"key":"3262_CR2","doi-asserted-by":"crossref","unstructured":"Mnasri W, Azaouzi M, Romdhane LB (2021) Parallel social behavior-based algorithm for identification of influential users in social network. Appl Intell:1\u201319","DOI":"10.1007\/s10489-021-02203-x"},{"key":"3262_CR3","doi-asserted-by":"publisher","first-page":"3561","DOI":"10.1007\/s10489-020-01999-4","volume":"51","author":"S Bahadori","year":"2021","unstructured":"Bahadori S, Moradi P, Zare H (2021) An improved limited random walk approach for identification of overlapping communities in complex networks. Appl Intell 51:3561\u20133580","journal-title":"Appl Intell"},{"key":"3262_CR4","doi-asserted-by":"crossref","unstructured":"Qiu L, Zhang J, Tian X (2021) Ranking influential nodes in complex networks based on local and global structures. Appl Intell:1\u201314","DOI":"10.3390\/a14030082"},{"key":"3262_CR5","doi-asserted-by":"publisher","first-page":"10275","DOI":"10.1007\/s00521-019-04568-0","volume":"32","author":"B Tidke","year":"2020","unstructured":"Tidke B, Mehta R, Dhanani J (2020) Consensus-based aggregation for identification and ranking of top-k influential nodes. Neural Comput Appl 32:10275\u201310301","journal-title":"Neural Comput Appl"},{"key":"3262_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.physa.2016.12.038","volume":"471","author":"D Li","year":"2017","unstructured":"Li D, Wang X, Huang P (2017) A fractal growth model: exploring the connection pattern of hubs in complex networks. Physica A: Stat Mech its Appl 471:200\u2013211 URL https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437116310184","journal-title":"Physica A: Stat Mech its Appl"},{"key":"3262_CR7","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s00521-020-04919-2","volume":"33","author":"J-H Zhao","year":"2021","unstructured":"Zhao J-H, Zeng D-L, Qin J-T, Si H-M, Liu X-F (2021) Simulation and modeling of microblog-based spread of public opinions on emergencies. Neural Comput Applic 33:547\u2013564","journal-title":"Neural Comput Applic"},{"key":"3262_CR8","doi-asserted-by":"publisher","first-page":"104705","DOI":"10.1016\/j.conengprac.2020.104705","volume":"108","author":"H Parastvand","year":"2021","unstructured":"Parastvand H, Chapman A, Bass O, Lachowicz S (2021) Graph automorphic approaches to the robustness of complex networks. Control Eng Pract 108:104705","journal-title":"Control Eng Pract"},{"key":"3262_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-56847-4","volume":"10","author":"T Ren","year":"2020","unstructured":"Ren T et al (2020) Identifying vital nodes based on reverse greedy method. Sci Rep 10:1\u20138","journal-title":"Sci Rep"},{"key":"3262_CR10","doi-asserted-by":"crossref","unstructured":"Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D (2006) Complex networks: Struct Dynam Phys reports. 424","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"3262_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/SURV.2012.021312.00034","volume":"15","author":"Y Yan","year":"2012","unstructured":"Yan Y, Qian Y, Sharif H, Tipper D (2012) A survey on smart grid communication infrastructures: motivations, requirements and challenges. IEEE Commun Surv Tutor 15:5\u201320","journal-title":"IEEE Commun Surv Tutor"},{"key":"3262_CR12","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P. & Faloutsos, C. On power-law relationships of the internet topology. In The Structure and Dynamics of Networks, 195\u2013206 Princeton University Press, (2011)","DOI":"10.1515\/9781400841356.195"},{"key":"3262_CR13","doi-asserted-by":"publisher","DOI":"10.1088\/1674-1056\/21\/2\/028903","volume":"21","author":"C Kai-Quan","year":"2012","unstructured":"Kai-Quan C, Jun Z, Wen-Bo D, Xian-Bin C (2012) Analysis of the chinese air route network as a complex network. Chin Physics B 21:028903","journal-title":"Chin Physics B"},{"key":"3262_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1038\/nature01604","volume":"423","author":"D Garlaschelli","year":"2003","unstructured":"Garlaschelli D, Caldarelli G, Pietronero L (2003) Universal scaling relations in food webs. Nature 423:165\u2013168","journal-title":"Nature"},{"key":"3262_CR15","doi-asserted-by":"crossref","unstructured":"Cui Y, Wang X, Li J (2014) Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient. Physica A: Stat Mech Appl, URL 405:85\u201391 https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437114002222","DOI":"10.1016\/j.physa.2014.03.027"},{"key":"3262_CR16","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Itzkovitz S, Kashtan N, Chklovskii D, Shen-Orr S, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298:824","journal-title":"Science"},{"key":"3262_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.physa.2010.08.052","volume":"390","author":"D Amancio","year":"2011","unstructured":"Amancio D et al (2011) Using metrics from complex networks to evaluate machine translation. Physica A: Stat Mech Appl 390:131\u2013142","journal-title":"Physica A: Stat Mech Appl"},{"key":"3262_CR18","doi-asserted-by":"publisher","first-page":"121765","DOI":"10.1016\/j.physa.2019.121765","volume":"531","author":"J Sheng","year":"2019","unstructured":"Sheng J et al (2019) Community detection based on human social behavior. Physica A: Stat Mech Appl 531:121765","journal-title":"Physica A: Stat Mech Appl"},{"key":"3262_CR19","doi-asserted-by":"crossref","unstructured":"Estrada, E. Introduction to complex networks: structure and dynamics. In Evolutionary equations with applications in natural sciences, 93\u2013131 Springer, (2015)","DOI":"10.1007\/978-3-319-11322-7_3"},{"key":"3262_CR20","doi-asserted-by":"publisher","first-page":"1950021","DOI":"10.1142\/S0129183119500219","volume":"30.04","author":"J Sheng","year":"2019","unstructured":"Sheng J et al (2019) FluidC+: a novel community detection algorithm based on fluid propagation. Int J Modern Physics C 30.04:1950021","journal-title":"Int J Modern Physics C"},{"key":"3262_CR21","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.physa.2016.04.009","volume":"458","author":"X Wang","year":"2016","unstructured":"Wang X, Zhao T, Qin X (2016) Model of epidemic control based on quarantine and message delivery. Physica A: Stat Mech Appl 458:168\u2013178","journal-title":"Physica A: Stat Mech Appl"},{"key":"3262_CR22","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cnsns.2016.12.019","volume":"48","author":"X Wang","year":"2017","unstructured":"Wang X, Zhao T (2017) Model for multi-messages spreading over complex networks considering the relationship between messages. Commun Nonlinear Sci Numer Simul 48:63\u201369","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"3262_CR23","doi-asserted-by":"publisher","first-page":"6125","DOI":"10.1016\/j.physa.2013.07.066","volume":"392","author":"J Li","year":"2013","unstructured":"Li J, Wang X, Eustace J (2013) Detecting overlapping communities by seed community in weighted complex networks. Physica A: Stat Mech Appl 392:6125\u20136134","journal-title":"Physica A: Stat Mech Appl"},{"key":"3262_CR24","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1038\/nature03248","volume":"433","author":"C Song","year":"2005","unstructured":"Song C, Havlin S, Makse HA (2005) Self-similarity of complex networks. Nature 433:392\u2013395","journal-title":"Nature"},{"key":"3262_CR25","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1016\/j.physa.2017.09.042","volume":"491","author":"Q Zhang","year":"2018","unstructured":"Zhang Q, Li M, Deng Y (2018) Measure the structure similarity of nodes in complex networks based on relative entropy. Physica A: Stat Mech Appl 491:749\u2013763","journal-title":"Physica A: Stat Mech Appl"},{"key":"3262_CR26","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1142\/S0218127402004802","volume":"12","author":"XF Wang","year":"2002","unstructured":"Wang XF (2002) Complex networks: topology, dynamics and synchronization. Int J Bifurcation Chaos 12:885\u2013916","journal-title":"Int J Bifurcation Chaos"},{"key":"3262_CR27","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.chaos.2017.05.040","volume":"103","author":"T Bian","year":"2017","unstructured":"Bian T, Deng Y (2017) A new evidential methodology of identifying influential nodes in complex networks. Chaos, Solitons & Fractals 103:101\u2013110","journal-title":"Chaos, Solitons & Fractals"},{"key":"3262_CR28","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1140\/epjb\/e2004-00111-4","volume":"38","author":"M Barthelemy","year":"2004","unstructured":"Barthelemy M (2004) Betweenness centrality in large complex networks. Eur Phys J B 38:163\u2013168","journal-title":"Eur Phys J B"},{"key":"3262_CR29","volume-title":"The pagerank citation ranking: bringing order to the web","author":"L Page","year":"1999","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Tech. Rep, Stanford InfoLab"},{"key":"3262_CR30","doi-asserted-by":"crossref","unstructured":"Brin S & Page L (1998) The anatomy of a large-scale hypertextual web search engine","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"3262_CR31","doi-asserted-by":"crossref","unstructured":"Simsek A (2021) Lexical sorting centrality to distinguish spreading abilities of nodes in complex networks under the susceptible- infectious-recovered (sir) model. arXiv preprint arXiv:2101.10975","DOI":"10.1016\/j.jksuci.2021.06.010"},{"key":"3262_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.chaos.2018.06.022","volume":"114","author":"A Ibnoulouafi","year":"2018","unstructured":"Ibnoulouafi A, El Haziti M (2018) Density centrality: identifying influential nodes based on area density formula. Chaos, Solitons Fractals 114:69\u201380","journal-title":"Chaos, Solitons Fractals"},{"key":"3262_CR33","doi-asserted-by":"publisher","first-page":"60957","DOI":"10.1109\/ACCESS.2019.2915508","volume":"7","author":"W Zekun","year":"2019","unstructured":"Zekun W, Xiangxi W, Minggong W (2019) Identification of key nodes in aircraft state network based on complex network theory. IEEE Access 7:60957\u201360967","journal-title":"IEEE Access"},{"key":"3262_CR34","first-page":"346","volume":"65","author":"B Liu","year":"2017","unstructured":"Liu B, Li Z, Chen X, Huang Y, Liu X (2017) Recognition and vulnerability analysis of key nodes in power grid based on complex network centrality. IEEE Trans Circ Syst II: Express Briefs 65:346\u2013350","journal-title":"IEEE Trans Circ Syst II: Express Briefs"},{"key":"3262_CR35","doi-asserted-by":"publisher","first-page":"7390","DOI":"10.1109\/ACCESS.2018.2794324","volume":"6","author":"MM Tulu","year":"2018","unstructured":"Tulu MM, Hou R, Younas T (2018) Identifying influential nodes based on community structure to speed up the dissemination of information in complex network. IEEE Access 6:7390\u20137401","journal-title":"IEEE Access"},{"key":"3262_CR36","doi-asserted-by":"crossref","unstructured":"Wang Q et al (2018) Cda: a clustering degree based influential spreader identification algorithm in weighted complex network. IEEE Access 6:19550\u201319559Wang, Q.et al Cda: a clustering degree based influential spreader identification algorithm in weighted complex network. IEEE Access 6, 19550\u201319559 (2018)","DOI":"10.1109\/ACCESS.2018.2822844"},{"key":"3262_CR37","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Math Sociol 2:113\u2013120","journal-title":"J Math Sociol"},{"key":"3262_CR38","doi-asserted-by":"crossref","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry:35\u201341","DOI":"10.2307\/3033543"},{"key":"3262_CR39","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Networks 1:215\u2013239","journal-title":"Soc Networks"},{"key":"3262_CR40","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.physa.2016.02.049","volume":"452","author":"J Liu","year":"2016","unstructured":"Liu J, Xiong Q, Shi W, Shi X, Wang K (2016) Evaluating the importance of nodes in complex networks. Physica A: Stat Mech Appl 452:209\u2013219","journal-title":"Physica A: Stat Mech Appl"},{"key":"3262_CR41","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","journal-title":"Nat Phys"},{"key":"3262_CR42","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78:046110","journal-title":"Phys Rev E"},{"key":"3262_CR43","doi-asserted-by":"publisher","DOI":"10.1063\/1.5030894","volume":"28","author":"T Bian","year":"2018","unstructured":"Bian T, Deng Y (2018) Identifying influential nodes in complex networks: a node information dimension approach. Chaos: Interdiscipl J Nonlinear Sci 28:043109","journal-title":"Chaos: Interdiscipl J Nonlinear Sci"},{"key":"3262_CR44","doi-asserted-by":"publisher","first-page":"105464","DOI":"10.1016\/j.knosys.2019.105464","volume":"193","author":"F Liu","year":"2020","unstructured":"Liu F, Wang Z, Deng Y (2020) Gmm: a generalized mechanics model for identifying the importance of nodes in complex networks. Knowl-Based Syst 193:105464","journal-title":"Knowl-Based Syst"},{"key":"3262_CR45","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1016\/j.physa.2018.08.135","volume":"512","author":"L Fei","year":"2018","unstructured":"Fei L, Zhang Q, Deng Y (2018) Identifying influential nodes in complex networks based on the inverse-square law. Physica A: Stat Mech Appl 512:1044\u20131059","journal-title":"Physica A: Stat Mech Appl"},{"key":"3262_CR46","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.physleta.2013.02.039","volume":"377","author":"A Zeng","year":"2013","unstructured":"Zeng A, Zhang C-J (2013) Ranking spreaders by decomposing complex networks. Phys Lett A 377:1031\u20131035","journal-title":"Phys Lett A"},{"key":"3262_CR47","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.056103","volume":"71","author":"E Estrada","year":"2005","unstructured":"Estrada E, Rodr\u00edguez-Vel\u00e1zquez JA (2005) Subgraph centrality in complex networks. Phys Rev E 71:056103","journal-title":"Phys Rev E"},{"key":"3262_CR48","doi-asserted-by":"crossref","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry:35\u201341","DOI":"10.2307\/3033543"},{"key":"3262_CR49","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","volume":"451","author":"L-L Ma","year":"2016","unstructured":"Ma L-L, Ma C, Zhang H-F, Wang B-H (2016) Identifying influential spreaders in complex networks based on gravity formula. Physica A: Stat Mech Appl 451:205\u2013212","journal-title":"Physica A: Stat Mech Appl"},{"key":"3262_CR50","doi-asserted-by":"publisher","first-page":"115778","DOI":"10.1016\/j.eswa.2021.115778","volume":"186","author":"A Ullah","year":"2021","unstructured":"Ullah A, Wang B, Sheng JF, Long J, Khan N, Sun ZJ (2021) Identifying vital nodes from local and global perspectives in complex networks. Expert Syst Appl 186:115778","journal-title":"Expert Syst Appl"},{"key":"3262_CR51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-020-79139-8","volume":"11","author":"U Aman","year":"2021","unstructured":"Aman U et al (2021) Identification of nodes influence based on global structure model in complex networks. Scientific Reports 11:1\u201311","journal-title":"Scientific Reports"},{"key":"3262_CR52","first-page":"1","volume":"2021","author":"A Ullah","year":"2021","unstructured":"Ullah A, Sheng J, Long J, Khan N et al (2021) Identification of influential nodes via effective distance-based centrality mechanism in complex networks. Complexity 2021:1\u201316","journal-title":"Complexity"},{"key":"3262_CR53","doi-asserted-by":"publisher","first-page":"131719","DOI":"10.1109\/ACCESS.2019.2939804","volume":"7","author":"J Dai","year":"2019","unstructured":"Dai J, Wang B, Sheng J, Sun Z, Khawaja FR, Ullah A, Dejene DA, Duan G (2019) Identifying influential nodes in complex networks based on local neighbor contribution. IEEE Access 7:131719\u2013131731","journal-title":"IEEE Access"},{"key":"3262_CR54","doi-asserted-by":"crossref","unstructured":"Zareie A, Sheikhahmadi A, Jalili M, Fasaei MSK (2020) Finding influential nodes in social networks based on neighborhood correlation coefficient. Knowledge-Based Syst:105580","DOI":"10.1016\/j.knosys.2020.105580"},{"key":"3262_CR55","doi-asserted-by":"publisher","first-page":"29200","DOI":"10.1109\/ACCESS.2018.2843532","volume":"6","author":"J Zhong","year":"2018","unstructured":"Zhong J, Zhang F, Li Z (2018) Identification of vital nodes in complex network via belief propagation and node reinsertion. IEEE Access 6:29200\u201329210","journal-title":"IEEE Access"},{"key":"3262_CR56","doi-asserted-by":"publisher","first-page":"112971","DOI":"10.1016\/j.eswa.2019.112971","volume":"142","author":"A Zareie","year":"2020","unstructured":"Zareie A, Sheikhahmadi A, Jalili M (2020) Identification of influential users in social network using gray wolf optimization algorithm. Expert Syst Appl 142:112971","journal-title":"Expert Syst Appl"},{"key":"3262_CR57","doi-asserted-by":"publisher","first-page":"3777","DOI":"10.1109\/ACCESS.2017.2679038","volume":"5","author":"Z Sun","year":"2017","unstructured":"Sun Z, Wang B, Sheng J, Hu Y, Wang Y, Shao J (2017) Identifying influential nodes in complex networks based on weighted formal concept analysis. IEEE Access 5:3777\u20133789","journal-title":"IEEE Access"},{"key":"3262_CR58","doi-asserted-by":"publisher","first-page":"261","DOI":"10.3390\/e20040261","volume":"20","author":"T Qiao","year":"2018","unstructured":"Qiao T, Shan W, Yu G, Liu C (2018) A novel entropy-based centrality approach for identifying vital nodes in weighted networks. Entropy 20:261","journal-title":"Entropy"},{"key":"3262_CR59","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ins.2019.04.033","volume":"493","author":"A Zareie","year":"2019","unstructured":"Zareie A, Sheikhahmadi A, Jalili M (2019) Identification of influential users in social networks based on users' interest. Inform Sci 493:217\u2013231","journal-title":"Inform Sci"},{"key":"3262_CR60","doi-asserted-by":"publisher","first-page":"113092","DOI":"10.1016\/j.eswa.2019.113092","volume":"144","author":"G Maji","year":"2020","unstructured":"Maji G, Namtirtha A, Dutta A, Malta MC (2020) Influential spreaders identification in complex networks with improved k-shell hybrid method. Expert Syst Appl 144:113092","journal-title":"Expert Syst Appl"},{"key":"3262_CR61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-018-37186-2","volume":"9","author":"Z Li","year":"2019","unstructured":"Li Z et al (2019) Identifying influential spreaders by gravity model. Sci Rep 9:1\u20137","journal-title":"Sci Rep"},{"key":"3262_CR62","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00521-017-2977-9","volume":"31","author":"U G\u00fcvenc","year":"2019","unstructured":"G\u00fcvenc U, Kat\u0131rc\u0131o\u01e7lu F (2019) Escape velocity: a new operator for gravitational search algorithm. Neural Comput & Applic 31:27\u201342","journal-title":"Neural Comput & Applic"},{"key":"3262_CR63","first-page":"8065103","volume":"E 6","author":"R Guimer","year":"2003","unstructured":"Guimer R, Danon L, Daz-Guilera A, Giralt FA (2003) Arenas, Self-similar community structure in a network of human interactions. Phys. Rev. E 6:8065103","journal-title":"Phys. Rev."},{"key":"3262_CR64","unstructured":"Federal Aviation Administration, Air traffic control system command center, http:\/\/www.fly.faa.gov\/, (2017)"},{"key":"3262_CR65","unstructured":"Cohen W Enron email dataset, URL: http:\/\/www.cs.cmu.edu\/~enron\/. Accessed in (2009)"},{"key":"3262_CR66","unstructured":"SocioPatterns, Infectious contact networks,????URL: http:\/\/www. sociopatterns.org\/datasets\/"},{"key":"3262_CR67","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0025-5564(94)90025-6","volume":"124","author":"L Allen","year":"1994","unstructured":"Allen L (1994) J. some discrete-time si, sir, and sis epidemic models. Math Biosci 124:83\u2013105","journal-title":"Math Biosci"},{"key":"3262_CR68","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1098\/rsif.2005.0051","volume":"2","author":"MJ Keeling","year":"2005","unstructured":"Keeling MJ, Eames KT (2005) Networks and epidemic models. J R Soc Interface 2:295\u2013307","journal-title":"J R Soc Interface"},{"key":"3262_CR69","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1093\/biomet\/33.3.239","volume":"33","author":"MG Kendall","year":"1945","unstructured":"Kendall MG (1945) The treatment of ties in ranking problems. Biometrika 33:239\u2013251","journal-title":"Biometrika"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03262-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03262-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03262-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T09:26:28Z","timestamp":1668072388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03262-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,24]]},"references-count":69,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["3262"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03262-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,24]]},"assertion":[{"value":"18 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}