Using an Edge-dual Graph and k-connectivity to Identify Strong Connections in Social Networks

Using an Edge-dual Graph and k-connectivity to Identify Strong Connections in Social Networks

• March 1st, 2008
• in

The goal of this paper is to use edge-dual graph transformation techniques to improve the accuracy of social network analysis (SNA). SNA is used in law enforcement to determine if relationships exist among potential suspects, and to identify just what those relationships might be. Relationships can be family, friends, past associates, cell mates and even prison enemies. The paper presented results that showed that this transformation had a very high potential for increasing the accuracy of relationship search routines.