Weighted Betweenness Centrality
Weighted Betweenness Centrality (Geodesic Path-Count on Edge-Weighted Graphs) · Also known as: WBC, weighted shortest-path betweenness, edge-weighted betweenness, geodesic betweenness (weighted)
Weighted Betweenness Centrality extends Freeman's betweenness measure to edge-weighted graphs by routing shortest paths through a tunable transformation of edge weights. Nodes that sit on many high-value shortest paths receive high scores, identifying brokers and bridges in social, biological, and information networks where tie strength matters.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
+1 more
When to use it
Use weighted betweenness centrality when edge weights represent meaningful tie strength (frequency of contact, flow volume, collaboration intensity, similarity) and you want to identify brokers, gatekeepers, or single points of failure in a network. It is appropriate for social networks, collaboration networks, transportation grids, and biological pathways where the strength of connections shapes which routes are actually used. Avoid it when edge weights are noisy or arbitrary — in that case plain betweenness centrality is safer. Also avoid it for very large networks (millions of nodes) without approximate algorithms, since exact computation is O(n^3) in the worst case.
Strengths & limitations
- Captures brokerage and control in networks where tie strength determines which paths are preferred.
- The alpha tuning parameter allows analysts to blend unweighted and fully weighted path logic, making the measure adaptable.
- Directly identifies bottleneck nodes whose removal would fragment or slow the network.
- Compatible with Brandes' efficient algorithm, making computation feasible for networks with tens of thousands of nodes.
- Normalised scores are interpretable across networks of different sizes.
- Well-grounded in a peer-reviewed generalisation framework (Opsahl et al. 2010) with broad citation.
- Exact computation is O(n^3) in space and time for dense graphs, limiting scalability to very large networks.
- Results are sensitive to the choice of alpha; different values can substantially change the ranking of nodes.
- Assumes that information or influence flows only along geodesic (shortest) paths, which may not reflect real diffusion processes.
- Negative or zero edge weights require special handling and can break shortest-path algorithms.
- Disconnected networks produce undefined betweenness for pairs in different components, requiring component-level analysis.
Frequently asked
How do I choose the alpha parameter?
Alpha controls how much weight influences path choice. At alpha=0 you get classic unweighted betweenness; at alpha=1 stronger ties fully define shortest paths. A common practice is to test alpha=0, 0.5, and 1 and report sensitivity. If the node rankings are stable across values, any choice is defensible; if they differ substantially, justify your choice theoretically based on whether strong ties should be preferred.
What is the difference between weighted and unweighted betweenness centrality?
Unweighted betweenness counts hops; every edge has the same length. Weighted betweenness uses edge weights (converted to distances) so that paths preferentially follow stronger or shorter connections. In networks where tie strength is substantively meaningful — such as frequency of collaboration or volume of trade — the weighted version gives a more accurate picture of which nodes control actual flows.
Is weighted betweenness centrality suitable for very large networks?
Exact computation becomes costly above roughly 100,000 nodes. For very large networks, use approximate algorithms such as random-pivot sampling (implemented in NetworkX as betweenness_centrality with the k parameter) or leverage GPU-accelerated tools like cuGraph. Report whether you used exact or approximate computation.
Can I use weighted betweenness when my network has isolated nodes or multiple components?
Yes, but isolated nodes will always have a score of zero, and nodes in small components will have scores based only on paths within their component. Compute betweenness separately per component if you want within-component rankings, and report the component structure alongside the scores.
How should I report weighted betweenness centrality in a manuscript?
Report the software and version used (e.g., NetworkX, igraph), the value of alpha, whether scores were normalized, how you handled disconnected components, and a summary statistic (mean, range) alongside the top-ranked nodes. A degree-versus-betweenness scatter plot or network visualisation with node size proportional to score aids interpretation.
Sources
- Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251. DOI: 10.1016/j.socnet.2010.03.006 ↗
- Brandes, U. (2001). A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2), 163–177. DOI: 10.1080/0022250X.2001.9990249 ↗
How to cite this page
ScholarGate. (2026, June 3). Weighted Betweenness Centrality (Geodesic Path-Count on Edge-Weighted Graphs). ScholarGate. https://scholargate.app/en/network-analysis/weighted-betweenness-centrality
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Betweenness CentralityNetwork analysis↔ compare
- Social Network AnalysisNetwork analysis↔ compare
- Weighted Closeness CentralityNetwork analysis↔ compare
- Weighted Degree CentralityNetwork analysis↔ compare
- Weighted Eigenvector CentralityNetwork analysis↔ compare
- Weighted Social Network AnalysisNetwork analysis↔ compare