Community structure detection for directed networks through modularity optimisation
Summary: Networks constitute powerful means of representing various types of complex systems, where nodes denote the system entities and edges express the interactions between the entities. An important topological property in complex networks is community structure, where the density of edges within subgraphs is much higher than across different subgraphs. Each of these subgraphs forms a community (or module). In literature, a metric called modularity is defined that measures the quality of a partition of nodes into different mutually exclusive communities. One means of deriving community structure is modularity maximisation. In this paper, a novel mathematical programming-based model, DiMod, is proposed that tackles the problem of maximising modularity for directed networks.
- Finding community structures in complex networks using mixed integer optimisation
- Modularity-maximizing graph communities via mathematical programming
- Toward optimal community detection: from trees to general weighted networks
- A DC Programming Approach for Finding Communities in Networks
- Finding network communities using modularity density
- Clustering and community detection in directed networks: a survey
- Collective dynamics of `small-world' networks
- Complex networks: structure and dynamics
- Finding community structures in complex networks using mixed integer optimisation
- Improving heuristics for network modularity maximization using an exact algorithm
- On Finding Graph Clusterings with Maximum Modularity
- An algorithm J-SC of detecting communities in complex networks
- Collaboration mechanisms and community detection of statisticians based on ERGMs and \(k\)NN-walktrap
- Comprehensive decomposition optimization method for locating key sets of commenters spreading conspiracy theory in complex social networks
- Direction matters in complex networks: a theoretical and applied study for greedy modularity optimization
- Direction recovery in undirected social networks based on community structure and popularity
- Generation of arbitrary two-point correlated directed networks with given modularity
- Explore of the fuzzy community structure integrating the directed line graph and likelihood optimization
- Modularity of directed networks: cycle decomposition approach
- Detecting communities under constraints in directed acyclic networks
- Clustering and community detection in directed networks: a survey
- Algorithm for detecting module structure in complex networks based on node type
- Detecting community structure in directed networks via multiple eigenvectors
- A framework of mapping undirected to directed graphs for community detection
- Modularity based community detection in hypergraphs
- Group Definition Based on Flow in Community Detection
- Network Embedding-based Directed Community Detection with Unknown Community Number
- Finding community structures in complex networks using mixed integer optimisation
This page was built for publication: Community structure detection for directed networks through modularity optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736848)
