- In the paper Benchmark graphs for testing community detection algorithms we introduced a new class of artificial networks that pose a far harder test to community detection algorithms. The new benchmark is an extension of the benchmark by Girvan and Newman. In the latter, the nodes have the same degree and the communities have equal size. Here, the distributions of nodes' degree and community size are power laws, with tunable exponents. The code to build the new benchmark graphs can be downloaded here. Instructions on how to use the code are included in the package.
