{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:15:02Z","timestamp":1766600102071,"version":"3.41.2"},"reference-count":50,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recovery of complex networks is an important issue that has been extensively used in various fields. Much work has been done to measure and improve the stability of complex networks during attacks. Recently, many studies have focused on the network recovery strategies after attack. In many real cases, link retrieval and recovery of critical infrastructures such as transmission network and telecommunications infrastructures are of particular importance and should be prioritized. For example, when a flood disrupts optical fibre communications in transmission networks and paralyzes the network, link retrieval corresponds to the recovery of fibre communications, so that the transmission network communication capacity can be restored at the earliest possible time. So, predicting the appropriate reserved links in a way that the network can be recovered at the lowest cost and fastest time after attacks or interruptions will be critical in a disaster. In this article, different kinds of attack strategies are provided and some retrieval strategies based on link prediction methods are proposed to recover the network after failure and attack. Beside that, a new link prediction method based on the hyperbolic geometry of the complex network is proposed to discover redundant links. The numerical simulations reveal its superiority than other common and recent link prediction-based methods used for network recovery, especially in the case of attacks based on edge betweenness strategy.<\/jats:p>","DOI":"10.1093\/comnet\/cnab007","type":"journal-article","created":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T17:09:46Z","timestamp":1613063386000},"source":"Crossref","is-referenced-by-count":9,"title":["A novel recovery strategy based on link prediction and hyperbolic geometry of complex networks"],"prefix":"10.1093","volume":"9","author":[{"given":"Mahdi","family":"Moshiri","sequence":"first","affiliation":[{"name":"Faculty of Computer Science and Engineering, Shahid Beheshti University,Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farshad","family":"Safaei","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Engineering, Shahid Beheshti University,Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6802-5090","authenticated-orcid":false,"given":"Zeynab","family":"Samei","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"key":"2021091011370730700_B1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s11067-009-9123-x","article-title":"Strategic network restoration","volume":"10","author":"Matisziw,","year":"2010","journal-title":"Netw. Spatial Econ."},{"key":"2021091011370730700_B2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.physa.2017.08.071","article-title":"Complex networks under dynamic repair model","volume":"490","author":"Chaoqi,","year":"2018","journal-title":"Physica A"},{"key":"2021091011370730700_B3","doi-asserted-by":"crossref","first-page":"22834","DOI":"10.1038\/srep22834","article-title":"Recovery of interdependent networks","volume":"6","author":"Di Muro,","year":"2016","journal-title":"Sci. Rep."},{"key":"2021091011370730700_B4","doi-asserted-by":"crossref","first-page":"103208","DOI":"10.1088\/1742-5468\/aa8c36","article-title":"Cascading failure and recovery of spatially interdependent networks","volume":"2017","author":"Hong,","year":"2017","journal-title":"J. Stat. Mech."},{"key":"2021091011370730700_B5","first-page":"1","article-title":"Recovery of infrastructure networks after localised attacks","volume":"6","author":"Hu,","year":"2016","journal-title":"Sci. Rep."},{"key":"2021091011370730700_B6","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1109\/LCOMM.2011.103111.111668","article-title":"Partial network recovery to maximize traffic demand","volume":"15","author":"Yu,","year":"2011","journal-title":"IEEE Commun. Lett."},{"key":"2021091011370730700_B7","doi-asserted-by":"crossref","first-page":"111408","DOI":"10.1115\/1.4034223","article-title":"Engineering resilience quantification and system design implications: a literature survey","volume":"138","author":"Yodo,","year":"2016","journal-title":"J. Mech. Des Transactions of the ASME"},{"key":"2021091011370730700_B8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ress.2015.03.011","article-title":"Resilience assessment of interdependent infrastructure systems: with a focus on joint restoration modeling and analysis","volume":"141","author":"Ouyang,","year":"2015","journal-title":"Reliabil. Eng. Syst. Saf."},{"key":"2021091011370730700_B9","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1080\/15732479.2016.1271813","article-title":"Resilience-based post-disaster recovery strategies for road-bridge networks","volume":"13","author":"Zhang,","year":"2017","journal-title":"Struct. Infrastruct. Eng."},{"key":"2021091011370730700_B10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1038\/nphys2819","article-title":"Spontaneous recovery in dynamical networks","volume":"10","author":"Majdandzic,","year":"2014","journal-title":"Nat. Phys."},{"key":"2021091011370730700_B11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1093\/comnet\/cny025","article-title":"A concise survey of advancements in recovery strategies for resilient complex networks","volume":"7","author":"Afrin,","year":"2019","journal-title":"J. Compl. Netw."},{"key":"2021091011370730700_B12","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Liben-Nowell,","year":"2007","journal-title":"J. Am. Soc. Inform. Sci. Technol"},{"key":"2021091011370730700_B13","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","article-title":"Hierarchical structure and the prediction of missing links in networks","volume":"453","author":"Clauset,","year":"2008","journal-title":"Nature"},{"key":"2021091011370730700_B14","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1109\/TKDE.2018.2801854","article-title":"Link weight prediction using supervised learning methods and its application to yelp layered network","volume":"30","author":"Fu,","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2021091011370730700_B15","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1073\/pnas.1424644112","article-title":"Toward link predictability of complex networks","volume":"112","author":"L\u00fc,","year":"2015","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2021091011370730700_B16","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: a survey","volume":"390","author":"L\u00fc,","year":"2011","journal-title":"Physica A"},{"key":"2021091011370730700_B17","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1093\/comnet\/cnz007","article-title":"Discovering spurious links in multiplex networks based on interlayer relevance","volume":"7","author":"Samei,","year":"2019","journal-title":"J. Compl. Netw."},{"key":"2021091011370730700_B18","doi-asserted-by":"crossref","first-page":"15224","DOI":"10.1073\/pnas.0703740104","article-title":"Extracting the hierarchical organization of complex systems","volume":"104","author":"Sales-Pardo,","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2021091011370730700_B19","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"Airoldi,","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"2021091011370730700_B20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","article-title":"Stochastic blockmodels: first steps","volume":"5","author":"Holland,","year":"1983","journal-title":"Soc. Netw."},{"key":"2021091011370730700_B21","doi-asserted-by":"crossref","first-page":"201","DOI":"10.7551\/mitpress\/7432.003.0009","article-title":"Probabilistic entity-relationship models, PRMs, and plate models","author":"Heckerman,","year":"2007","journal-title":"Introduction to Statistical Relational Learning."},{"article-title":"Statistical models and analysis techniques for learning in relational data (Doctoral dissertation","year":"2006","author":"Neville,","key":"2021091011370730700_B22"},{"key":"2021091011370730700_B23","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1038\/nbt1492","article-title":"A consensus yeast metabolic network reconstruction obtained from a community approach to systems biology","volume":"26","author":"Herrg\u00e5rd,","year":"2008","journal-title":"Nat. Biotechnol."},{"key":"2021091011370730700_B24","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/MIC.2003.1167344","article-title":"Amazon.com recommendations: Item-to-item collaborative filtering","volume":"7","author":"Linden,","year":"2003","journal-title":"IEEE Internet. Comput."},{"key":"2021091011370730700_B25","doi-asserted-by":"crossref","first-page":"2658","DOI":"10.1073\/pnas.0400054101","article-title":"Defining and identifying communities in networks","volume":"101","author":"Radicchi,","year":"2004","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2021091011370730700_B26","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1109\/TCSII.2019.2938894","article-title":"Robustness of link prediction under network attacks","volume":"67","author":"Pu,","year":"2019","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"key":"2021091011370730700_B27","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","article-title":"Hyperbolic geometry of complex networks","volume":"82","author":"Krioukov,","year":"2010","journal-title":"Phys. Rev. E"},{"key":"2021091011370730700_B28","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1038\/nature11459","article-title":"Popularity versus similarity in growing networks","volume":"489","author":"Papadopoulos,","year":"2012","journal-title":"Nature"},{"key":"2021091011370730700_B29","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TNET.2013.2294052","article-title":"Network mapping by replaying hyperbolic growth","volume":"23","author":"Papadopoulos,","year":"2014","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"2021091011370730700_B30","doi-asserted-by":"crossref","first-page":"063022","DOI":"10.1088\/1367-2630\/aac6f9","article-title":"Leveraging the nonuniform PSO network model as a benchmark for performance evaluation in community detection and link prediction","volume":"20","author":"Alessandro,","year":"2018","journal-title":"N. J. Phys."},{"key":"2021091011370730700_B31","doi-asserted-by":"crossref","first-page":"052002","DOI":"10.1088\/1367-2630\/aac06f","article-title":"A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities","volume":"20","author":"Muscoloni,","year":"2018","journal-title":"N. J. Phys."},{"key":"2021091011370730700_B32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-49001-7","article-title":"Application of hyperbolic geometry in link prediction of multiplex networks","volume":"9","author":"Samei,","year":"2019","journal-title":"Sci. Rep."},{"key":"2021091011370730700_B33","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert,","year":"2000","journal-title":"Nature"},{"key":"2021091011370730700_B34","doi-asserted-by":"crossref","first-page":"3682","DOI":"10.1103\/PhysRevLett.86.3682","article-title":"Breakdown of the internet under intentional attack","volume":"86","author":"Cohen,","year":"2001","journal-title":"Phys. Rev. Lett."},{"key":"2021091011370730700_B35","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.physa.2004.04.031","article-title":"Error and attack tolerance of complex networks","volume":"340","author":"Crucitti,","year":"2004","journal-title":"Physica A"},{"key":"2021091011370730700_B36","doi-asserted-by":"crossref","first-page":"e1000494","DOI":"10.1371\/journal.pcbi.1000494","article-title":"Googling food webs: can an eigenvector measure species\u2019 importance for coextinctions","volume":"5","author":"Allesina,","year":"2009","journal-title":"PLoS Comput. Biol."},{"key":"2021091011370730700_B37","doi-asserted-by":"crossref","first-page":"e59613","DOI":"10.1371\/journal.pone.0059613","article-title":"Attack robustness and centrality of complex networks","volume":"8","author":"Iyer,","year":"2013","journal-title":"PLoS One"},{"key":"2021091011370730700_B38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-018-33576-8","article-title":"Modelling self-organization in complex networks via a brain-inspired network automata theory improves link reliability in protein interactomes","volume":"8","author":"Cannistraci,","year":"2018","journal-title":"Sci. Rep."},{"key":"2021091011370730700_B39","first-page":"346916","article-title":"Local-community network automata modelling based on length-three-paths for prediction of complex network structures in protein interactomes, food webs and more","author":"Muscoloni,","year":"2018","journal-title":"bioRxiv"},{"key":"2021091011370730700_B40","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1038\/nphys3812","article-title":"Hidden geometric correlations in real multiplex networks","volume":"12","author":"Kleineberg,","year":"2016","journal-title":"Nat. Phys."},{"article-title":"Minimum curvilinear automata with similarity attachment for network embedding and link prediction in the hyperbolic space","year":"2018","author":"Muscoloni,","key":"2021091011370730700_B41"},{"key":"2021091011370730700_B42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41467-017-01825-5","article-title":"Machine learning meets complex networks via coalescent embedding in the hyperbolic space","volume":"8","author":"Muscoloni,","year":"2017","journal-title":"Nat. Commun."},{"key":"2021091011370730700_B43","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/070710111","article-title":"Power-law distributions in empirical data","volume":"51","author":"Clauset,","year":"2009","journal-title":"SIAM Rev"},{"key":"2021091011370730700_B44","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","article-title":"Community structure in jazz","volume":"6","author":"Gleiser,","year":"2003","journal-title":"Adv. Compl. Syst."},{"key":"2021091011370730700_B45","doi-asserted-by":"crossref","first-page":"4723","DOI":"10.1073\/pnas.0506806103","article-title":"Wiring optimization can relate neuronal structure and function","volume":"103","author":"Chen,","year":"2006","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2021091011370730700_B46","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1093\/comnet\/cnu038","article-title":"MuxViz: a tool for multilayer analysis and visualization of networks","volume":"3","author":"De Domenico,","year":"2015","journal-title":"J. Compl. Netw."},{"article-title":"Why anchorage is not (that) important: binary ties and sample selection","year":"2011","author":"Opsahl,","key":"2021091011370730700_B47"},{"key":"2021091011370730700_B48","doi-asserted-by":"crossref","first-page":"027104","DOI":"10.1103\/PhysRevE.72.027104","article-title":"Community detection in complex networks using extremal optimization","volume":"72","author":"Duch,","year":"2005","journal-title":"Phys. Rev. E"},{"key":"2021091011370730700_B49","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","article-title":"What\u2019s in a crowd? Analysis of face-to-face behavioral networks","volume":"271","author":"Isella,","year":"2011","journal-title":"J. Theor. Biol.,"},{"key":"2021091011370730700_B50","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-642-21863-7_17","article-title":"Matching organizational structure and social network extracted from email communication","volume-title":"International Conference on Business Information Systems","author":"Michalski,","year":"2011"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/9\/4\/cnab007\/40345158\/cnab007.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/9\/4\/cnab007\/40345158\/cnab007.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T01:31:48Z","timestamp":1697851908000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnab007\/6368233"}},"subtitle":[],"editor":[{"given":"Manlio","family":"De Domenico","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,8,1]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,9,7]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnab007","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"type":"print","value":"2051-1310"},{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2021,8,1]]},"published":{"date-parts":[[2021,8,1]]},"article-number":"cnab007"}}