Novel Edge and Density Metrics for Link Cohesion
This work addresses graph analysis challenges for researchers in network science, but it appears incremental as it builds on existing concepts like edge scoring and community detection.
The paper tackled the problem of measuring edge strength in complex graphs by introducing a new link cohesion metric and a graph density measure, which were used for community detection through graph sparsification and shown to have loose correlation with edge betweenness centrality.
We present a new metric of link cohesion for measuring the strength of edges in complex, highly connected graphs. Link cohesion accounts for local small hop connections and associated node degrees and can be used to support edge scoring and graph simplification. We also present a novel graph density measure to estimate the average cohesion across nodes. Link cohesion and the density measure are employed to demonstrate community detection through graph sparsification by maximizing graph density. Link cohesion is also shown to be loosely correlated with edge betweenness centrality.