The application of network analysis to criminal intelligence: An assessment of the prospects

Abstract This paper explores the opportunities for the application of network analytic techniques to the problems of criminal intelligence analysis, paying particular attention to the identification of vulnerabilities in different types of criminal organization — from terrorist groups to narcotics supply networks. A variety of concepts from the network analysis literature are considered in terms of the promise they hold for helping law enforcement agencies extract useful information from existing collections of link data. For example, six different notions of “centrality” and the three major notions of “equivalence” are examined for their relevance in revealing the mechanics and vulnerabilities of criminal enterprises.

[1]  M. Hammer.  Predictability of social connections over time , 1979 .

[2]  William H. Panning.  Fitting blockmodels to data , 1982 .

[3]  Douglas H. Harris,et al.  The Application of Link Analysis to Police Intelligence , 1975 .

[4]  M. Zelen,et al.  Rethinking centrality: Methods and examples☆ , 1989 .

[5]  Ronald S. Burt,et al.  DETECTING ROLE EQUIVALENCE , 1990 .

[6]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[7]  Robin J. Wilson.  Introduction to Graph Theory , 1974 .

[8]  K. Fuast.  Comparison of methods for positional analysis: Structural and general equivalences , 1988 .

[9]  Patrick Doreian.  Borgatti toppings on Doreian splits: Reflections on regular equivalence , 1988 .

[10]  Martin G. Everett,et al.  A graph theoretic blocking procedure for social networks , 1982 .

[11]  S. Wasserman,et al.  Stochastic a posteriori blockmodels: Construction and assessment , 1987 .

[12]  P. Doreian.  On the evolution of group and network structure , 1979 .

[13]  Frank Harary,et al.  Graph theory in network analysis , 1983 .

[14]  Roger V. Gould.  Measures of betweenness in non-symmetric networks , 1987 .

[15]  Alden S. Klovdahl,et al.  A note on images of networks , 1981 .

[16]  Katherine Faust.  Comparison of methods for positional analysis: Structural and general equivalences☆ , 1988 .

[17]  S. Seidman,et al.  A note on the potential for genuine cross-fertilization between anthropology and mathematics , 1978 .

[18]  Michael Capobianco,et al.  The strength of a graph and its application to organizational structure , 1979 .

[19]  Noah E. Friedkin,et al.  The development of structure in random networks: an analysis of the effects of increasing network density on five measures of structure , 1981 .

[20]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[21]  Ronald E. Rice,et al.  The NEGOPY network analysis program , 1981 .

[22]  Martin G. Everett,et al.  Calculating role similarities: An algorithm that helps determine the orbits of a graph , 1988 .

[23]  O. Frank.  Sampling and estimation in large social networks , 1978 .

[24]  P. Arabie,et al.  An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling , 1975 .

[25]  S. Borgatti,et al.  The class of all regular equivalences: Algebraic structure and computation☆ , 1989 .

[26]  Myron Wish,et al.  Basic Concepts of Multidimensional Scaling , 1978 .

[27]  L. Sailer.  Structural equivalence: Meaning and definition, computation and application , 1978 .

[28]  H. White,et al.  An algorithm for finding simultaneous homomorphic correspondences between graphs and their image graphs , 1976 .

[29]  H. White,et al.  STRUCTURAL EQUIVALENCE OF INDIVIDUALS IN SOCIAL NETWORKS , 1977 .

[30]  Peter Lupsha,et al.  Steps Toward a Strategic Analysis of Organized Crime , 1980 .

[31]  H. White,et al.  “Structural Equivalence of Individuals in Social Networks” , 2022, The SAGE Encyclopedia of Research Design.