Group centrality

• Centrality
• Group centrality
• Degree
• Motif
• Clustering
• Degree distribution
• Assortativity
• Distance
• Modularity
• Efficiency

• Topics
• Software
• Network scientists

In graph theory and network analysis, group centrality generalizes the concept of centrality to sets of nodes in a network. Introduced by Everett and Borgatti in 1999, group centrality measures are intended to lift the restriction of usual centrality measures only applying to individual nodes. For instance, the analysis of the centrality or marginalization of certain groups in the network of an organization can be enabled by group centrality measures.

One complication when searching for groups of a given size ${\textstyle k}$ with maximum group centrality arises from the fact that for many measures, this problem is NP-hard. Therefore, heuristics and approximation algorithms are typically used in practical applications.