Bad Communities with High Modularity


In this paper we discuss some problematic aspects of Newman’s modularity function QN . Given a graph G, the modularity of G can be written as QN = Qf −Q0, where Qf is the intracluster edge fraction of G and Q0 is the expected intracluster edge fraction of the null model, i.e., a randomly connected graph with same expected degree distribution as G. It… (More)


4 Figures and Tables