Skip to main content
. 2011 Apr 29;6(4):e18961. doi: 10.1371/journal.pone.0018961

Figure 10. Test on hierarchical LFR benchmark graphs (unweighted, undirected and without overlapping clusters).

Figure 10

We compare three pairs of partitions: the lowest hierarchical partition found by the algorithm (indicated by Inline graphic) with the set of micro-communities of the benchmark (Fine); the lowest hierarchical partition found by the algorithm with the set of macro-communities of the benchmark (Coarse); the second lowest hierarchical partition found by the algorithm (indicated by Inline graphic) with the set of macro-communities of the benchmark. The corresponding similarities are plotted as a function of Inline graphic, for fixed Inline graphic. There are Inline graphic vertices, the average degree Inline graphic, the maximum degree Inline graphic, the size of the macro-communities lies between Inline graphic and Inline graphic vertices, the size of the micro-communities lies between Inline graphic and Inline graphic vertices. The exponents of the degree and community size distributions are Inline graphic and Inline graphic.