Network community detection using modularity density measures

Abstract

Modularity, since its introduction, has remained one of the most widely used metrics to assess the quality of community structure in a complex network. However the resolution limit problem associated with modularity limits its applicability to networks with community sizes smaller than a certain scale. In the past various attempts have been made to solve this problem. More recently a new metric, modularity density, was introduced for the quality of community structure in networks in order to solve some of the known problems with modularity, particularly the resolution limit problem. Modularity density resolves some communities which are otherwise undetectable using modularity. However, we find that it does not solve the resolution limit problem completely by investigating some cases where it fails to detect expected community structures. To address this problem, we introduce a variant of this metric and show that it further reduces the resolution limit problem, effectively eliminating the problem in a wide range of networks.

References in corpus (17)

• Fast unfolding of communities in large networks
• Modularity and community structure in networks
• Finding community structure in networks using the eigenvectors of matrices
• Cooperative Game Theory Approaches for Network Partitioning
• Benchmark graphs for testing community detection algorithms
• Resolution limit in community detection
• Comparing community structure identification
• Community detection in networks: A user guide
• Modularity and community detection in bipartite networks
• The ground truth about metadata and community detection in networks
• Analysis of the structure of complex networks at different resolution levels
• Narrow scope for resolution-limit-free community detection
• Efficient and exact sampling of simple graphs with given arbitrary degree sequence
• The many facets of community detection in complex networks
• Clique Graphs and Overlapping Communities
• Fast and accurate determination of modularity and its effect size
• Finding network communities using modularity density

Cited by in corpus (7)

• Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar
• A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis
• Reduced network extremal ensemble learning (RenEEL) scheme for community detection in complex networks
• Resolution limit revisited: community detection using generalized modularity density
• LPS-GNN : Deploying Graph Neural Networks on Graphs with 100-Billion Edges
• Towards Modularity Optimization Using Reinforcement Learning to Community Detection in Dynamic Social Networks
• A new measure of modularity density for community detection