Maximum modular graphs
- 122 Downloads
Modularity has been explored as an important quantitative metric for community and cluster detection in networks. Finding the maximum modularity of a given graph has been proven to be NP-complete and therefore, several heuristic algorithms have been proposed. We investigate the problem of finding the maximum modularity of classes of graphs that have the same number of links and/or nodes and determine analytical upper bounds. Moreover, from the set of all connected graphs with a fixed number of links and/or number of nodes, we construct graphs that can attain maximum modularity, named maximum modular graphs. The maximum modularity is shown to depend on the residue obtained when the number of links is divided by the number of communities. Two applications in transportation networks and data-centers design that can benefit of maximum modular partitioning are proposed.
KeywordsStatistical and Nonlinear Physics
- 2.U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, D. Wagner, in Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2007), Vol. 4769, Chap. 12, pp. 121–132.Google Scholar
- 12.P. Van Mieghem, Graph Spectra for Complex Networks (Cambridge University Press, Cambridge, 2010)Google Scholar
- 16.A. Cauchy, Cours d’Analyse de l’Ecole Royale Polytechnique: Analyse Algébrique. Debure (reissued by Cambridge University Press, Cambridge, 2009), p. 1821Google Scholar