Skip to main content


Fig. 2 | Applied Network Science

Fig. 2

From: Error-correcting decoders for communities in networks

Fig. 2

Schematic representation of the iterative procedure used by the algorithm to detect multiple communities. In this example, the top graph is a sample network with 4 communities. In the first iteration, the algorithm splits the network perfectly into two equal communities. In the next iteration, each network is split perfectly again. The algorithm terminates because the next iterations do not lead to the discovery of other sub-communities

Back to article page