Clique percolation community detection for weighted and unweighted networks as well as threshold and plotting functions. For more information see Farkas et al. (2007) tools:::Rd_expr_doi("10.1088/1367-2630/9/6/180") and Palla et al. (2005) tools:::Rd_expr_doi("10.1038/nature03607").
Jens Lange, lange.jens@outlook.com
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
optimizing k and I via threshold-based selection;
see cpThreshold
determines confidence intervals for the entropy threshold based on random permutations of the network; see cpPermuteEntropy
calculates the fuzzy modularity of a (disjoint or non-disjoint division) of a graph into subgraphs; see FuzzyMod
calculates the fuzzy modularity of a (disjoint or non-disjoint division) of a graph into subgraphs for signed weighted networks; see SignedFuzzyMod
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