The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
On variants of shortest-path betweenness centrality and their generic computation
Open accessAbstract
Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of the algorithm commonly used for the standard case.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Bhatia, R., Bredon, G. E., Walter, W. L., Rotman, J. J., Murty, M. R., Gilman, J., Walters, P., Golubitsky, M., Karatzas, I., Cohen, H., et al. (1977) · Cited by 8,252
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
Self-citationBollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Borgatti, S. P. (2005) · Social Networks · doi:10.1016/j.socnet.2004.11.008 · Cited by 3,191
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.056131 · Cited by 2,476
A measure of betweenness centrality based on random walks
Newman, M. E. J. (2005) · Social Networks · doi:10.1016/j.socnet.2004.11.009 · Cited by 2,461
Borgatti, S. P. (2005) · Cited by 1,734
A Graph-theoretic perspective on centrality
Borgatti, S. P., & Everett, M. G. (2006) · Social Networks · doi:10.1016/j.socnet.2005.11.005 · Cited by 1,678
Kleinberg, J. M., & Eva Tardos, D. (2005) · Cited by 1,400
Universal Behavior of Load Distribution in Scale-Free Networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.278701 · Cited by 1,246
Centrality in valued graphs: A measure of betweenness based on network flow
Freeman, L. C., Borgatti, S. P., & White, D. R. (1991) · Social Networks · doi:10.1016/0378-8733(91)90017-n · Cited by 1,060
Everett, M. G., & Borgatti, S. P. (2004) · Social Networks · doi:10.1016/j.socnet.2004.11.007 · Cited by 679
Yang, X.-S. (2021) · Nature-Inspired Optimization Algorithms · doi:10.1016/b978-0-12-821986-7.00008-1 · Cited by 677
The centrality of groups and classes
Everett, M. G., & Borgatti, S. P. (1999) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1999.9990219 · Cited by 665
Structural parameters of communication networks
Shimbel, A. (1953) · Bulletin of Mathematical Biology · doi:10.1007/bf02476438 · Cited by 498
Scaling laws in the spatial structure of urban road networks
Lämmer, S., Gehlsen, B., & Helbing, D. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.01.051 · Cited by 388
CENTRALITY ESTIMATION IN LARGE NETWORKS
BRANDES, U., & PICH, C. (2007) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127407018403 · Cited by 384
Self-citationCentrality Measures Based on Current Flow
Brandes, U., & Fleischer, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31856-9_44 · Cited by 333
Self-citationBetweenness centrality measures for directed graphs
White, D. R., & Borgatti, S. P. (1994) · Social Networks · doi:10.1016/0378-8733(94)90015-9 · Cited by 316
Koschützki, D., Lehmann, K. A., Peeters, L., Richter, S., Tenfelde-Podehl, D., & Zlotowski, O. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31955-9_3 · Cited by 286
Anthonisse, J. M. (1971) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 277
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.73.039906 · Cited by 209
Balancing Systematic and Flexible Exploration of Social Networks
Perer, A., & Shneiderman, B. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.122 · Cited by 196
Sexual network analysis of a gonorrhoea outbreak
De, P. (2004) · Sexually Transmitted Infections · doi:10.1136/sti.2003.007187 · Cited by 149
CCFRのν μ -Feと反ν μ -Feの微分断面積からR=σ L /σ T の導出
Yang, U. K., Adams, T., Arroyo, C., De Barbaro, L., Bernstein, R. H., Brau, J., Johnson, R. A., Smith, W. H., & Zimmerman, E. D. (2001) · Physical Review Letters · Cited by 57
Measures of betweenness in non-symmetric networks
Gould, R. V. (1987) · Social Networks · doi:10.1016/0378-8733(87)90023-2 · Cited by 44
A new measure of linkage between two sub-networks
Flom, P. L., Friedman, S. R., Strauss, S. M., & Neaigus, A. (2004) · Cited by 25
Cited by
Node centrality in weighted networks: Generalizing degree and shortest paths
Opsahl, T., Agneessens, F., & Skvoretz, J. (2010) · Social Networks · doi:10.1016/j.socnet.2010.03.006 · Cited by 3,718
State of the aRt personality research: A tutorial on network analysis of personality data in R
Costantini, G., Epskamp, S., Borsboom, D., Perugini, M., Mõttus, R., Waldorp, L. J., & Cramer, A. O. J. (2015) · Journal of Research in Personality · doi:10.1016/j.jrp.2014.07.003 · Cited by 982
Study on centrality measures in social networks: a survey
Das, K., Samanta, S., & Pal, M. (2018) · Social Network Analysis and Mining · doi:10.1007/s13278-018-0493-2 · Cited by 443
A Network Approach to Psychosis: Pathways Between Childhood Trauma and Psychotic Symptoms
Isvoranu, A.-M., van Borkulo, C. D., Boyette, L.-L., Wigman, J. T. W., Vinkers, C. H., Borsboom, D., & Group Investigators (2017) · Schizophrenia Bulletin · doi:10.1093/schbul/sbw055 · Cited by 397
Applying centrality measures to impact analysis: A coauthorship network analysis
Yan, E., & Ding, Y. (2009) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21128 · Cited by 390
Metadata
- Authors
- Brandes, U.
- Venue
- Social Networks
- Publisher
- Elsevier BV
- Published
- 2008-05
- Volume
- 30
- Issue
- 2
- Pages
- 136-145
- ISSN
- 0378-8733 (ISSN-L)
- OpenAlex
- W2099970772
- Cited by
- 989
- References
- 32
- FWCI
- 16.50
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.