Skip to main content
. 2007 Apr 23;104(18):7327–7331. doi: 10.1073/pnas.0611034104

Fig. 4.

Fig. 4.

Zachary's karate club network (29) partitioned into two modules based on the maximum mutual information with (A) and without (B) the link constraint. The partitioning with more links within modules than between modules in A clusters closely connected nodes together, and the unconstrained partitioning in B clusters nodes with similar roles together. The stars and circles represent the two observed groups in A, and the stars represent the five nodes with highest degree in B.