Lesson plan

Group centrality

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 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.

Back to article

Article summary

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 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.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.