research-article

Betweenness centrality: algorithms and implementations

Authors:

Dimitrios Prountzos,

Keshav PingaliAuthors Info & Claims

PPoPP '13: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming

Pages 35 - 46

https://doi.org/10.1145/2442516.2442521

Published: 23 February 2013 Publication History

Abstract

Betweenness centrality is an important metric in the study of social networks, and several algorithms for computing this metric exist in the literature. This paper makes three contributions. First, we show that the problem of computing betweenness centrality can be formulated abstractly in terms of a small set of operators that update the graph. Second, we show that existing parallel algorithms for computing betweenness centrality can be viewed as implementations of different schedules for these operators, permitting all these algorithms to be formulated in a single framework. Third, we derive a new asynchronous parallel algorithm for betweenness centrality that (i) works seamlessly for both weighted and unweighted graphs, (ii) can be applied to large graphs, and (iii) is able to extract large amounts of parallelism. We implemented this algorithm and compared it against a number of publicly available implementations of previous algorithms on two different multicore architectures. Our results show that the new algorithm is the best performing one in most cases, particularly for large graphs and large thread counts, and is always competitive against other algorithms.

References

[1]

Galois system. http://iss.ices.utexas.edu/?p=projects/galois.

[2]

9th DIMACS Implementation Challenge. http://www.dis.uniroma1.it/~challenge9/download.shtml, 2009.

[3]

D. Bader., J. Gilbert, J. Kepner, and K. Madduri. Hpcs scalable synthetic compact applications graph analysis (SSCA2) benchmark v2.2, 2007. http://www.graphanalysis.org/benchmark/.

[4]

D. A. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating betweenness centrality. In WAW, Berlin, Heidelberg, 2007.

Digital Library

[5]

D. A. Bader and K. Madduri. Parallel algorithms for evaluating centrality indices in real-world networks. In ICPP, 2006.

Digital Library

[6]

G. Blelloch, J. Fineman, P. Gibbons, and H. Simhadri. Scheduling irregular parallel computations on hierarchical caches. In SPAA, 2011.

Digital Library

[7]

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In PPOPP, 1995.

Digital Library

[8]

R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. Journal of the ACM, 46(5), 1999.

Digital Library

[9]

U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25, 2001.

[10]

U. Brandes and C. Pich. Centrality Estimation in Large Networks. International Journal of Birfucation and Chaos, 17(7), 2007.

[11]

N. Bulkley and M. V. Alstyne. Does e-mail make white collar workers more productive? Technical report, University of Michigan, 2004.

[12]

A. Buluc and J. Gilbert. The combinatorial BLAS: design, implementation, and applications. Int. Journal of High Perf. Computing Applications, 2011.

Digital Library

[13]

D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In In SIAM Data Mining, 2004.

[14]

R. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandran. Oblivious algorithms for multicores and network of processors. In IPDPS, 2010.

[15]

T. Coffman, S. Greenblatt, and S. Marcus. Graph-based technologies for intelligence analysis. Commun. ACM, 47, 2004.

Digital Library

[16]

G. Cong and K. Makarychev. Optimizing large-scale graph analysis on a multi-threaded, multi-core platform. In IPDPS, 2011.

Digital Library

[17]

A. Del Sol, H. Fujihashi, and P. O'Meara. Topology of small-world networks of protein--protein complex structures. Bioinformatics, 2005.

Digital Library

[18]

D. Ediger, K. Jiang, J. Riedy, D. A. Bader, and C. Corley. Massive social network analysis: Mining twitter for social good. In ICPP, 2010.

Digital Library

[19]

N. Edmonds, T. Hoefler, and A. Lumsdaine. A space-efficient parallel algorithm for computing betweenness centrality in distributed memory. In HiPC, 2010.

[20]

L. C. Freeman. A set of measures of centrality based on betweenness. 1977.

[21]

R. Geisberger, P. Sanders, and D. Schultes. Better approximation of betweenness centrality. In ALENEX, 2008.

Digital Library

[22]

M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12), 2002.

[23]

R. Guimer`a, S. Mossa, A. Turtschi, and L. A. N. Amaral. The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles. NAS, 102(22), 2005.

[24]

M. Hassaan, M. Burtscher, and K. Pingali. Ordered vs unordered: a comparison of parallelism and work-efficiency in irregular algorithms. In PPOPP, 2011.

Digital Library

[25]

H. Jeong, S. P. Mason, A. L. Barabasi, and Z. N. Oltvai. Lethality and centrality in protein networks. Nature, 411, May 2001.

[26]

S. Jin, Z. Huang, Y. Chen, D. G. Chavarr1a-Miranda, J. Feo, and P. C. Wong. A novel application of parallel betweenness centrality to power grid contingency analysis. In IPDPS, 2010.

[27]

V. Krebs. Mapping networks of terrorist cells. Connections, 2002.

[28]

F. Liljeros, C. Edling, L. Amaral, H. Stanley, and Y. Aberg. The web of human sexual contacts. Nature, 411, 2001.

[29]

K. Madduri, D. Ediger, K. Jiang, D. A. Bader, and D. G. Chavarramiranda. A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. In IPDS, 2009.

Digital Library

[30]

U. Meyer and P. Sanders. Delta-stepping: A parallel single source shortest path algorithm. In ESA, 1998.

Digital Library

[31]

D. Nguyen and K. Pingali. Synthesizing concurrent schedulers for irregular algorithms. In ASPLOS, 2011.

Digital Library

[32]

G. Palla, I. J. Farkas, P. Pollner, I. Derenyi, and T. Vicsek. Fundamental statistical features and self-similar properties of tagged networks. New Journal of Physics, 10, 2008. http://cfinder.org/wiki/?n=Main.Data#toc2.

[33]

R. Pearce, M. Gokhale, and N. Amato. Multithreaded asynchronous graph traversal for in-memory and semi-external memory. In SC, 2010.

Digital Library

[34]

K. Pingali, D. Nguyen, M. Kulkarni, M. Burtscher, M. A. Hassaan, R. Kaleem, T. Lee, A. Lenharth, R. Manevich, M. Mendez-Lojo, D. Prountzos, and X. Sui. The TAO of parallelism in algorithms. In PLDI, 2011.

Digital Library

[35]

D. Prountzos and K. Pingali. Betweenness centrality: Algorithms and implementations. Technical Report TR-13-31, UT Austin, Jan 2013.

Digital Library

[36]

Z. Shi and B. Zhang. Fast network centrality analysis using gpus. BMC Bioinformatics, 2011.

[37]

J. G. Siek. and a. A. L. L.Q. Lee. The Boost Graph Library: User Guide and Reference Manual (C++ In-Depth Series). Addison-Wesley Professional, 2001.

[38]

G. Tan, V. C. Sreedhar, and G. R. Gao. Analysis and performance results of computing betweenness centrality on ibm cyclops64. J. Supercomput., 56, 2011.

Digital Library

[39]

G. Tan, D. Tu, and N. Sun. A parallel algorithm for computing betweenness centrality. In ICPP, 2009.

Digital Library

[40]

J. Yang and Y. Chen. Fast computing betweenness centrality with virtual nodes on large sparse networks. PLoS ONE, 6(7), 2011.

[41]

Q. Yang and S. Lonardi. A parallel algorithm for clustering proteinprotein interaction networks. Comp. Systems Bioinformatics, 2005.

Digital Library

Cited By

Thafar MAlsulami MAlbaradei S(2024)FutureCite: Predicting Research Articles’ Impact Using Machine Learning and Text and Graph Mining TechniquesMathematical and Computational Applications10.3390/mca2904005929:4(59)Online publication date: 21-Jul-2024
https://doi.org/10.3390/mca29040059
Gao QHu MYang LZhao Z(2024)Identification of Key Nodes in Multi-Layer Heterogeneous Aviation Network through Aggregating Multi-Source InformationAerospace10.3390/aerospace1108061911:8(619)Online publication date: 29-Jul-2024
https://doi.org/10.3390/aerospace11080619
Heidary Dahooie Jnouri IMohammadi MYalcin HDaim T(2024)Identifying core IoT technologies using ARM and FCM: A comprehensive data-driven methodWorld Patent Information10.1016/j.wpi.2024.10229578(102295)Online publication date: Oct-2024
https://doi.org/10.1016/j.wpi.2024.102295
Show More Cited By

Index Terms

Betweenness centrality: algorithms and implementations

Recommendations

Betweenness centrality: algorithms and implementations
PPoPP '13

Betweenness centrality is an important metric in the study of social networks, and several algorithms for computing this metric exist in the literature. This paper makes three contributions. First, we show that the problem of computing betweenness ...
Effective co-betweenness centrality computation
WSDM '14: Proceedings of the 7th ACM international conference on Web search and data mining

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 ...
Sink Group Betweenness Centrality
IDEAS '21: Proceedings of the 25th International Database Engineering & Applications Symposium

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

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPoPP '13: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming

February 2013

332 pages

ISBN:9781450319225

DOI:10.1145/2442516

General Chairs:
Alex Nicolau
University of California, Irvine, USA
,
Xiaowei Shen
IBM Research, China
,
Program Chairs:
Saman Amarasinghe
Massachusetts Institute of Technology, USA
,
Richard Vuduc
Georgia Institute of Technology, USA

ACM SIGPLAN Notices Volume 48, Issue 8
PPoPP '13
August 2013
309 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2517327
Issue’s Table of Contents

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 February 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PPoPP '13

Sponsor:

SIGPLAN

PPoPP '13: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

February 23 - 27, 2013

Shenzhen, China

Acceptance Rates

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
1,375
Total Downloads

Downloads (Last 12 months)81
Downloads (Last 6 weeks)2

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Thafar MAlsulami MAlbaradei S(2024)FutureCite: Predicting Research Articles’ Impact Using Machine Learning and Text and Graph Mining TechniquesMathematical and Computational Applications10.3390/mca2904005929:4(59)Online publication date: 21-Jul-2024
https://doi.org/10.3390/mca29040059
Gao QHu MYang LZhao Z(2024)Identification of Key Nodes in Multi-Layer Heterogeneous Aviation Network through Aggregating Multi-Source InformationAerospace10.3390/aerospace1108061911:8(619)Online publication date: 29-Jul-2024
https://doi.org/10.3390/aerospace11080619
Heidary Dahooie Jnouri IMohammadi MYalcin HDaim T(2024)Identifying core IoT technologies using ARM and FCM: A comprehensive data-driven methodWorld Patent Information10.1016/j.wpi.2024.10229578(102295)Online publication date: Oct-2024
https://doi.org/10.1016/j.wpi.2024.102295
Yalcin HDaim TMoughari MMermoud A(2024)Supercomputers and Quantum Computing on the Axis of Cyber SecurityTechnology in Society10.1016/j.techsoc.2024.102556(102556)Online publication date: May-2024
https://doi.org/10.1016/j.techsoc.2024.102556
Zhang QDeng RDing KLi M(2024)Structural analysis and the sum of nodes’ betweenness centrality in complex networksChaos, Solitons & Fractals10.1016/j.chaos.2024.115158185(115158)Online publication date: Aug-2024
https://doi.org/10.1016/j.chaos.2024.115158
Xu YZhang MWu RLi LZhou X(2024)Efficient processing of coverage centrality queries on road networksWorld Wide Web10.1007/s11280-024-01248-527:3Online publication date: 12-Apr-2024
https://doi.org/10.1007/s11280-024-01248-5
Wang YWang JHuang MYu GWang ZGuo SYang J(2024)A multiple features fusion-based social network node importance measure for rumor controlSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-023-08510-428:3(2501-2516)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1007/s00500-023-08510-4
Cousins CWohlgemuth CRiondato M(2023) Bavarian: Betweenness Centrality Approximation with Variance-aware Rademacher AveragesACM Transactions on Knowledge Discovery from Data10.1145/357702117:6(1-47)Online publication date: 6-Mar-2023
https://dl.acm.org/doi/10.1145/3577021
Niu WTan WJia WZhao LXie N(2023)Crisis Assessment Oriented Influence Maximization in Social NetworksIEEE Transactions on Computational Social Systems10.1109/TCSS.2022.316618210:3(1381-1393)Online publication date: Jul-2023
https://doi.org/10.1109/TCSS.2022.3166182
Zheng ZDu BZhao CXie P(2023)Path Merging Based Betweenness Centrality Algorithm in Delay Tolerant NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2023.331007141:10(3133-3145)Online publication date: Oct-2023
https://doi.org/10.1109/JSAC.2023.3310071
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents