{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:09:16Z","timestamp":1773385756072,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T00:00:00Z","timestamp":1743552000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T00:00:00Z","timestamp":1743552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s11432-024-4260-8","type":"journal-article","created":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T23:20:32Z","timestamp":1743895232000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantifying the weakness of ties with hierarchy-based link centrality"],"prefix":"10.1007","volume":"68","author":[{"given":"Jianhong","family":"Mou","sequence":"first","affiliation":[]},{"given":"Longyun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kang","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Bitao","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Suoyi","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Fredrik","family":"Liljeros","sequence":"additional","affiliation":[]},{"given":"Petter","family":"Holme","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,2]]},"reference":[{"key":"4260_CR1","doi-asserted-by":"publisher","first-page":"062812","DOI":"10.1103\/PhysRevE.88.062812","volume":"88","author":"J Platig","year":"2013","unstructured":"Platig J, Ott E, Girvan M. Robustness of network measures to link errors. Phys Rev E, 2013, 88: 062812","journal-title":"Phys Rev E"},{"key":"4260_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1177\/0894439314546729","volume":"33","author":"D Wegge","year":"2015","unstructured":"Wegge D, Vandebosch H, Eggermont S, et al. The strong, the weak, and the unbalanced. Soc Sci Comput Rev, 2015, 33: 315\u2013342","journal-title":"Soc Sci Comput Rev"},{"key":"4260_CR3","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1038\/ncomms1847","volume":"3","author":"D Grady","year":"2012","unstructured":"Grady D, Thiemann C, Brockmann D. Robust classification of salient links in complex networks. Nat Commun, 2012, 3: 864","journal-title":"Nat Commun"},{"key":"4260_CR4","doi-asserted-by":"publisher","first-page":"eaau4212","DOI":"10.1126\/sciadv.aau4212","volume":"4","author":"J T Matamalas","year":"2018","unstructured":"Matamalas J T, Arenas A, G\u00f3mez S. Effective approach to epidemic containment using link equations in complex networks. Sci Adv, 2018, 4: eaau4212","journal-title":"Sci Adv"},{"key":"4260_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1038\/s42254-023-00676-y","volume":"6","author":"O Artime","year":"2024","unstructured":"Artime O, Grassia M, de Domenico M, et al. Robustness and resilience of complex networks. Nat Rev Phys, 2024, 6: 114\u2013131","journal-title":"Nat Rev Phys"},{"key":"4260_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-031-57515-0_15","volume-title":"Proceedings of the 15th Conference on Complex Networks, Switzerland","author":"M Grassia","year":"2024","unstructured":"Grassia M, Mangioni G. Edge dismantling with geometric reinforcement learning. In: Proceedings of the 15th Conference on Complex Networks, Switzerland, 2024. 195\u2013202"},{"key":"4260_CR7","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"M S Granovetter","year":"1973","unstructured":"Granovetter M S. The strength of weak ties. Am J Soc, 1973, 78: 1360\u20131380","journal-title":"Am J Soc"},{"key":"4260_CR8","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1126\/science.abl4476","volume":"377","author":"K Rajkumar","year":"2022","unstructured":"Rajkumar K, Saint-Jacques G, Bojinov I, et al. A causal test of the strength of weak ties. Science, 2022, 377: 1304\u20131310","journal-title":"Science"},{"key":"4260_CR9","doi-asserted-by":"publisher","first-page":"121843","DOI":"10.1016\/j.eswa.2023.121843","volume":"238","author":"M Y Zhou","year":"2024","unstructured":"Zhou M Y, Wang F, Chen Z, et al. Weak link prediction based on hyper latent distance in complex network. Expert Syst Appl, 2024, 238: 121843","journal-title":"Expert Syst Appl"},{"key":"4260_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629438","volume":"57","author":"P D Meo","year":"2014","unstructured":"Meo P D, Ferrara E, Fiumara G, et al. On Facebook, most ties are weak. Commun ACM, 2014, 57: 78\u201384","journal-title":"Commun ACM"},{"key":"4260_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/3240323.3240371","volume-title":"Proceedings of the 12th ACM Conference on Recommender Systems, New York","author":"J Sanz-Cruzado","year":"2018","unstructured":"Sanz-Cruzado J, Castells P. Enhancing structural diversity in social networks by recommending weak ties. In: Proceedings of the 12th ACM Conference on Recommender Systems, New York, 2018. 233\u2013241"},{"key":"4260_CR12","doi-asserted-by":"publisher","first-page":"105249","DOI":"10.1016\/j.knosys.2019.105249","volume":"192","author":"K J Chen","year":"2020","unstructured":"Chen K J, Zhang P, Yang Z, et al. iBridge: inferring bridge links that diffuse information across communities. Knowledge-Based Syst, 2020, 192: 105249","journal-title":"Knowledge-Based Syst"},{"key":"4260_CR13","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1038\/s41567-022-01716-7","volume":"18","author":"S Fortunato","year":"2022","unstructured":"Fortunato S, Newman M E J. 20 years of network community detection. Nat Phys, 2022, 18: 848\u2013850","journal-title":"Nat Phys"},{"key":"4260_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1038\/s42005-022-00816-3","volume":"5","author":"A Kirkley","year":"2022","unstructured":"Kirkley A, Newman M E J. Representative community divisions of networks. Commun Phys, 2022, 5: 40","journal-title":"Commun Phys"},{"key":"4260_CR15","first-page":"2887","volume":"35","author":"Z He","year":"2023","unstructured":"He Z, Wei X, Chen W, et al. On the statistical significance of a community structure. IEEE Trans Knowl Data Eng, 2023, 35: 2887\u20132900","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4260_CR16","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, et al. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 2005, 435: 814\u2013818","journal-title":"Nature"},{"key":"4260_CR17","doi-asserted-by":"publisher","first-page":"2500","DOI":"10.1109\/TFUZZ.2021.3087235","volume":"30","author":"J Xiao","year":"2022","unstructured":"Xiao J, Wang Y J, Xu X K. Fuzzy community detection based on elite symbiotic organisms search and node neighborhood information. IEEE Trans Fuzzy Syst, 2022, 30: 2500\u20132514","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"4260_CR18","doi-asserted-by":"publisher","first-page":"45380","DOI":"10.1038\/srep45380","volume":"7","author":"Y Qian","year":"2017","unstructured":"Qian Y, Li Y, Zhang M, et al. Quantifying edge significance on maintaining global connectivity. Sci Rep, 2017, 7: 45380","journal-title":"Sci Rep"},{"key":"4260_CR19","doi-asserted-by":"publisher","first-page":"7332","DOI":"10.1073\/pnas.0610245104","volume":"104","author":"J P Onnela","year":"2007","unstructured":"Onnela J P, Saram\u00e4ki J, Hyv\u00f6nen J, et al. Structure and tie strengths in mobile communication networks. Proc Natl Acad Sci USA, 2007, 104: 7332\u20137336","journal-title":"Proc Natl Acad Sci USA"},{"key":"4260_CR20","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.knosys.2012.01.007","volume":"30","author":"P de Meo","year":"2012","unstructured":"de Meo P, Ferrara E, Fiumara G, et al. A novel measure of edge centrality in social networks. Knowledge-Based Syst, 2012, 30: 136\u2013150","journal-title":"Knowledge-Based Syst"},{"key":"4260_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.sbspro.2013.05.056","volume":"79","author":"\u00c9 Huszti","year":"2013","unstructured":"Huszti \u00c9, D\u00e1vid B, Vajda K. Strong tie, weak tie and in-betweens: a continuous measure of tie strength based on contact diary datasets. Procedia-Soc Behav Sci, 2013, 79: 38\u201361","journal-title":"Procedia-Soc Behav Sci"},{"key":"4260_CR22","doi-asserted-by":"publisher","first-page":"13172","DOI":"10.1038\/srep13172","volume":"5","author":"Y Liu","year":"2015","unstructured":"Liu Y, Tang M, Zhou T, et al. Improving the accuracy of the k-shell method by removing redundant links: from a perspective of spreading dynamics. Sci Rep, 2015, 5: 13172","journal-title":"Sci Rep"},{"key":"4260_CR23","doi-asserted-by":"publisher","first-page":"121027","DOI":"10.1016\/j.physa.2019.04.263","volume":"536","author":"C Y Huang","year":"2019","unstructured":"Huang C Y, Chin W C B, Fu Y H, et al. Beyond bond links in complex networks:Local bridges, global bridges and silk links. Phys A-Stat Mech Its Appl, 2019, 536: 121027","journal-title":"Phys A-Stat Mech Its Appl"},{"key":"4260_CR24","doi-asserted-by":"publisher","first-page":"123877","DOI":"10.1016\/j.physa.2019.123877","volume":"548","author":"N Zhao","year":"2020","unstructured":"Zhao N, Li J, Wang J, et al. Identifying significant edges via neighborhood information. Phys A-Stat Mech Its Appl, 2020, 548: 123877","journal-title":"Phys A-Stat Mech Its Appl"},{"key":"4260_CR25","doi-asserted-by":"publisher","first-page":"17557","DOI":"10.1038\/s41598-019-53708-y","volume":"9","author":"M Tantardini","year":"2019","unstructured":"Tantardini M, Ieva F, Tajoli L, et al. Comparing methods for comparing networks. Sci Rep, 2019, 9: 17557","journal-title":"Sci Rep"},{"key":"4260_CR26","doi-asserted-by":"publisher","first-page":"012319","DOI":"10.1103\/PhysRevE.98.012319","volume":"98","author":"D Chen","year":"2018","unstructured":"Chen D, Shi D D, Qin M, et al. Complex network comparison based on communicability sequence entropy. Phys Rev E, 2018, 98: 012319","journal-title":"Phys Rev E"},{"key":"4260_CR27","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1038\/s42005-021-00638-9","volume":"4","author":"L Lacasa","year":"2021","unstructured":"Lacasa L, Stramaglia S, Marinazzo D. Beyond pairwise network similarity: exploring mediation and suppression between networks. Commun Phys, 2021, 4: 136","journal-title":"Commun Phys"},{"key":"4260_CR28","doi-asserted-by":"publisher","first-page":"13928","DOI":"10.1038\/ncomms13928","volume":"8","author":"T A Schieber","year":"2017","unstructured":"Schieber T A, Carpi L, D\u00edaz-Guilera A, et al. Quantification of network structural dissimilarities. Nat Commun, 2017, 8: 13928","journal-title":"Nat Commun"},{"key":"4260_CR29","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1038\/s41467-023-37323-0","volume":"14","author":"T A Schieber","year":"2023","unstructured":"Schieber T A, Carpi L C, Pardalos P M, et al. Diffusion capacity of single and interconnected networks. Nat Commun, 2023, 14: 2217","journal-title":"Nat Commun"},{"key":"4260_CR30","doi-asserted-by":"publisher","first-page":"128043","DOI":"10.1016\/j.physa.2022.128043","volume":"606","author":"S Tofighy","year":"2022","unstructured":"Tofighy S, Charkari N M, Ghaderi F. Link prediction in multiplex networks using intralayer probabilistic distance and interlayer co-evolving factors. Phys A-Stat Mech Its Appl, 2022, 606: 128043","journal-title":"Phys A-Stat Mech Its Appl"},{"key":"4260_CR31","doi-asserted-by":"publisher","first-page":"128079","DOI":"10.1016\/j.physa.2022.128079","volume":"606","author":"G Chen","year":"2022","unstructured":"Chen G, Zhou S, Li M, et al. Evaluation of community vulnerability based on communicability and structural dissimilarity. Phys A-Stat Mech Its Appl, 2022, 606: 128079","journal-title":"Phys A-Stat Mech Its Appl"},{"key":"4260_CR32","unstructured":"Peng P, Fan T, Ren X L, et al. Unveiling explosive vulnerability of networks through edge collective behavior. 2023. ArXiv:2310.06407"},{"key":"4260_CR33","doi-asserted-by":"publisher","first-page":"12368","DOI":"10.1073\/pnas.1605083113","volume":"113","author":"A Braunstein","year":"2016","unstructured":"Braunstein A, DallAsta L, Semerjian G, et al. Network dismantling. Proc Natl Acad Sci USA, 2016, 113: 12368\u201312373","journal-title":"Proc Natl Acad Sci USA"},{"key":"4260_CR34","first-page":"509","volume-title":"Proceedings of International Conference on Complex Networks and Their Applications, Palermo","author":"L Wu","year":"2023","unstructured":"Wu L, Ren X L. Optimal bond percolation in networks by a fast-decycling framework. In: Proceedings of International Conference on Complex Networks and Their Applications, Palermo, 2023. 509\u2013519"},{"key":"4260_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato S, Hric D. Community detection in networks: a user guide. Phys Rep, 2016, 659: 1\u201344","journal-title":"Phys Rep"},{"key":"4260_CR36","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1038\/s42005-024-01635-4","volume":"7","author":"D Shi","year":"2024","unstructured":"Shi D, Shang F, Chen B, et al. Local dominance unveils clusters in networks. Commun Phys, 2024, 7: 170","journal-title":"Commun Phys"},{"key":"4260_CR37","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jnca.2018.02.011","volume":"108","author":"M A Javed","year":"2018","unstructured":"Javed M A, Younis M S, Latif S, et al. Community detection in networks: a multidisciplinary review. J Netw Comput Appl, 2018, 108: 87\u2013111","journal-title":"J Netw Comput Appl"},{"key":"4260_CR38","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1109\/TCYB.2018.2871673","volume":"50","author":"X Zhang","year":"2020","unstructured":"Zhang X, Zhou K, Pan H, et al. A network reduction-based multiobjective evolutionary algorithm for community detection in large-scale complex networks. IEEE Trans Cybern, 2020, 50: 703\u2013716","journal-title":"IEEE Trans Cybern"},{"key":"4260_CR39","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M E J Newman","year":"2004","unstructured":"Newman M E J, Girvan M. Finding and evaluating community structure in networks. Phys Rev E, 2004, 69: 026113","journal-title":"Phys Rev E"},{"key":"4260_CR40","doi-asserted-by":"publisher","first-page":"043027","DOI":"10.1088\/1367-2630\/ad4050","volume":"26","author":"J Mou","year":"2024","unstructured":"Mou J, Dai B, Tan S, et al. The spindle approximation of network epidemiological modeling. New J Phys, 2024, 26: 043027","journal-title":"New J Phys"},{"key":"4260_CR41","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U. A faster algorithm for betweenness centrality. J Math Sociol, 2001, 25: 163\u2013177","journal-title":"J Math Sociol"},{"key":"4260_CR42","doi-asserted-by":"publisher","first-page":"P10011","DOI":"10.1088\/1742-5468\/2010\/10\/P10011","volume":"2010","author":"X Q Cheng","year":"2010","unstructured":"Cheng X Q, Ren F X, Shen H W, et al. Bridgeness: a local index on edge significance in maintaining global connectivity. J Stat Mech, 2010, 2010: P10011","journal-title":"J Stat Mech"},{"key":"4260_CR43","doi-asserted-by":"publisher","first-page":"3747","DOI":"10.1073\/pnas.0400087101","volume":"101","author":"A Barrat","year":"2004","unstructured":"Barrat A, Barth\u00e9lemy M, Pastor-Satorras R, et al. The architecture of complex weighted networks. Proc Natl Acad Sci USA, 2004, 101: 3747\u20133752","journal-title":"Proc Natl Acad Sci USA"},{"key":"4260_CR44","first-page":"1065","volume-title":"Proceedings of IEEE 20th International Conference on Communication Technology (ICCT), Nanning","author":"H Wang","year":"2020","unstructured":"Wang H, Wang C, Shu N, et al. The betweenness identities and their applications. In: Proceedings of IEEE 20th International Conference on Communication Technology (ICCT), Nanning, 2020. 1065\u20131069"},{"key":"4260_CR45","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F. Benchmark graphs for testing community detection algorithms. Phys Rev E, 2008, 78: 046110","journal-title":"Phys Rev E"},{"key":"4260_CR46","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"V D Blondel","year":"2008","unstructured":"Blondel V D, Guillaume J L, Lambiotte R, et al. Fast unfolding of communities in large networks. J Stat Mech, 2008, 2008: P10008","journal-title":"J Stat Mech"},{"key":"4260_CR47","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"U N Raghavan","year":"2007","unstructured":"Raghavan U N, Albert R, Kumara S. Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E, 2007, 76: 036106","journal-title":"Phys Rev E"},{"key":"4260_CR48","first-page":"284","volume-title":"Proceedings of International Symposium on Computer and Information Sciences, Istanbul","author":"P Pons","year":"2005","unstructured":"Pons P, Latapy M. Computing communities in large networks using random walks. In: Proceedings of International Symposium on Computer and Information Sciences, Istanbul, 2005. 284\u2013293"},{"key":"4260_CR49","doi-asserted-by":"publisher","first-page":"6111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman M E J, Moore C. Finding community structure in very large networks. Phys Rev E, 2004, 70: 6111","journal-title":"Phys Rev E"},{"key":"4260_CR50","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom C T. Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA, 2008, 105: 1118\u20131123","journal-title":"Proc Natl Acad Sci USA"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4260-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-024-4260-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4260-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T18:34:48Z","timestamp":1743964488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-024-4260-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,2]]},"references-count":50,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["4260"],"URL":"https:\/\/doi.org\/10.1007\/s11432-024-4260-8","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,2]]},"assertion":[{"value":"28 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"192202"}}