Post-Processing Partitions to Identify Domains of Modularity Optimization
Peter Mucha, University of North Carolina-Chapel Hill, Mathematics and Applied Physical Sciences
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. This work, coauthored with William Weir, Scott Emmons, Ryan Gibson and Dane Taylor, has appeared as Algorithms 10, 93 (2017), doi:10.3390/a10030093.
January, 29 2018 | 1:00 pm - 2:00 pm | Gross Hall 230E