Clique percolation community detection for weighted and unweighted networks as well as threshold and plotting functions. For more information see Farkas et al. (2007) <doi:10.1088/1367-2630/9/6/180> and Palla et al. (2005) <doi:10.1038/nature03607>.
CliquePercolation includes a number of functions for detecting and interpreting overlapping network communities. It is based on research by Palla et al. (2005) and Farkas et al. (2007).
conducts clique percolation for unweighted and weighted networks; see cpAlgorithm
plots the original network with nodes colored according to community partition, taking sets of nodes into account; see cpColoredGraph
plots the network of communities; see cpCommunityGraph
plots the frequency distribution of the sizes of the communities; see cpCommunitySizeDistribution
I via threshold-based selection;
determines confidence intervals for the entropy threshold based on random permutations of the network; see cpPermuteEntropy
Jens Lange, email@example.com
Farkas, I., Abel, D., Palla, G., & Vicsek, T. (2007). Weighted network modules. New Journal of Physics, 9, 180-180. http://doi.org/10.1088/1367-2630/9/6/180
Palla, G., Derenyi, I., Farkas, I., & Vicsek, T. (2005). Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435, 814-818. http://doi.org/10.1038/nature03607
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.