Some remarks on modularity density

Abstract

A "quantitative function" for community detection called modularity density has been proposed by Li, Zhang, Wang, Zhang, and Chen in $[$Phys. Rev. E 77, 036109 (2008)$]$. We study the modularity density maximization problem and we discuss some features of the optimal solution. More precisely, we show that in the optimal solution there can be communities having negative modularity density, and we propose a modification of the original formulation to overcome this issue. Moreover, we show that a clique can be divided into two or more parts when maximizing the modularity density. We also compare the solution found by maximizing the modularity density with that obtained by maximizing the modularity on the Zachary karate club network.

4 pages, 4 figures, 1 table

References in corpus (7)

• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Functional cartography of complex metabolic networks
• Resolution limit in community detection
• The performance of modularity maximization in practical contexts
• Community Detection via Maximization of Modularity and Its Variants