{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T00:40:31Z","timestamp":1774658431920,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EPJ Data Sci."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Network dismantling has recently gained interest in the fields of intelligence agencies, anti-corruption analysts and criminal investigators due to its efficiency in disrupting the activity of malicious agents. Here, we apply this approach to detect effective strategies for targeted attacks to Cosa Nostra by analysing the collaboration network of affiliates that participate to the same crimes. We preliminarily detect statistically significant homophily patterns induced by being member of the same mafia syndicate. We also find that links between members belonging to different mafia syndicates play a crucial role in connecting the network into a unique component, confirming the relevance of weak ties. Inspired by this result we investigate the resilience properties of the network under random and targeted attacks with a percolation based toy model. Random removal of nodes results to be quite inefficient in dismantling the network. Conversely, targeted attacks where nodes are removed according to ranked network centralities are significantly more effective. A strategy based on a removal of nodes that takes into account how much a member collaborates with different mafia syndicates has an efficiency similar to the one where nodes are removed according to their degree. The advantage of such a strategy is that it does not require a complete knowledge of the underlying network to be operationally effective.<\/jats:p>","DOI":"10.1140\/epjds\/s13688-022-00323-z","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T13:03:26Z","timestamp":1645621406000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Effective strategies for targeted attacks to the network of Cosa Nostra affiliates"],"prefix":"10.1140","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7658-6939","authenticated-orcid":false,"given":"Federico","family":"Musciotto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Miccich\u00e8","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"323_CR1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"M Newman","year":"2010","unstructured":"Newman M (2010) Networks: an introduction. Oxford University Press, Oxford"},{"key":"323_CR2","volume":"2","author":"S Ressler","year":"2006","unstructured":"Ressler S (2006) Social network analysis as an approach to combat terrorism: past, present, and future research. Homel Secur Aff 2:8","journal-title":"Homel Secur Aff"},{"key":"323_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1504\/IJNVO.2011.037158","volume":"8","author":"P Fellman","year":"2011","unstructured":"Fellman P (2011) The complexity of terrorist networks. Int J Netw Virtual Organ 8:4\u201314","journal-title":"Int J Netw Virtual Organ"},{"key":"323_CR4","volume-title":"Noordin top terrorist network data","author":"N Roberts","year":"2019","unstructured":"Roberts N, Everton S (2019) Noordin top terrorist network data"},{"key":"323_CR5","volume-title":"Inside criminal networks","author":"C Morselli","year":"2008","unstructured":"Morselli C (2008) Inside criminal networks, vol\u00a08. Springer, New York"},{"issue":"3","key":"323_CR6","first-page":"1","volume":"11","author":"G Mastrobuoni","year":"2012","unstructured":"Mastrobuoni G, Patacchini E (2012) Organized crime networks: an application of network analysis techniques to the American mafia. Rev Network Econom 11(3):1\u201343","journal-title":"Rev Network Econom"},{"key":"323_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/SITIS.2014.20","volume-title":"2014 tenth international conference on signal-image technology and Internet-based systems","author":"F Calderoni","year":"2014","unstructured":"Calderoni F, Piccardi C (2014) Uncovering the structure of criminal organizations by community analysis: the infinito network. In: 2014 tenth international conference on signal-image technology and Internet-based systems, pp\u00a0301\u2013308"},{"key":"323_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ins.2016.02.027","volume":"351","author":"S Agreste","year":"2016","unstructured":"Agreste S, Catanese S, De Meo P, Ferrara E, Fiumara G (2016) Network structure and resilience of mafia syndicates. Inf Sci 351:30\u201347","journal-title":"Inf Sci"},{"key":"323_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2020.113666","volume":"161","author":"F Calderoni","year":"2020","unstructured":"Calderoni F, Catanese S, De Meo P, Ficara A, Fiumara G (2020) Robust link prediction in criminal networks: a case study of the Sicilian mafia. Expert Syst Appl 161:1\u201311","journal-title":"Expert Syst Appl"},{"key":"323_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.socnet.2020.07.011","volume":"64","author":"M Tumminello","year":"2021","unstructured":"Tumminello M, Petruzzella F, Ferrara CM (2021) Anagraphical relationships and crime specialization in Cosa Nostra. Soc Netw 64:29\u201341","journal-title":"Soc Netw"},{"key":"323_CR11","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.socnet.2021.08.012","volume":"68","author":"M Catino","year":"2022","unstructured":"Catino M, Rocchi S, Vittucci Marzetti G (2022) The network of interfamily marriages in \u2019Ndrangheta. Soc Netw 68:318\u2013329","journal-title":"Soc Netw"},{"key":"323_CR12","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1093\/comnet\/cny002","volume":"6","author":"HV Ribeiro","year":"2018","unstructured":"Ribeiro HV, Alves LGA, Martins AF, Lenzi EK, Perc M (2018) The dynamical structure of political corruption networks. J\u00a0Complex Netw 6:989\u20131003","journal-title":"J\u00a0Complex Netw"},{"key":"323_CR13","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-47198-1","volume":"9","author":"J Wachs","year":"2019","unstructured":"Wachs J, Kert\u00e9sz J (2019) A network approach to cartel detection in public auction markets. Sci Rep 9:10818","journal-title":"Sci Rep"},{"issue":"2","key":"323_CR14","first-page":"153","volume":"8","author":"M Fazekas","year":"2020","unstructured":"Fazekas M, Wachs J (2020) Corruption and the network structure of public contracting markets across government change. Polit Gov 8(2):153\u2013166","journal-title":"Polit Gov"},{"issue":"7","key":"323_CR15","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1016\/j.techfore.2010.02.007","volume":"77","author":"JP Keller","year":"2010","unstructured":"Keller JP, Desouza KC, Lin Y (2010) Dismantling terrorist networks: evaluating strategic options using agent-based modeling. Technol Forecast Soc Change 77(7):1014\u20131036","journal-title":"Technol Forecast Soc Change"},{"key":"323_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199933662.001.0001","volume-title":"Simulation and similarity","author":"M Weisberg","year":"2013","unstructured":"Weisberg M (2013) Simulation and similarity. Oxford University Press, New York"},{"key":"323_CR17","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barabasi A-L (2000) Error and attack tolerance of complex networks. Nature 406:378\u2013382","journal-title":"Nature"},{"issue":"25","key":"323_CR18","doi-asserted-by":"publisher","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","volume":"85","author":"DS Callaway","year":"2000","unstructured":"Callaway DS, Newman ME, Strogatz SH, Watts DJ (2000) Network robustness and fragility: percolation on random graphs. Phys Rev Lett 85(25):5468\u20135471","journal-title":"Phys Rev Lett"},{"key":"323_CR19","doi-asserted-by":"publisher","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:4626\u20134628","journal-title":"Phys Rev Lett"},{"key":"323_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47","journal-title":"Rev Mod Phys"},{"key":"323_CR21","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos L, Havlin S et al. (2010) Identification of influential spreaders in complex networks. Nat Phys 6:888\u2013893","journal-title":"Nat Phys"},{"issue":"7563","key":"323_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","volume":"524","author":"F Morone","year":"2015","unstructured":"Morone F, Makse HA (2015) Influence maximization in complex networks through optimal percolation. Nature 524(7563):65\u201368","journal-title":"Nature"},{"key":"323_CR23","doi-asserted-by":"publisher","DOI":"10.1038\/srep30062","volume":"6","author":"F Morone","year":"2016","unstructured":"Morone F, Min B, Bo L et al. (2016) Collective influence algorithm to find influencers via optimal percolation in massively large social media. Sci Rep 6:30062","journal-title":"Sci Rep"},{"issue":"44","key":"323_CR24","doi-asserted-by":"publisher","first-page":"12368","DOI":"10.1073\/pnas.1605083113","volume":"113","author":"A Braunstein","year":"2016","unstructured":"Braunstein A, Dall\u2019Asta L, Semerjian G, Zdeborov\u00e1 L (2016) Network dismantling. Proc Natl Acad Sci 113(44):12368\u201312373","journal-title":"Proc Natl Acad Sci"},{"key":"323_CR25","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1038\/nature16948","volume":"530","author":"J Gao","year":"2016","unstructured":"Gao J, Barzel B, Barab\u00e1si AL (2016) Universal resilience patterns in complex networks. Nature 530:307\u2013312","journal-title":"Nature"},{"issue":"14","key":"323_CR26","doi-asserted-by":"publisher","first-page":"6554","DOI":"10.1073\/pnas.1806108116","volume":"116","author":"X Ren","year":"2019","unstructured":"Ren X, Gleinig N, Helbing D, Antulov-Fantulin N (2019) Generalized network dismantling. Proc Natl Acad Sci 116(14):6554\u20136559","journal-title":"Proc Natl Acad Sci"},{"key":"323_CR27","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-25485-8","volume":"12","author":"M Grassia","year":"2021","unstructured":"Grassia M, De Domenico M, Mangioni G (2021) Machine learning dismantling and early-warning signals of disintegration in complex systems. Nat Commun 12:5190","journal-title":"Nat Commun"},{"issue":"10","key":"323_CR28","doi-asserted-by":"publisher","first-page":"4426","DOI":"10.1073\/pnas.1818013116","volume":"116","author":"M Zitnik","year":"2019","unstructured":"Zitnik M, Sosi\u010d R, Feldman MW, Leskovec J (2019) Evolution of resilience in protein interactomes across the tree of life. Proc Natl Acad Sci 116(10):4426\u20134433","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"323_CR29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.026102","volume":"77","author":"RV Sol\u00e9","year":"2008","unstructured":"Sol\u00e9 RV, Rosas-Casals M, Corominas-Murtra B, Valverde S (2008) Robustness of the European power grids under intentional attack. Phys Rev E 77(2):026102","journal-title":"Phys Rev E"},{"key":"323_CR30","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: homophily in social networks. Annu Rev Sociol 27:415\u2013444","journal-title":"Annu Rev Sociol"},{"key":"323_CR31","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"M Granovetter","year":"1973","unstructured":"Granovetter M (1973) The strength of weak ties. Am J Sociol 78:1360\u20131380","journal-title":"Am J Sociol"},{"key":"323_CR32","unstructured":"https:\/\/www.procura.palermo.giustizia.it\/ppaa_massive.aspx"},{"key":"323_CR33","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algorithms 6:161\u2013180","journal-title":"Random Struct Algorithms"},{"key":"323_CR34","first-page":"1","volume":"22","author":"M Heder","year":"2017","unstructured":"Heder M (2017) From NASA to EU: the evolution of the TRL scale in public sector innovation. Innov J 22:1\u201323","journal-title":"Innov J"},{"key":"323_CR35","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1038\/464984a","volume":"464","author":"A Vespignani","year":"2010","unstructured":"Vespignani A (2010) The fragility of interdependency. Nature 464:984\u2013985","journal-title":"Nature"},{"key":"323_CR36","doi-asserted-by":"publisher","DOI":"10.1038\/nature08932","volume":"464","author":"SV Buldyrev","year":"2010","unstructured":"Buldyrev SV, Parshani R, Paul G, Stanley HE, Havlin S (2010) Catastrophic cascade of failures in interdependent networks. Nature 464:1025?1028","journal-title":"Nature"}],"container-title":["EPJ Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-022-00323-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1140\/epjds\/s13688-022-00323-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-022-00323-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T13:05:09Z","timestamp":1645621509000},"score":1,"resource":{"primary":{"URL":"https:\/\/epjdatascience.springeropen.com\/articles\/10.1140\/epjds\/s13688-022-00323-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,23]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["323"],"URL":"https:\/\/doi.org\/10.1140\/epjds\/s13688-022-00323-z","relation":{},"ISSN":["2193-1127"],"issn-type":[{"value":"2193-1127","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,23]]},"assertion":[{"value":"4 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2022","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 no competing interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"11"}}