Finding network communities using modularity density
From MaRDI portal
Abstract: Many real-world complex networks exhibit a community structure, in which the modules correspond to actual functional units. Identifying these communities is a key challenge for scientists. A common approach is to search for the network partition that maximizes a quality function. Here, we present a detailed analysis of a recently proposed function, namely modularity density. We show that it does not incur in the drawbacks suffered by traditional modularity, and that it can identify networks without ground-truth community structure, deriving its analytical dependence on link density in generic random graphs. In addition, we show that modularity density allows an easy comparison between networks of different sizes, and we also present some limitations that methods based on modularity density may suffer from. Finally, we introduce an efficient, quadratic community detection algorithm based on modularity density maximization, validating its accuracy against theoretical predictions and on a set of benchmark networks.
Recommendations
Cites work
- An Efficient Heuristic Procedure for Partitioning Graphs
- Collective dynamics of `small-world' networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Community structure in social and biological networks
- Complex networks: structure and dynamics
- Emergence of Scaling in Random Networks
- Fast and accurate determination of modularity and its effect size
- Fast unfolding of communities in large networks
- Predicting the behavior of techno-social systems
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
- The structure of scientific collaboration networks
Cited in
(33)- Modularity based community detection in hypergraphs
- Community structure detection for directed networks through modularity optimisation
- A mathematical perspective on graph operations and modularity properties
- An efficient community detection algorithm using greedy surprise maximization
- Anti-modularity and anti-community detecting in complex networks
- Modularity density of network community divisions
- A doubly nonnegative relaxation for modularity density maximization
- A density set algorithm for searching communities in complex networks
- Modularity function for community structure based on natural density of networks
- Correlation enhanced modularity-based belief propagation method for community detection in networks
- Modularity Maximization for Graphons
- Efficient modularity density heuristics for large graphs
- A network function-based definition of communities in complex networks
- Correcting for granularity bias in modularity-based community detection methods
- Identifying multi-scale communities in networks by asymptotic surprise
- Modified modularity density maximization and density ratio heuristic
- Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks
- Adding cohesion constraints to models for modularity maximization in networks
- Post-processing hierarchical community structures: quality improvements and multi-scale view
- Robustness of community structure to node removal
- Community detection based on significance optimization in complex networks
- Modularity revisited: a novel dynamics-based concept for decomposing complex networks
- Uncovering the effective interval of resolution parameter across multiple community optimization measures
- Fast and accurate determination of modularity and its effect size
- Maximizing modularity intensity for community partition and evolution
- Density decompositions of networks
- Quantitative measure for community detection in weighted networks
- Network community detection using modularity density measures
- When are networks truly modular?
- A study on modularity density maximization: column generation acceleration and computational complexity analysis
- Community detection in hypernetwork via density-ordered tree partition
- Bad communities with high modularity
- A modularity degree based heuristic community detection algorithm
This page was built for publication: Finding network communities using modularity density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3302501)
