Fig. 2From: Ensemble clustering for graphs: comparisons and applicationsIn each plot, we consider l cliques of size m=5 where contiguous cliques are linked by 1 to 5 edges, respectively. We compare the number of communities found by the InfoMap (IM), Louvain (ML) and ECG algorithms. The resolution limit phenomenon is clearly seen with the ML algorithm. The IM algorithm fails to find the right number of communities when we increase the number of edges between the cliques, while ECG remains more stableBack to article page