Post-Processing Partitions to Identify Domains of Modularity Optimization

• Main Authors: William H. Weir, Scott Emmons, Ryan Gibson, Dane Taylor, Peter J. Mucha
• Format: Article
• Language: English
• Published: MDPI AG 2017-08-01
• Series: Algorithms
• Subjects: networks; community detection; modularity; resolution parameter; multilayer networks
• Online Access: https://www.mdpi.com/1999-4893/10/3/93

We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions, CHAMP identifies the domain of modularity optimization for each partition—i.e., the parameter-space domain where it has the largest modularity relative to the input set—discarding partitions with empty domains to obtain the subset of partitions that are “admissible” candidate community structures that remain potentially optimal over indicated parameter domains. Importantly, CHAMP can be used for multi-dimensional parameter spaces, such as those for multilayer networks where one includes a resolution parameter and interlayer coupling. Using the results from CHAMP, a user can more appropriately select robust community structures by observing the sizes of domains of optimization and the pairwise comparisons between partitions in the admissible subset. We demonstrate the utility of CHAMP with several example networks. In these examples, CHAMP focuses attention onto pruned subsets of admissible partitions that are 20-to-1785 times smaller than the sets of unique partitions obtained by community detection heuristics that were input into CHAMP.