Abstract
One popular approach to access the importance/influence of a group of nodes in a network is based on the notion of centrality. For a given group, its group betweenness centrality is computed, first, by evaluating a ratio of shortest paths between each node pair in a network that are “covered” by at least one node in the considered group, and then summing all these ratios for all node pairs. In this paper we study the problem of finding the most influential (or central) group of nodes (of some predefined size) in a network based on the concept of betweenness centrality. One known approach to solve this problem exactly relies on using a linear mixed-integer programming (linear MIP) model. However, the size of this MIP model (with respect to the number of variables and constraints) is exponential in the worst case as it requires computing all (or almost all) shortest paths in the network. We address this limitation by considering randomized approaches that solve a single linear MIP (or a series of linear MIPs) of a much smaller size(s) by sampling a sufficiently large number of shortest paths. Some probabilistic estimates of the solution quality provided by our approaches are also discussed. Finally, we illustrate the performance of our methods in a computational study.
Similar content being viewed by others
Notes
A multiset is a generalization of a set and allows multiple instances of each of its elements.
The additional datasets generated during and/or analysed during the current study are available from the corresponding author on request.
References
Akgün, M.K., Tural, M.K.: k-step betweenness centrality. Comput. Math. Organ. Theory 26(1), 55–87 (2020)
Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)
Angriman, E., van der Grinten, A., Bojchevski, A., Zügner, D., Günnemann, S., Meyerhenke, H.: Group centrality maximization for large-scale graphs. In: 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, pp. 56–69 (2020)
Borassi, M., Natale, E.: Kadabra is an adaptive algorithm for betweenness via random approximation. ACM J. Exp. Algorithm. 24(1.2), 1–35 (2019)
Borgatti, S., Everett, M., Johnson, J.: Analyzing Social Networks. SAGE Publications Limited (2013)
Borgatti, S.P., Everett, M.G.: A graph-theoretic perspective on centrality. Social Netw. 28(4), 466–484 (2006)
Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163–177 (2001)
Chou, C.-H., Sheu, P., Hayakawa, M., Kitazawa, A.: Querying large graphs in biomedicine with colored graphs and decomposition. J. Biomed. Inform. 108, 103503 (2020)
Dinler, D., Tural, M.K.: Faster computation of successive bounds on the group betweenness centrality. Networks 71(4), 358–380 (2018)
Dolev, S., Elovici, Y., Puzis, R., Zilberman, P.: Incremental deployment of network monitors based on group betweenness centrality. Inf. Process. Lett. 109(20), 1172–1176 (2009)
Everett, M., Borgatti, S.: The centrality of groups and classes. J. Math. Sociol. 23(3), 181–201 (1999)
Everett, M.G., Borgatti, S.P.: Extending centrality. Models Methods Soc. Netw. Anal. 35(1), 57–76 (2005)
Fink, M., Spoerhase, J.: Maximum betweenness centrality: approximability and tractable cases. In: International Workshop on Algorithms and Computation. Springer, pp. 9–20 (2011)
Fronzetti Colladon, A., Guardabascio, B., Innarella, R.: Using social network and semantic analysis to analyze online travel forums and forecast tourism demand. Decis. Support Syst. 123, 113075 (2019)
Ganesana, B., Ramanb, S., Ramalingamb, S., Turanc, M.E., Bacak-Turanc, G.: Vulnerability of sewer network-graph theoretic approach. Desalination Water Treat. 196, 370–376 (2020)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (2002)
Guan, J., Yan, Z., Yao, S., Xu, C., Zhang, H.: GBC-based caching function group selection algorithm for SINET. J. Netw. Comput. Appl. 85, 56–63 (2017)
Gurobi Optimization, L.: Gurobi Optimizer Reference Manual (2021)
Hagberg, A., Swart, P., Chult, D.S.: Exploring network structure, dynamics, and function using network. Technical Report, Los Alamos National Lab. (LANL), Los Alamos (2008)
Jackson, M.: Social and Economic Networks. Princeton University Press (2010)
Jacob, R., Koschützki, D., Lehmann, K.A., Peeters, L., Tenfelde-Podehl, D.: Algorithms for Centrality Indices, chapter 4, Springer, Berlin, pp. 62–82 (2005)
Kleywegt, A.J., Shapiro, A., Homem-de Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479–502 (2002)
Kolaczyk, E.D., Chua, D.B., Barthélemy, M.: Group betweenness and co-betweenness: inter-related notions of coalition centrality. Soc. Netw. 31(3), 190–203 (2009)
Mahmoody, A., Tsourakakis, C.E., Upfal, E.: Scalable betweenness centrality maximization via sampling. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1765–1773 (2016)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press (2017)
Newman, M.: Networks: An introduction. Oxford University Press (2010)
Puzis, R., Elovici, Y., Dolev, S.: Fast algorithm for successive computation of group betweenness centrality. Phys. Rev. E 76, 056709 (2007)
Puzis, R., Tubi, M., Elovici, Y., Glezer, C., Dolev, S.: A decision support system for placement of intrusion detection and prevention devices in large-scale networks. ACM Trans. Model. Comput. Simul. 22(1), 1–26 (2011)
Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Discov. 30(2), 438–475 (2016)
Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http://networkrepository.com. Accessed 2 Nov 2021
Shapiro, A., Dentcheva, D., Ruszczyński, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM (2014)
Tubi, M., Puzis, R., Elovici, Y.: Deployment of DNIDS in social networks. In: 2007 IEEE Intelligence and Security Informatics. IEEE, pp. 59–65 (2007)
Veremyev, A., Prokopyev, O.A., Pasiliao, E.L.: Finding groups with maximum betweenness centrality. Optim. Methods Softw. 32(2), 369–399 (2017)
Watts, D., Strogatz, S.: Collective dynamics of “small-world’’ networks. Nature 393(6684), 440–442 (1998)
Acknowledgements
The authors are grateful to Dr. Oliver Hinder for pointing out an issue in the early version of the paper as well as his subsequent comments. Also, we would like to thank the anonymous referees for the comments and suggestions, which helped us to improve the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research was partially supported by NSF grants CBET-1803527 and CMMI-2002681.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Lagos, T., Prokopyev, O.A. & Veremyev, A. Finding groups with maximum betweenness centrality via integer programming with random path sampling. J Glob Optim 88, 199–232 (2024). https://doi.org/10.1007/s10898-022-01269-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-022-01269-2