🤖 AI Summary
Existing benchmark graph models (e.g., LFR) lack analytical tractability, fail to model outliers, and do not support overlapping communities—limiting their fidelity for evaluating community detection in realistic, noisy, and overlapping settings. Method: We propose a novel stochastic graph generation model grounded in the ABC (Affiliation-Block-Community) framework. It jointly models power-law degree distributions, power-law community size distributions, outliers, and overlapping communities, enabling closed-form analysis and precise parameter control. Innovations include an extended membership sampling mechanism and a principled outlier injection strategy. Contribution/Results: This is the first model to simultaneously capture all four key structural features of real-world networks. Generated graphs exhibit high structural fidelity and efficient generation scalability, significantly outperforming LFR in both realism and computational efficiency. The model establishes a more robust, fair, and reproducible benchmark for evaluating community detection algorithms under noisy and overlapping conditions.
📝 Abstract
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs similar to the well-known LFR model but it is faster, more interpretable, and can be investigated analytically. In this paper, we use the underlying ingredients of the ABCD model, and its generalization to include outliers (ABCD+$o$), and introduce another variant that allows for overlapping communities, ABCD+$o^2$.