Finding groups with maximum betweenness centrality. (4th March 2017)

• Record Type: Journal Article
• Authors: Veremyev, Alexander; Prokopyev, Oleg A.; Pasiliao, Eduardo L.
• Is Part Of: Optimization methods and software. Volume 32:Number 2(2017)
• Page Start: 369
• Page End: 399
• Publication Date: 2017-03-04
• Subjects: betweenness centrality -- bounded-distance betweenness centrality -- group betweenness centrality -- most central groups -- mixed integer programming; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2016.1167892
• Languages: English
• ISSNs: 1055-6788

Abstract

Abstract : In this paper we consider the problem of identifying the most influential (or central ) group of nodes (of some predefined size) in a network. Such a group has the largest value of betweenness centrality or one of its variants, for example, the length-scaled or the bounded-distance betweenness centralities. We demonstrate that this problem can be modelled as a mixed integer program (MIP) that can be solved for reasonably sized network instances using off-the-shelf MIP solvers. We also discuss interesting relations between the group betweenness and the bounded-distance betweenness centrality concepts. In particular, we exploit these relations in an algorithmic scheme to identify approximate solutions for the original problem of identifying the most central group of nodes. Furthermore, we generalize our approach for identification of not only the most central groups of nodes, but also central groups of graph elements that consists of either nodes or edges exclusively, or their combination according to some pre-specified criteria. If necessary, additional cohesiveness properties can also be enforced, for example, the targeted group should form a clique or a κ -club. Finally, we conduct extensive computational experiments with different types of real-life and synthetic network instances to show the effectiveness and flexibility of the proposed framework. Even more importantly, our experiments reveal some interesting insights into the properties of influential groups of graph elements modelled using the maximum betweenness centrality concept or one of its variations.