Maximizing Modularity is hard
U. Brandes, D. Delling, M. Gaertler, R. Goerke, M. Hoefer, Z. Nikoloski, D. Wagner
Abstract
Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to emphasize the plausibility of results, none of these algorithms has been shown to actually compute optimal partitions. We here settle the unknown complexity status of modularity maximization by showing that the corresponding decision version is NP-complete in the strong sense. As a consequence, any efficient, i.e. polynomial-time, algorithm is only heuristic and yields suboptimal partitions on many instances.
Create a lesson
Related papers
Multi-fidelity Monte Carlo estimation of floor response spectra under combined seismic and structural parameter uncertainties
Nils Baillie, Baptiste Kerleguer, Cyril Feau et al.
Parameter inference from a non-stationary unknown process using statistical feature-based slow feature analysis
Kieran S. Owens, Masako Tamaki, Ben D. Fulcher
A Probability Model for Pentagonal Prism Dice Rolls
Paul R. Hurst, J. Naleo Hyde
Geometry-native machine learning reconstruction of DSMC moment fields with support monitoring
Ehsan Roohi
Multivariate amplitude analysis of the cascade particle decays based on the Nearest Neighbors fitting
I. V. Yeletskikh, A. O. Vasyukov
The geometry of uncertainty decomposition in profile-likelihood fits
Rafael Coelho Lopes de Sá