Hierarchical benchmark graphs for testing community detection algorithms
Zhao Yang, Juan I. Perotti, Claudio J. Tessone

TL;DR
This paper introduces a new hierarchical benchmark graph model based on the LFR ensemble and Ravasz-Barabási's construction, enabling rigorous testing of community detection algorithms' ability to identify hierarchical structures.
Contribution
It extends the LFR benchmark to include hierarchical structures using Ravasz-Barabási's rule, providing a novel tool for evaluating hierarchical community detection methods.
Findings
The RB-LFR benchmark creates complex hierarchical networks.
Three popular community detection algorithms were tested.
Hierarchical Mutual Information effectively measures detection accuracy.
Abstract
Hierarchical organization is an important, prevalent characteristic of complex systems; in order 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 in order to test different community detection methods, but no benchmark has been developed to throughly 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 Barab\'asi. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
