FIG. 7. Typical outcome of the greedy multilevel agglomerative algorithm described in the text, for a network sampled from the overlapping model with B ¼ 4 . The different panels show the progression of the algorithm from B ¼ 2 E to B ¼ 4 . The panel on the lower right shows the planted partition used to generate the