Skip to contents

Finding all CPM communities in a network/graph Function to determine all CPM-communities in a network (or graph) using the clique percolation method (Palla et al 2005).

Source: R/find_all_cpm_com.R
find_all_cpm_com.Rd

The CPM makes use of complete graphs or cliques in the network. A clique is a group of nodes were all of them are connected. A clique of 3 nodes has 3 edges, while a clique of 4 nodes has already 6 edges. Communities in CPM consist of a large group of connected cliques.

Usage

find_all_cpm_com(graph_input, n_core = 0)

Arguments

graph_input

the graph for find all CPM communities in

n_core

this defaults to 0, if a number larger than 1 is given the community detection is performed using parallel computing

Value

data frame with at least two columns. The first column are the node names and the further columns represent the CPM-communities, with 1 denoting the membership in a community.

References

Palla, G, Derenyi, I, Farkas, I and Vicsek, T. 2005 Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043): 814–818. DOI: https://doi.org/10.1038/nature03607.

Examples

data(hol_rom)
sim_table_hol <- sim_table(hol_rom)
g_hol <- dendro_network(sim_table_hol)
hol_com_cpm_all <- find_all_cpm_com(g_hol)