Novel Edge and Density Metrics for Link Cohesion
arXiv:2003.02999
Abstract
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.
References in corpus (13)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Modularity and community structure in networks
- Community detection in graphs
- Cooperative Game Theory Approaches for Network Partitioning
- Benchmark graphs for testing community detection algorithms
- Analysis of weighted networks
- A tool for filtering information in complex systems
- A Novel Measure of Edge Centrality in Social Networks
- Backbone of complex networks of corporations: The flow of control
- SOCRATES: A System For Scalable Graph Analytics
- GALILEO: A Generalized Low-Entropy Mixture Model
- Trusses and Trapezes: Easily-Interpreted Communities in Social Networks