CliquePercolation-package: CliquePercolation: Clique Percolation for Networks

Description Details Author(s) References

Description

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>.

Details

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).

cpAlgorithm()

conducts clique percolation for unweighted and weighted networks; see cpAlgorithm

cpColoredGraph()

plots the original network with nodes colored according to community partition, taking sets of nodes into account; see cpColoredGraph

cpCommunityGraph()

plots the network of communities; see cpCommunityGraph

cpCommunitySizeDistribution()

plots the frequency distribution of the sizes of the communities; see cpCommunitySizeDistribution

cpThreshold()

optimizing k and I via threshold-based selection; see cpThreshold

cpPermuteEntropy()

determines confidence intervals for the entropy threshold based on random permutations of the network; see cpPermuteEntropy

Author(s)

Jens Lange, lange.jens@outlook.com

References

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


CliquePercolation documentation built on May 29, 2021, 5:07 p.m.