Mostafa Haghir Chehreghani
ABSTRACT
Betweenness centrality of vertices is essential in the analysis of social and information networks, and co-betweenness centrality is one of two natural ways to extend it to sets of vertices. Existing algorithms for co-betweenness centrality computation suffer from at least one of the following problems: i) their applicability is limited to special cases like sequences, sets of size two, and ii) they are not efficient in terms of time complexity. In this paper, we present efficient algorithms for co-betweenness centrality computation of any set or sequence of vertices in weighted and unweighted networks. We also develop effective methods for co-betweenness centrality computation of sets and sequences of edges. These results provide a clear and extensive view about the complexity of co-betweenness centrality computation for vertices and edges in weighted and un-weighted networks. Finally, we perform extensive experiments on real-world networks from different domains including social, information and communication networks, to show the empirical efficiency of the proposed methods.
- A.-L. Barabasi and R. Albert, Emergence of scaling in random networks, Science, 286, 509--512, 1999.Google Scholar
Cross Ref
- C. Ballester, A. C. Armengol and Y. Zenou, Who's who in networks. wanted: The key player, Econometrica, 74(5), 1403--1417, Sep. 2006.Google ScholarCross Ref
- M. Barthelemy, Betweenness centrality in large complex networks. The Europ. Phys. J. B - Condensed Matter 38, 2(Mar.), 163--168, 2004.Google Scholar
- S. P. Borgatti, Types of network flows and how to destabilize terrorist networks, Sunbelt International Social Networks Conference, New Orleans, 2002.Google Scholar
- S. P. Borgatti, Centrality and network flow, Social Networks, 27(1), 55--71, 2005.Google ScholarCross Ref
- S. P. Borgatti, Identifying sets of key players in a social network, Comput. Math. Organ. Theory, 12(1), 21--34, 2006. Google ScholarDigital Library
- U. Brandes, A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology, 25(2), 163--177, 2001.Google ScholarCross Ref
- U. Brandes, On variants of shortest-path betweenness centrality and their generic computation, Social Networks, 30(2), 136--145, May 2008.Google ScholarCross Ref
- S. Brin, R. Motwani, L. Page and T. Winograd, What can you do with a web in your pocket? IEEE Bulletin of the Technical Committee on Data Engineering, 21(2), 37--47, 1998.Google Scholar
- A. Cuzzocrea, A. Papadimitriou, D. Katsaros and Y. Manolopoulos, Edgebetweenness centrality: A novel algorithm for QoS-based topology control over wireless sensor networks, Journal of Network and Computer Applications, 35(4), 1210--1217, July 2012. Google ScholarDigital Library
- S. Dolev, Y. Elovici and R. Puzis, Routing betweenness centrality, J. ACM, 57(4), 2010. Google ScholarDigital Library
- M. Everett and S. Borgatti. The centrality of groups and classes, Journal of Mathematical Sociology, 23(3), 181--201, 1999.Google ScholarCross Ref
- L. C. Freeman, A set of measures of centrality based upon betweenness, Sociometry, 40, 35--41, 1977.Google ScholarCross Ref
- L. C. Freeman, Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215--239, 1979.Google ScholarCross Ref
- L. C. Freeman, S. P. Borgatti, and D. R. White, Centrality in valued graphs: A measure of betweenness based on network flow, Social Networks, 13(2), 141--154, 1991.Google ScholarCross Ref
- M. Girvan and M. E. J. Newman, Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA 99, 7821--7826, 2002.Google ScholarCross Ref
- P. Holme, Congestion and centrality in traffic flow on complex networks, Adv. Complex Syst, 6(2), 163--176, 2003.Google ScholarCross Ref
- J. M. Kleinberg, Authoritative sources in a hyperlinked environment, Journal of the Association for Computing Machinery, 46(5), 604--632, 1999. Google ScholarDigital Library
- D. Knuth, Section 5.2.4: Sorting by Merging, Sorting and Searching. The Art of Computer Programming 3 (2nd ed.), Addison-Wesley, 158--168, 998.Google Scholar
- E. D. Kolaczyk, D. B. Chua and M. Barthelemy. Group-betweenness and co-betweenness: Inter-related notions of coalition centrality, Social Networks, 31(3), 190--203, 2009.Google ScholarCross Ref
- S. Lammer, B. Gehlsen, D. Helbing. Scaling laws in the spatial structure of urban road networks. Physica A, 363(1), 89--95, 2006.Google ScholarCross Ref
- J. Leskovec, J. Kleinberg and C. Faloutsos, Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations, KDD, 2005. Google ScholarDigital Library
- J. Leskovec, J. Kleinberg and C. Faloutsos, Graph Evolution: Densification and Shrinking Diameters, ACM Transactions on Knowledge Discovery from Data (ACM TKDD), 1(1), 2007. Google ScholarDigital Library
- M. Ley, The DBLP computer science bibliography: Evolution, research issues, perspectives, In Proc. Int. Symposium on String Processing and Information Retrieval, 1--10, 2002. Google ScholarDigital Library
- X. Li, J. Han, J.-G. Lee and H. Gonzalez, Traffic density-based discovery of hot routes in road networks, 10th Symposium on Spatial and Temporal Databases (SSTD), 441--459, 2007. Google ScholarDigital Library
- D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations, Behavioral Ecology and Sociobiology 54, 396--405, 2003.Google ScholarCross Ref
- P.Massa, M. Salvetti and D. Tomasoni, Bowling alone and trust decline in social network sites, In Proc. Int. Conf. Dependable, Autonomic and Secure Computing, 658--663, 2009. Google ScholarDigital Library
- J. McAuley and J. Leskovec, Learning to discover social circles in ego networks, NIPS, pages 548--556. 2012.Google ScholarDigital Library
- M. E. J. Newman, A measure of betweenness centrality based on random walks, Social Networks, 27(1), 39--54, 2005.Google ScholarCross Ref
- K. Norlen, G. Lucas, M. Gebbie and J. Chuang, EVA: Extraction, Visualization and Analysis of the Telecommunications and Media Ownership Network. Proceedings of International Telecommunications Society 14th Biennial Conference (ITS2002), Seoul Korea, August 2002.Google Scholar
- A. Perer, B. Shneiderman, Balancing systematic and flexible exploration of social networks, IEEE Transactions on Visualization and Computer Graphics, 12(5), 693--700, 2006. Google ScholarDigital Library
- R. Puzis, Y. Elovici and S. Dolev. Fast algorithm for successive computation of group betweenness centrality, Phys. Rev. E, 76(5), 2007.Google ScholarCross Ref
- R. Puzis, Y. Elovici and S. Dolev, Finding the most prominent group in complex networks, AI Commun. 20(4), 287--296, 2007. Google ScholarDigital Library
- J. M. Reitz, ODLIS: Online Dictionary of Library and Information Science, 2002.Google Scholar
- G. Yan, T. Zhou, B. Hu, Z. Q. Fu, and B.-H. Wang, Efficient routing on complex networks. Phys. Rev. E, 73, 046108, 2006.Google ScholarCross Ref
Index Terms
- Effective co-betweenness centrality computation
Recommendations
Sink Group Betweenness Centrality
IDEAS '21: Proceedings of the 25th International Database Engineering & Applications SymposiumThis article introduces the concept of Sink Group Node Betweenness centrality to identify those nodes in a network that can “monitor” the geodesic paths leading towards a set of subsets of nodes; it generalizes both the traditional node betweenness ...
Alpha Current Flow Betweenness Centrality
Algorithms and Models for the Web GraphAbstractA class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The original shortest-path betweenness centrality is based on counting ...
An efficient algorithm for approximate betweenness centrality computation
CIKM '13: Proceedings of the 22nd ACM international conference on Information & Knowledge ManagementBetweenness centrality is an important centrality measure widely used in social network analysis, route planning etc. However, even for mid-size networks, it is practically intractable to compute exact betweenness scores. In this paper, we propose a ...
Comments