Measuring UK crime gangs: a social network problem
This paper describes the output of a study to tackle the problem of gang-related crime in the UK; we present the intelligence and routinely-gathered data available to a UK regional police force, and describe an initial social network analysis of gangs in the Greater Manchester area of the UK between 2000 and 2006. By applying social network analysis techniques, we attempt to detect the birth of two new gangs based on local features (modularity, cliques) and global features (clustering coefficients). Thus for the future, identifying the changes in these can help us identify the possible birth of new gangs (sub-networks) in the social system. Furthermore, we study the dynamics of these networks globally and locally, and have identified the global characteristics that tell us that they are not random graphs—they are small world graphs—implying that the formation of gangs is not a random event. However, we are not yet able to conclude anything significant about scale-free characteristics due to insufficient sample size. A final analysis looks at gang roles and develops further insight into the nature of the different link types, referring to Klerks’ ’third generation’ analysis, as well as a brief discussion of the potential UK policy applications of this work.
Published inSocial Network Analysis and Mining
VersionAM (Accepted Manuscript)
CitationOatley, G. and Crick, T. (2015) 'Measuring UK Crime Gangs: A Social Network Problem', Social Network Analysis and Mining, 5(1), pp.1-16.
Cardiff Met Affiliation
- Cardiff School of Technologies