{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:53:30Z","timestamp":1768258410234,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"TechnoPro Holdings, Inc."},{"name":"Next Generation Artificial Intelligence Research Center, the University of Toky"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Real-world networks often encounter disruptions that can have profound societal impacts. Therefore, enhancing network robustness against random failures and targeted attacks is crucial. Bypass rewiring, in which adjacent nodes are immediately reconnected following node removal, has been proposed as a promising method for enhancing network robustness. However, this method typically requires numerous bypass links and incurs significant costs. In this paper, we propose link-limited bypass rewiring, in which bypass links are reconnected stochastically. Additionally, we investigate the relationship between the number of bypass links and robustness improvement. Our findings, which are based on analytical and numerical results, reveal a tradeoff relationship between the number of added bypass links and robustness enhancement. Notably, preferentially reconnecting high-degree nodes was found to be effective for improving robustness. These insights can inform the design of resilient systems in real-world networks, offering strategies for enhancing robustness against node removal.<\/jats:p>","DOI":"10.1007\/s41109-024-00624-4","type":"journal-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T09:02:12Z","timestamp":1716454932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Link-limited bypass rewiring for enhancing the robustness of complex networks"],"prefix":"10.1007","volume":"9","author":[{"given":"Masaki","family":"Chujyo","sequence":"first","affiliation":[]},{"given":"Fujio","family":"Toriumi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"issue":"3","key":"624_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1093\/comnet\/cny025","volume":"7","author":"T Afrin","year":"2019","unstructured":"Afrin T, Yodo N (2019) A concise survey of advancements in recovery strategies for resilient complex networks. J Complex Netw 7(3):393\u2013420","journal-title":"J Complex Netw"},{"issue":"1","key":"624_CR2","doi-asserted-by":"crossref","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":"6794","key":"624_CR3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barab\u00e1si A-L (2000) Error and attack tolerance of complex networks. Nature 406(6794):378\u2013382","journal-title":"Nature"},{"issue":"5439","key":"624_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"3\u20134","key":"624_CR5","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.physa.2005.03.040","volume":"357","author":"A Beygelzimer","year":"2005","unstructured":"Beygelzimer A, Grinstein G, Linsker R, Rish I (2005) Improving network robustness by edge modification. Physica A 357(3\u20134):593\u2013612","journal-title":"Physica A"},{"key":"624_CR6","doi-asserted-by":"crossref","first-page":"1395","DOI":"10.1007\/s10618-015-0447-5","volume":"30","author":"H Chan","year":"2016","unstructured":"Chan H, Akoglu L (2016) Optimizing network robustness by edge rewiring: a general framework. Data Min Knowl Discov 30:1395\u20131425","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"624_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41109-020-00343-6","volume":"6","author":"M Chujyo","year":"2021","unstructured":"Chujyo M, Hayashi Y (2021) A loop enhancement strategy for network robustness. Appl Netw Sci 6(1):1\u201313","journal-title":"Appl Netw Sci"},{"issue":"10","key":"624_CR8","doi-asserted-by":"crossref","first-page":"0276733","DOI":"10.1371\/journal.pone.0276733","volume":"17","author":"M Chujyo","year":"2022","unstructured":"Chujyo M, Hayashi Y (2022) Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency. PLoS ONE 17(10):0276733","journal-title":"PLoS ONE"},{"issue":"21","key":"624_CR9","doi-asserted-by":"crossref","first-page":"4626","DOI":"10.1103\/PhysRevLett.85.4626","volume":"85","author":"R Cohen","year":"2000","unstructured":"Cohen R, Erez K, Ben-Avraham D, Havlin S (2000) Resilience of the internet to random breakdowns. Phys Rev Lett 85(21):4626","journal-title":"Phys Rev Lett"},{"issue":"16","key":"624_CR10","doi-asserted-by":"crossref","first-page":"3682","DOI":"10.1103\/PhysRevLett.86.3682","volume":"86","author":"R Cohen","year":"2001","unstructured":"Cohen R, Erez K, Ben-Avraham D, Havlin S (2001) Breakdown of the internet under intentional attack. Phys Rev Lett 86(16):3682","journal-title":"Phys Rev Lett"},{"issue":"4","key":"624_CR11","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1103\/RevModPhys.80.1275","volume":"80","author":"SN Dorogovtsev","year":"2008","unstructured":"Dorogovtsev SN, Goltsev AV, Mendes JF (2008) Critical phenomena in complex networks. Rev Mod Phys 80(4):1275","journal-title":"Rev Mod Phys"},{"issue":"5","key":"624_CR12","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.78.051105","volume":"78","author":"AV Goltsev","year":"2008","unstructured":"Goltsev AV, Dorogovtsev SN, Mendes JF (2008) Percolation on correlated networks. Phys Rev E 78(5):051105","journal-title":"Phys Rev E"},{"issue":"1","key":"624_CR13","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1017\/nws.2017.25","volume":"6","author":"Y Hayashi","year":"2018","unstructured":"Hayashi Y (2018) A new design principle of robust onion-like networks self-organized in growth. Netw Sci 6(1):54\u201370","journal-title":"Netw Sci"},{"issue":"1","key":"624_CR14","doi-asserted-by":"crossref","first-page":"24522","DOI":"10.1038\/srep24522","volume":"6","author":"F Hu","year":"2016","unstructured":"Hu F, Yeung CH, Yang S, Wang W, Zeng A (2016) Recovery of infrastructure networks after localised attacks. Sci Rep 6(1):24522","journal-title":"Sci Rep"},{"issue":"1","key":"624_CR15","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TSMC.2018.2874822","volume":"51","author":"Y Huang","year":"2018","unstructured":"Huang Y, Wu J, Ren W, Chi KT, Zheng Z (2018) Sequential restorations of complex networks after cascading failures. IEEE Trans Syst Man Cybern Syst 51(1):400\u2013411","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"624_CR16","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"},{"issue":"2","key":"624_CR17","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1093\/comnet\/cnt010","volume":"1","author":"VH Louzada","year":"2013","unstructured":"Louzada VH, Daolio F, Herrmann HJ, Tomassini M (2013) Smart rewiring for network robustness. J Complex Netw 1(2):150\u2013159","journal-title":"J Complex Netw"},{"issue":"2","key":"624_CR18","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.94.022308","volume":"94","author":"S Mizutaka","year":"2016","unstructured":"Mizutaka S, Tanizawa T (2016) Robustness analysis of bimodal networks in the whole range of degree correlation. Phys Rev E 94(2):022308","journal-title":"Phys Rev E"},{"issue":"20","key":"624_CR19","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"ME Newman","year":"2002","unstructured":"Newman ME (2002) Assortative mixing in networks. Phys Rev Lett 89(20):208701","journal-title":"Phys Rev Lett"},{"key":"624_CR20","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"M Newman","year":"2018","unstructured":"Newman M (2018) Networks. Oxford University Press, Oxford"},{"issue":"2","key":"624_CR21","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman ME, Strogatz SH, Watts DJ (2001) Random graphs with arbitrary degree distributions and their applications. Phys Rev E 64(2):026118","journal-title":"Phys Rev E"},{"issue":"2","key":"624_CR22","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.94.022310","volume":"94","author":"J Park","year":"2016","unstructured":"Park J, Hahn SG (2016) Bypass rewiring and robustness of complex networks. Phys Rev E 94(2):022310","journal-title":"Phys Rev E"},{"key":"624_CR23","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.physa.2018.09.073","volume":"515","author":"J Park","year":"2019","unstructured":"Park J, Shin S, Hahn SG (2019) Bypass rewiring and extreme robustness of Eulerian networks. Physica A 515:324\u2013331","journal-title":"Physica A"},{"issue":"2","key":"624_CR24","doi-asserted-by":"crossref","first-page":"87986","DOI":"10.1371\/journal.pone.0087986","volume":"9","author":"W Quattrociocchi","year":"2014","unstructured":"Quattrociocchi W, Caldarelli G, Scala A (2014) Self-healing networks: redundancy and structure. PLoS ONE 9(2):87986","journal-title":"PLoS ONE"},{"issue":"10","key":"624_CR25","doi-asserted-by":"crossref","first-page":"3838","DOI":"10.1073\/pnas.1009440108","volume":"108","author":"CM Schneider","year":"2011","unstructured":"Schneider CM, Moreira AA, Andrade JS Jr, Havlin S, Herrmann HJ (2011) Mitigation of malicious attacks on networks. Proc Natl Acad Sci 108(10):3838\u20133841","journal-title":"Proc Natl Acad Sci"},{"key":"624_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjb\/e2016-70551-2","volume":"90","author":"W Sun","year":"2017","unstructured":"Sun W, Zeng A (2017) Target recovery in complex networks. Eur Phys J B 90:1\u20136","journal-title":"Eur Phys J B"},{"issue":"4","key":"624_CR27","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.85.046109","volume":"85","author":"T Tanizawa","year":"2012","unstructured":"Tanizawa T, Havlin S, Stanley HE (2012) Robustness of onion like correlated networks against targeted attacks. Phys Rev E 85(4):046109","journal-title":"Phys Rev E"},{"issue":"6684","key":"624_CR28","doi-asserted-by":"crossref","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. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"2","key":"624_CR29","volume":"84","author":"Z-X Wu","year":"2011","unstructured":"Wu Z-X, Holme P (2011) Onion structure and network robustness. Phys Rev E 84(2):026106","journal-title":"Phys Rev E"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00624-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-024-00624-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00624-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T09:21:13Z","timestamp":1716456073000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-024-00624-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,23]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["624"],"URL":"https:\/\/doi.org\/10.1007\/s41109-024-00624-4","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,23]]},"assertion":[{"value":"4 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"17"}}