| communitycent {centiserve} | R Documentation |
Find the community-based node centrality
Description
This function returns community-based node centrality measures.
Usage
communitycent(graph, vids = V(graph), type = c("commweight", "commconn"),
normalise = TRUE)
Arguments
graph |
The input graph as igraph object |
vids |
Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices. |
type |
A character string naming the community centrality measure. Can be one of "commweight" or "commconn" |
normalise |
Logical, whether to normalise community connectedness for "commconn". Defaults to TRUE. Will be ignored for "commweight". |
Details
The "commweight" type 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:
C_{c}(i)=\sum_{i \in j}^{N}(1 - \frac{1}{m}\sum_{i \in j\cap k}^{m}S(j,k))
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.
The "commconn" type 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:
C_{c}(i)=\sum_{i \in j}^{N}e_{ij} \frac{\check{e}_{B(j)}}{\check{e}_{W(j)}}
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.
For more detail see 'linkcomm' package and Community Centrality
Value
A numeric vector contaning the centrality scores for the selected vertices.
Author(s)
Mahdi Jalili m_jalili@farabi.tums.ac.ir
Code obtained from 'linkcomm' package.
References
Kalinka, Alex T., and Pavel Tomancak. "linkcomm: an R package for the generation, visualization, and analysis of link communities in networks of arbitrary size and type." Bioinformatics 27.14 (2011).
Examples
## Not run:
g <- random.graph.game(20, 3/10)
communitycent(g)
## End(Not run)