Hierarchical benchmark graphs for testing community detection algorithms

Hierarchical organization is an important, prevalent characteristic of complex systems; to understand their organization, the study of the underlying (generally complex) networks that describe the interactions between their constituents plays a central role. Numerous previous works have shown that many real-world networks in social, biologic, and technical systems present hierarchical organization, often in the form of a hierarchy of community structures. Many artificial benchmark graphs have been proposed to test different community detection methods, but no benchmark has been developed to thoroughly test the detection of hierarchical community structures. In this study, we fill this vacancy by extending the Lancichinetti-Fortunato-Radicchi (LFR) ensemble of benchmark graphs, adopting the rule of constructing hierarchical networks proposed by Ravasz and Barabasi. We employ this benchmark to test three of the most popular community detection algorithms and quantify their accuracy using the traditional mutual information and the recently introduced hierarchical mutual information. The results indicate that the Ravasz-Barabasi-Lancichinetti-Fortunato-Radicchi (RB-LFR) benchmark generates a complex hierarchical structure constituting a challenging benchmark for the considered community detection methods.