Abstract
One of the most basic question in the analysis of social networks is to find nodes that are of particular relevance in the network. The answer that emerged in the recent literature is that the importance, or centrality, of a node \(x\) is proportional to the number of nodes that get disconnected from the network when node \(x\) is removed. We show that while in social networks such important nodes lie in their cores (i.e., maximal subgraphs in which all nodes have degree higher than a certain value), this is not necessarily the case in criminal networks. This shows that nodes whose removal affects large portions of the criminal network prefer to operate from network peripheries, thus confirming the intuition of Baker and Faulkner [4]. Our results also highlight structural differences between criminal networks and other social networks, suggesting that classical definitions of importance (or centrality) in a network fail to capture the concept of key players in criminal networks.
This paper has been partially supported by MIUR, the Italian Ministry of Education, University and Research, under Project AMANDA (Algorithmics for MAssive and Networked DAta).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alberich, R., Miro-Julia, J., Rossello, F.: Marvel Universe looks almost like a real social network. eprint arXiv:cond-mat/0202174, February 2002
Ausiello, G., Firmani, D., Laura, L.: Real-time analysis of critical nodes in network cores. In: IWCMC, pp. 42–46. IEEE (2012)
Ausiello, G., Firmani, D., Laura, L.: The (betweenness) centrality of critical nodes and network cores. In: Saracco, R., Ben Letaief, K., Gerla, M., Palazzo, S., Atzori, L. (eds.) 2013 9th International Wireless Communications and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July 1–5, 2013, pp. 90–95. IEEE (2013)
Baker, W.E., Faulkner, R.R.: The social organization of conspiracy: Illegal networks in the heavy electrical equipment industry. American Sociological Review, 837–860 (1993)
Batagelj, V., Mrvar, A.: Pajek datasets (2006)
Batagelj , V., Zaveršnik, M.: Generalized cores. Preprint 799, University of Ljibljana (2002)
Borgatti, S.P.: The key player problem. In: Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers, p. 241. National Academies Press (2003)
Borgatti, S.P.: Centrality and network flow. Social Networks 27(1), 55–71 (2005)
Borgatti, S.P.: Identifying sets of key players in a social network. Computational & Mathematical Organization Theory 12(1), 21–34 (2006)
Duijn, P.A.C., Kashirin, V., Sloot, P.M.A.: The relative ineffectiveness of criminal network disruption. Scientific Reports 4 (2014)
Ferrara, E., De Meo, P., Catanese, S., Fiumara, G.: Detecting criminal organizations in mobile phone networks. Expert Systems with Applications 41(13), 5733–5750 (2014)
Ferrara, E., De Meo, P., Catanese, S., Fiumara, G.: Visualizing criminal networks reconstructed from mobile phone records. In: Hypertext 2014 Extended Proceedings: Late-breaking Results, Doctoral Consortium and Workshop Proceedings of the 25th ACM Hypertext and Social Media Conference (Hypertext 2014), Santiago, Chile, September 1–4, 2014 (2014)
GEPHI sample datasets. https://wiki.gephi.org/index.php/Datasets
GD99 Graph Drawing Conference Contest. http://kam.mff.cuni.cz/conferences/GD99/contest/rules.html
Mainas, E.D.: The analysis of criminal and terrorist organisations as social network structures: a quasi-experimental study. International Journal of Police Science & Management 14(3), 264–282 (2012)
Masys, A.: Networks and network analysis for defence and security. In: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1479–1480. ACM (2013)
Mcauley, J., Leskovec, J.: Discovering social circles in ego networks. ACM Trans. Knowl. Discov. Data 8(1), 4:1–4:28 (2014)
Morselli, C.: Inside criminal networks. Springer (2009)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)
Schwartz, D.M., Rouselle, T.D.A.: Using social network analysis to target criminal networks. Trends in Organized Crime 12(2), 188–207 (2009)
Seidman, S.B.: Network structure and minimum degree. Social Networks 5(5), 269–287 (1983)
SNAP: Stanford Network Analysis Project. http://snap.stanford.edu/
Sparrow, M.K.: The application of network analysis to criminal intelligence: An assessment of the prospects. Social Networks 13(3), 251–274 (1991)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)
Xu, J., Chen, H.: Criminal network analysis and visualization. Commun. ACM 48(6), 100–107 (2005)
Zachary, W.W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Firmani, D., Italiano, G.F., Laura, L. (2015). The (not so) Critical Nodes of Criminal Networks. In: Aiello, L., McFarland, D. (eds) Social Informatics. SocInfo 2014. Lecture Notes in Computer Science(), vol 8852. Springer, Cham. https://doi.org/10.1007/978-3-319-15168-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-15168-7_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15167-0
Online ISBN: 978-3-319-15168-7
eBook Packages: Computer ScienceComputer Science (R0)