Using an edge-dual graph and k-connectivity to identify strong connections in social networks

How close two entities are in social network is a key factor of SNA (Social Network Analysis). Recent studies of social networks contain a large number of entities and huge number of relations/connections in the networks. Efficiently and accurately analyzing relationships in the network is important component of SNA, especially for law enforcement. In this paper we propose using the edge-dual graph to transform the traditional social network graph to a relation context oriented graph and using modified k-connectivity concepts to evaluate the robustness of the relations. We also describe an implementation of a system based on a 450GB data source, involving 5 million people in Alabama. We use this large scale implementation to evaluate the performance and correctness of the proposal. Our evaluation suggests that using this relation context oriented technology will help to construct a more accurate social network.

[1]  Hsinchun Chen,et al.  Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks , 2004, Decis. Support Syst..

[2]  Henry G. Goldberg,et al.  Restructuring Transactional Data for Link Analysis in the FinCEN AI System , 1998 .

[3]  John Clark,et al.  A First Look at Graph Theory , 1991 .

[4]  D. R. White,et al.  Structural cohesion and embeddedness: A hierarchical concept of social groups , 2003 .

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Ted E. Senator,et al.  Restructuring Databases for Knowledge Discovery by Consolidation and Link Formation , 1995, KDD.

[7]  Edward J. Wegman,et al.  Social networks of author-coauthor relationships , 2008, Comput. Stat. Data Anal..

[8]  Gueorgi Kossinets,et al.  Empirical Analysis of an Evolving Social Network , 2006, Science.

[9]  Hsinchun Chen,et al.  Using Coplink to Analyze Criminal-Justice Data , 2002, Computer.

[10]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  A. Barabasi,et al.  Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.

[13]  Frank Harary,et al.  Graph Theory , 2016 .

[14]  D. Hindman.  The Virtual Community: Homesteading on the Electronic Frontier , 1996 .

[15]  Gang Wang,et al.  Crime data mining: a general framework and some examples , 2004, Computer.

[16]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.