Skip to main content


Fig. 4 | Applied Network Science

Fig. 4

From: Error-correcting decoders for communities in networks

Fig. 4

Performance of the community detection algorithm on the Girvan-Newman (GN) benchmark graph. We plot measure values of the normalized mutual information (NMI) as a function of the mixing parameter μ of the model. a Results of the original version of the algorithm with both starting conditions; b Performance of the reduced version of the algorithm. Both of these are compared with Louvain and Infomap

Back to article page