getCommunityCentrality function

Calculate Community Centrality Measures for Nodes

This function returns community-based node centrality measures.

getCommunityCentrality(x, nodes = names(x$numclusters), type = "commweight", 
                       normalise = TRUE)

Arguments

• x: An object of class linkcomm.
• nodes: A character vector giving the names of nodes for calculating community centrality scores. Defaults to all nodes.
• type: A character string naming the community centrality measure. Can be one of "commweight" or "commconn" (see Details below). Defaults to "commweight".
• normalise: Logical, whether to normalise community connectedness for "commconn". Defaults to TRUE. Will be ignored for "commweight".

Details

Community-based measures of node centrality provide an alternative to classic measures of node centrality. "commweight" weights each community that a node belongs to by how similar that community is to each of the other communities to which the node also belongs. For node i the community centrality is

where the main sum is over the $N$ communities to which node $i$ belongs, and $S(j,k)$ refers to the similarity between community $j$ and $k$, calculated as the Jaccard coefficient for the number of shared nodes between each community pair, and this is averaged over the $m$ communities paired with community $j$ and in which node $i$ jointly belongs. "commconn" weights each community that a node belongs to by how many connections the community forms outside of itself relative to how many connections the community has within itself (the inverse of modularity), so that nodes that belong to more highly connecting communitites will receive a higher community centrality score. For node i the community centrality is

where $e_{ij}$ is the number of edges node i has in community j, $\check{e}_{B(j)}=\frac{e_{B(j)}}{n_{j}\bar{d}}$ is the number of edges community j makes outside of itself normalised by the number of nodes in community j multiplied by the average degree in the network, and $\check{e}_{W(j)}=\frac{e_{W(j)}}{n(n-1)/2}$ is the number of edges within community j normalised by the total number possible.

Returns

A named numerical vector where the names are node names and the numbers are community centrality measures.

References

Kalinka, A.T. and Tomancak, P. (2011). linkcomm: an R package for the generation, visualization, and analysis of link communities in networks of arbitrary size and type. Bioinformatics 27 , 2011-2012.

Author(s)

Alex T. Kalinka alex.t.kalinka@gmail.com

See Also

getCommunityConnectedness

Examples

## Generate graph and extract link communities.
g <- swiss[,3:4]
lc <- getLinkCommunities(g)

## Calculate community centrality.
cc <- getCommunityCentrality(lc)