{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:45:23Z","timestamp":1765889123621,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:00:00Z","timestamp":1687132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:00:00Z","timestamp":1687132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["42271476"],"award-info":[{"award-number":["42271476"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Wuhan University 351 Talents Program for Young Scholars","award":["2020007"],"award-info":[{"award-number":["2020007"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Geogr Syst"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10109-023-00419-8","type":"journal-article","created":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T11:01:48Z","timestamp":1687172508000},"page":"519-538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sensitivity metrics of complex network based on co-occurrence truth table: exemplified by a high-speed rail network"],"prefix":"10.1007","volume":"25","author":[{"given":"Juanjuan","family":"Luo","sequence":"first","affiliation":[]},{"given":"Teng","family":"Fei","sequence":"additional","affiliation":[]},{"given":"Meng","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Yifei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Meng","family":"Bian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,19]]},"reference":[{"key":"419_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.amc.2014.07.026","volume":"244","author":"T Agryzkov","year":"2014","unstructured":"Agryzkov T et al (2014) A new betweenness centrality measure based on an algorithm for ranking the nodes of a network. Appl Math Comput 244:467\u2013478. https:\/\/doi.org\/10.1016\/j.amc.2014.07.026","journal-title":"Appl Math Comput"},{"issue":"1","key":"419_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1140\/epjds\/s13688-020-00231-0","volume":"9","author":"SG Aksoy","year":"2020","unstructured":"Aksoy SG et al (2020) Hypernetwork science via high-order hypergraph walks. EPJ Data Sci 9(1):16. https:\/\/doi.org\/10.1140\/epjds\/s13688-020-00231-0","journal-title":"EPJ Data Sci"},{"issue":"6794","key":"419_CR3","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R et al (2000) Error and attack tolerance of complex networks. Nature 406(6794):378\u2013382","journal-title":"Nature"},{"issue":"1","key":"419_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579196","volume":"7","author":"N Alon","year":"1987","unstructured":"Alon N, Boppana RB (1987) The monotone circuit complexity of boolean functions. Combinatorica 7(1):1\u201322. https:\/\/doi.org\/10.1007\/BF02579196","journal-title":"Combinatorica"},{"issue":"2","key":"419_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1140\/epjb\/e2004-00110-5","volume":"38","author":"LAN Amaral","year":"2004","unstructured":"Amaral LAN, Ottino JM (2004) Complex networks. Eur Phys J Condens Matter 38(2):147\u2013162. https:\/\/doi.org\/10.1140\/epjb\/e2004-00110-5","journal-title":"Eur Phys J Condens Matter"},{"key":"419_CR6","doi-asserted-by":"publisher","unstructured":"Ambainis A et al. (2016) Sensitivity versus certificate complexity of boolean functions. In: Computer science \u2013 theory and applications. edited. Springer International Publishing, Cham. pp 16\u201328 https:\/\/doi.org\/10.1007\/978-3-319-34171-2_2","DOI":"10.1007\/978-3-319-34171-2_2"},{"issue":"3","key":"419_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0304-3975(90)90080-2","volume":"74","author":"L Babai","year":"1990","unstructured":"Babai L et al (1990) Lower bounds to the complexity of symmetric boolean functions. Theoret Comput Sci 74(3):313\u2013323. https:\/\/doi.org\/10.1016\/0304-3975(90)90080-2","journal-title":"Theoret Comput Sci"},{"issue":"5439","key":"419_CR8","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"issue":"3","key":"419_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.comnet.2004.03.011","volume":"45","author":"JM Barcel\u00f3","year":"2004","unstructured":"Barcel\u00f3 JM et al (2004) Study of internet autonomous system interconnectivity from bgp routing tables. Comput Netw 45(3):333\u2013344. https:\/\/doi.org\/10.1016\/j.comnet.2004.03.011","journal-title":"Comput Netw"},{"key":"419_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or M, Linial N (1985) Collective coin flipping, robust voting schemes and minima of Banzhaf values. Paper presented at 26th annual symposium on foundations of computer science (sfcs 1985), IEEE","DOI":"10.1109\/SFCS.1985.15"},{"issue":"1\u20137","key":"419_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"419_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.socnet.2016.08.003","volume":"48","author":"F Calderoni","year":"2017","unstructured":"Calderoni F et al (2017) Communities in criminal networks: a case study. Soc Netw 48:116\u2013125. https:\/\/doi.org\/10.1016\/j.socnet.2016.08.003","journal-title":"Soc Netw"},{"issue":"8","key":"419_CR13","doi-asserted-by":"publisher","first-page":"e236476","DOI":"10.1371\/journal.pone.0236476","volume":"15","author":"L Cavallaro","year":"2020","unstructured":"Cavallaro L et al (2020) Disrupting resilient criminal networks through data analysis: the case of Sicilian Mafia. PLoS ONE 15(8):e236476","journal-title":"PLoS ONE"},{"key":"419_CR14","unstructured":"Chakraborty S (2005) Sensitivity, block sensitivity and certificate complexity of Boolean functions, Citeseer"},{"issue":"4","key":"419_CR15","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 et al (2012) Identifying influential nodes in complex networks. Physica A 391(4):1777\u20131787. https:\/\/doi.org\/10.1016\/j.physa.2011.09.017","journal-title":"Physica A"},{"issue":"1\u20133","key":"419_CR16","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.physa.2004.04.031","volume":"340","author":"P Crucitti","year":"2004","unstructured":"Crucitti P et al (2004a) Error and attack tolerance of complex networks. Physica A 340(1\u20133):388\u2013394. https:\/\/doi.org\/10.1016\/j.physa.2004.04.031","journal-title":"Physica A"},{"issue":"4 Pt 2","key":"419_CR17","doi-asserted-by":"publisher","first-page":"45104","DOI":"10.1103\/PhysRevE.69.045104","volume":"69","author":"P Crucitti","year":"2004","unstructured":"Crucitti P et al (2004b) Model for cascading failures in complex networks. Phys Rev E 69(4 Pt 2):45104. https:\/\/doi.org\/10.1103\/PhysRevE.69.045104","journal-title":"Phys Rev E"},{"issue":"1","key":"419_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10109-010-0130-8","volume":"13","author":"A De Montis","year":"2011","unstructured":"De Montis A et al (2011) Time evolution of complex networks: commuting systems in insular Italy. J Geogr Syst 13(1):49\u201365. https:\/\/doi.org\/10.1007\/s10109-010-0130-8","journal-title":"J Geogr Syst"},{"issue":"1","key":"419_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1111\/j.1467-9671.2008.01086.x","volume":"12","author":"U Dem\u0161ar","year":"2008","unstructured":"Dem\u0161ar U et al (2008) Identifying critical locations in a spatial network with graph theory. Trans GIS 12(1):61\u201382. https:\/\/doi.org\/10.1111\/j.1467-9671.2008.01086.x","journal-title":"Trans GIS"},{"key":"419_CR20","first-page":"597","volume":"57","author":"E Estrada","year":"2010","unstructured":"Estrada E (2010) Randic index, irregularity and complex biomolecular networks. Acta Chim Slov 57:597\u2013603","journal-title":"Acta Chim Slov"},{"key":"419_CR21","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.physa.2005.12.002","volume":"364","author":"E Estrada","year":"2006","unstructured":"Estrada E, Rodr\u00edguez-Vel\u00e1zquez JA (2006) Subgraph centrality and clustering in complex hyper-networks. Physica A 364:581\u2013594. https:\/\/doi.org\/10.1016\/j.physa.2005.12.002","journal-title":"Physica A"},{"key":"419_CR22","unstructured":"Euler L (1741) Solutio problematis ad geometriam situs pertinentis. Commentarii Acad Scientiarum Petropolitanae 128\u2013140"},{"issue":"1","key":"419_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1186\/s12859-021-04197-2","volume":"22","author":"S Feng","year":"2021","unstructured":"Feng S et al (2021) Hypergraph models of biological networks to identify genes critical to pathogenic viral response. BMC Bioinform 22(1):287. https:\/\/doi.org\/10.1186\/s12859-021-04197-2","journal-title":"BMC Bioinform"},{"issue":"2","key":"419_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0378-8733(91)90017-N","volume":"13","author":"LC Freeman","year":"1991","unstructured":"Freeman LC et al (1991) Centrality in valued graphs: A measure of betweenness based on network flow. Soc Netw 13(2):141\u2013154. https:\/\/doi.org\/10.1016\/0378-8733(91)90017-N","journal-title":"Soc Netw"},{"issue":"5","key":"419_CR26","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/TCT.1959.1086595","volume":"6","author":"S Golomb","year":"1959","unstructured":"Golomb S (1959) On the classification of boolean functions. IRE Trans Circuit Theory 6(5):176\u2013186. https:\/\/doi.org\/10.1109\/TCT.1959.1086595","journal-title":"IRE Trans Circuit Theory"},{"key":"419_CR27","doi-asserted-by":"publisher","unstructured":"Guillaume J et al (2005) Comparison of failures and attacks on random and scale-free networks. edited. Springer Berlin Heidelberg, Berlin, Heidelberg. p 186\u2013196. https:\/\/doi.org\/10.1007\/11516798_14","DOI":"10.1007\/11516798_14"},{"key":"419_CR28","volume-title":"Hyper networks","author":"D Ha","year":"2011","unstructured":"Ha D et al (2011) Hyper networks. Imperial College Press, London"},{"key":"419_CR29","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa041","author":"M H\u00e2ncean","year":"2020","unstructured":"H\u00e2ncean M et al (2020) The impact of human mobility networks on the global spread of COVID-19. J Complex Netw. https:\/\/doi.org\/10.1093\/comnet\/cnaa041","journal-title":"J Complex Netw"},{"issue":"1","key":"419_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1140\/epjb\/e2010-00216-1","volume":"76","author":"A Hernando","year":"2010","unstructured":"Hernando A et al (2010) Unravelling the size distribution of social groups with information theory in complex networks. Eur Phys J B 76(1):87\u201397. https:\/\/doi.org\/10.1140\/epjb\/e2010-00216-1","journal-title":"Eur Phys J B"},{"issue":"4","key":"419_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0059613","volume":"8","author":"SAKT Iyer","year":"2013","unstructured":"Iyer SAKT (2013) Attack robustness and centrality of complex networks. PLoS ONE 8(4):1\u201317. https:\/\/doi.org\/10.1371\/journal.pone.0059613","journal-title":"PLoS ONE"},{"issue":"6","key":"419_CR32","doi-asserted-by":"publisher","first-page":"2821","DOI":"10.1111\/tgis.12806","volume":"25","author":"T Jia","year":"2021","unstructured":"Jia T et al (2021) Identification and analysis of urban influential regions using spatial interaction networks. Trans GIS 25(6):2821\u20132839. https:\/\/doi.org\/10.1111\/tgis.12806","journal-title":"Trans GIS"},{"issue":"48","key":"419_CR33","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1098\/rsif.2009.0495","volume":"7","author":"P Kaluza","year":"2010","unstructured":"Kaluza P et al (2010) The complex network of global cargo ship movements. J R Soc Interface 7(48):1093\u20131103","journal-title":"J R Soc Interface"},{"issue":"5","key":"419_CR34","doi-asserted-by":"publisher","first-page":"e1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt S et al (2009) Hypergraphs and cellular networks. PLoS Comput Biol 5(5):e1000385. https:\/\/doi.org\/10.1371\/journal.pcbi.1000385","journal-title":"PLoS Comput Biol"},{"issue":"13","key":"419_CR35","doi-asserted-by":"publisher","first-page":"4972","DOI":"10.1073\/pnas.0709247105","volume":"105","author":"L Lacasa","year":"2008","unstructured":"Lacasa L et al (2008) From time series to complex networks: the visibility graph. Proc Natl Academ Sci PNAS 105(13):4972\u20134975. https:\/\/doi.org\/10.1073\/pnas.0709247105","journal-title":"Proc Natl Academ Sci PNAS"},{"issue":"19","key":"419_CR36","doi-asserted-by":"publisher","first-page":"198701","DOI":"10.1103\/PhysRevLett.87.198701","volume":"87","author":"V Latora","year":"2001","unstructured":"Latora V, Marchiori M (2001) Efficient behavior of small-world networks. Phys Rev Lett 87(19):198701. https:\/\/doi.org\/10.1103\/PhysRevLett.87.198701","journal-title":"Phys Rev Lett"},{"key":"419_CR37","doi-asserted-by":"publisher","first-page":"105464","DOI":"10.1016\/j.knosys.2019.105464","volume":"193","author":"F Liu","year":"2020","unstructured":"Liu F et al (2020) GMM: a generalized mechanics model for identifying the importance of nodes in complex networks. Knowl Based Syst 193:105464. https:\/\/doi.org\/10.1016\/j.knosys.2019.105464","journal-title":"Knowl Based Syst"},{"issue":"429","key":"419_CR38","doi-asserted-by":"publisher","first-page":"217","DOI":"10.2307\/3615150","volume":"64","author":"EK Lloyd","year":"1980","unstructured":"Lloyd EK (1980) Graph theory\u2014an introductory course. Math Gaz 64(429):217","journal-title":"Math Gaz"},{"issue":"3","key":"419_CR39","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10109-020-00320-8","volume":"22","author":"G Madar","year":"2020","unstructured":"Madar G et al (2020) Examining the robustness of the Ontario truck road network. J Geogr Syst 22(3):309\u2013333. https:\/\/doi.org\/10.1007\/s10109-020-00320-8","journal-title":"J Geogr Syst"},{"issue":"6 Pt 2","key":"419_CR40","doi-asserted-by":"publisher","first-page":"66130","DOI":"10.1103\/PhysRevE.69.066130","volume":"69","author":"Y Moreno","year":"2004","unstructured":"Moreno Y et al (2004) Dynamics of rumor spreading in complex networks. Phys Rev E 69(6 Pt 2):66130. https:\/\/doi.org\/10.1103\/PhysRevE.69.066130","journal-title":"Phys Rev E"},{"issue":"2","key":"419_CR41","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10109-006-0039-4","volume":"9","author":"AT Murray","year":"2007","unstructured":"Murray AT et al (2007) Critical network infrastructure analysis: interdiction and system flow. J Geogr Syst 9(2):103\u2013117. https:\/\/doi.org\/10.1007\/s10109-006-0039-4","journal-title":"J Geogr Syst"},{"issue":"2","key":"419_CR42","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"3 Pt 2","key":"419_CR43","doi-asserted-by":"publisher","first-page":"36104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3 Pt 2):36104. https:\/\/doi.org\/10.1103\/PhysRevE.74.036104","journal-title":"Phys Rev E"},{"key":"419_CR44","doi-asserted-by":"publisher","DOI":"10.1098\/rstb.2013.0520","author":"D Papo","year":"2014","unstructured":"Papo D et al (2014) Complex network theory and the brain. Philosophical Trans R Soc Lond Ser b Biol Sci. https:\/\/doi.org\/10.1098\/rstb.2013.0520","journal-title":"Philosophical Trans R Soc Lond Ser b Biol Sci"},{"key":"419_CR45","doi-asserted-by":"publisher","unstructured":"Ramadan E et al (2004) A hypergraph model for the yeast protein complex network, IEEE. https:\/\/doi.org\/10.1109\/IPDPS.2004.1303205","DOI":"10.1109\/IPDPS.2004.1303205"},{"issue":"4","key":"419_CR46","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581\u2013603","journal-title":"Psychometrika"},{"issue":"10","key":"419_CR47","doi-asserted-by":"publisher","first-page":"3838","DOI":"10.1073\/pnas.1009440108","volume":"108","author":"CM Schneider","year":"2011","unstructured":"Schneider CM et al (2011) Mitigation of malicious attacks on networks. Proc Natl Acad Sci 108(10):3838\u20133841. https:\/\/doi.org\/10.1073\/pnas.1009440108","journal-title":"Proc Natl Acad Sci"},{"issue":"(4,pt.1)","key":"419_CR48","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1037\/h0053638","volume":"49","author":"ME Shaw","year":"1954","unstructured":"Shaw ME (1954) Some effects of unequal distribution of information upon group performance in various communication nets. J Abnormal Soc Psychol 49((4,pt.1)):547\u2013553. https:\/\/doi.org\/10.1037\/h0053638","journal-title":"J Abnormal Soc Psychol"},{"issue":"1","key":"419_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0378-8733(89)90016-6","volume":"11","author":"K Stephenson","year":"1989","unstructured":"Stephenson K, Zelen M (1989) Rethinking centrality: methods and examples. Soc Netw 11(1):1\u201337. https:\/\/doi.org\/10.1016\/0378-8733(89)90016-6","journal-title":"Soc Netw"},{"issue":"6","key":"419_CR50","first-page":"1275","volume":"18","author":"G Sun","year":"2017","unstructured":"Sun G, Bin S (2017) Router-level internet topology evolution model based on multi-subnet composited complex network model. J Internet Technol 18(6):1275\u20131283","journal-title":"J Internet Technol"},{"issue":"26","key":"419_CR51","doi-asserted-by":"publisher","first-page":"6671","DOI":"10.1016\/j.physa.2008.08.037","volume":"387","author":"J Wang","year":"2008","unstructured":"Wang J et al (2008) Attack vulnerability of scale-free networks due to cascading failures. Physica A 387(26):6671\u20136678. https:\/\/doi.org\/10.1016\/j.physa.2008.08.037","journal-title":"Physica A"},{"issue":"6684","key":"419_CR52","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"issue":"2","key":"419_CR53","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10109-007-0045-1","volume":"9","author":"Z Xu","year":"2007","unstructured":"Xu Z, Sui DZ (2007) Small-world characteristics on transportation networks: a perspective from network autocorrelation. J Geogr Syst 9(2):189\u2013205. https:\/\/doi.org\/10.1007\/s10109-007-0045-1","journal-title":"J Geogr Syst"},{"issue":"3\u20134","key":"419_CR54","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.physleta.2006.12.021","volume":"364","author":"R Yang","year":"2007","unstructured":"Yang R et al (2007) Epidemic spreading on heterogeneous networks with identical infectivity. Phys Lett A 364(3\u20134):189\u2013193. https:\/\/doi.org\/10.1016\/j.physleta.2006.12.021","journal-title":"Phys Lett A"},{"key":"419_CR55","doi-asserted-by":"publisher","first-page":"106705","DOI":"10.1109\/ACCESS.2020.2999312","volume":"8","author":"L Yang","year":"2020","unstructured":"Yang L et al (2020) On multiplexity-aware influence spread in social networks. IEEE Access 8:106705\u2013106713. https:\/\/doi.org\/10.1109\/ACCESS.2020.2999312","journal-title":"IEEE Access"},{"issue":"10","key":"419_CR56","doi-asserted-by":"publisher","first-page":"P10005","DOI":"10.1088\/1742-5468\/2010\/10\/P10005","volume":"2010","author":"Z Zhang","year":"2010","unstructured":"Zhang Z, Liu C (2010) A hypergraph model of social tagging networks. J Stat Mech Theory Exp 2010(10):P10005. https:\/\/doi.org\/10.1088\/1742-5468\/2010\/10\/P10005","journal-title":"J Stat Mech Theory Exp"},{"key":"419_CR57","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2021.3112226","author":"H Zhang","year":"2021","unstructured":"Zhang H, Zhong S, Deng Y, Cheong KH (2021) LFIC: identifying influential nodes in complex networks by local fuzzy information centrality. IEEE Trans Fuzzy Syst. https:\/\/doi.org\/10.1109\/TFUZZ.2021.3112226","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"5 Pt 2","key":"419_CR58","doi-asserted-by":"publisher","first-page":"56109","DOI":"10.1103\/PhysRevE.74.056109","volume":"74","author":"T Zhou","year":"2006","unstructured":"Zhou T et al (2006) Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity. Phys Rev E 74(5 Pt 2):56109. https:\/\/doi.org\/10.1103\/PhysRevE.74.056109","journal-title":"Phys Rev E"},{"key":"419_CR59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64221-1_10","volume-title":"An efficient method of advertising on online social networks","author":"X Zou","year":"2020","unstructured":"Zou X et al (2020) An efficient method of advertising on online social networks. Springer, Cham"}],"container-title":["Journal of Geographical Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10109-023-00419-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10109-023-00419-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10109-023-00419-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T03:11:27Z","timestamp":1697425887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10109-023-00419-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,19]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["419"],"URL":"https:\/\/doi.org\/10.1007\/s10109-023-00419-8","relation":{},"ISSN":["1435-5930","1435-5949"],"issn-type":[{"type":"print","value":"1435-5930"},{"type":"electronic","value":"1435-5949"}],"subject":[],"published":{"date-parts":[[2023,6,19]]},"assertion":[{"value":"2 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2023","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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}