Performance of different module finding procedures on simulated data. Co-clustering: clustering based on the distance metric of . K-Means: clustering of the similarity data. Random: random sampling of connected subnetworks matched in size and number to the planted components. The quality of solutions produced by the different procedures is evaluated by the Jaccard coefficient, (a) Performance as a function of the distance between the means of the mates and the non-mates distributions (μ
). (b) Performance as a function of the fraction of front nodes (p
). (c) Performance as a function of planted component size (k).