Differential Betweenness in Complex Networks Clustering
We propose a novel metric for measuring the degree of edge centrality in complex networks clustering, a task commonly called community detection in the analysis of social, biological and information networks. The metric, which has been called differential betweenness, has some unexpected and interesting properties that might help us to create better clustering algorithms. We compare our measure with the shortest path edge betweenness of Girvan and Newman and found that it can be more accurate and robust without requiring the costly recalculation step the other measure needs.
Keywordsgraph clustering betweenness centrality complex networks
- 2.Newman, M.E.J.: Detecting community structure in networks. The European physical journal B, Condensed matter physics 38(2), 321–330 (2004)Google Scholar
- 4.Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74(036104) (2006)Google Scholar
- 5.Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69(026113) (2004)Google Scholar
- 6.Newman, M.J.E.: Fast algorithm for detecting community structure in networks. Physical Review E 69(066133) (2004)Google Scholar