Peacock paper

This page provides further information about the paper Finding overlapping communities using disjoint community detection algorithms.

Results of running the experiments reported in Figs. 4-10 of the paper with s=0. This is to prove that the value of parameter s is not critical: it can safely be set to 0, its smallest possible value.

Network in "edges" formatOriginalNotes
netsciencehttp://www-personal.umich.edu/~mejn/netdata/netscience.zipMy version contains only the largest component (n=379).
cond-mat-2003http://www-personal.umich.edu/~mejn/netdata/cond-mat-2003.zipMy version contains only the largest component (n=27519).
blogs  
blogs2  
PGPhttp://deim.urv.cat/~aarenas/data/xarxes/PGP.zip
emailhttp://deim.urv.cat/~aarenas/data/xarxes/email.zip
word_associationhttp://www.cfinder.org/ 
protein-proteinhttp://www.cfinder.org/ 

Other networks used

Software

The program used for the experiments in the paper is available here:

However, you are advised to use the latest version.