group_centrality function

Group Centrality

This function computes the Group Centrality for nodes in a network. Group centrality considers a consistent ranking of each node to be calculated, taking into account the diverse possible synergies among possible groups of vertices.

group_centrality(x, vids = V(x))

Arguments

• x: An igraph or a network object.
• vids: Nodes to be considered in the calculation.

Returns

A numeric vector of centrality values for each node. The length of the vector is equal to the number of nodes in the network.

Examples

data(zachary)

group_centrality(zachary)

References

Michalak, T.P., Aadithya, K.V., Szczepanski, P.L., Ravindran, B. and Jennings, N.R., 2013. Efficient computation of the Shapley value for game-theoretic network centrality. Journal of Artificial Intelligence Research, 46, pp.607-650.

https://www.civilica.com/Paper-IBIS07-IBIS07_127.html

Author(s)

Minoo Ashtiani, Mehdi Mirzaie, Mohieddin Jafari