Weighted Closeness Centrality
Weighted Closeness Centrality (Opsahl Generalized Closeness) · Also known as: weighted closeness, generalized closeness centrality, WCC, distance-weighted closeness
Weighted closeness centrality extends the classic closeness measure to networks where edges carry numerical weights — such as frequency, strength, or cost — by incorporating those weights into shortest-path distances. Nodes that can reach others quickly along strong or efficient connections receive higher scores, making it a richer indicator of information-spreading potential than its binary counterpart.
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.
When to use it
Use weighted closeness centrality when edge weights (collaboration frequency, communication volume, monetary flow, transportation capacity) are theoretically meaningful and should influence which nodes are considered central. It is appropriate for social networks, trade networks, transportation systems, co-authorship graphs, and any setting where reach efficiency depends on tie strength. Prefer it over unweighted closeness whenever ignoring weights would distort the centrality ranking. Do not use it when weights are unreliable, arbitrarily scaled, or absent; in disconnected graphs without careful handling of unreachable pairs; or when the research question concerns pure structural topology rather than flow efficiency.
Strengths & limitations
- Incorporates edge weights so that strong or efficient connections properly boost a node's centrality score.
- The alpha tuning parameter provides a continuous bridge between binary and fully weight-based closeness.
- Retains the intuitive interpretation of closeness: how quickly a node can reach or be reached by others.
- Directly comparable to unweighted closeness, enabling controlled sensitivity analyses.
- Well-suited to directed weighted networks when combined with in-closeness and out-closeness decomposition.
- Requires complete, reliable weight data; missing or noisy edge weights propagate directly into centrality scores.
- Disconnected networks require special treatment (e.g., excluding unreachable pairs or using harmonic closeness).
- Choosing the alpha parameter requires theoretical justification — arbitrary defaults can distort rankings.
- Computationally more expensive than degree centrality for large sparse networks.
Frequently asked
How should I choose the alpha parameter?
Alpha = 0 recovers unweighted closeness (topology only); alpha = 1 makes weights dominate. A common approach is to compute rankings at alpha = 0, 0.5, and 1 and report the sensitivity. If theory suggests tie strength is the primary mechanism, alpha = 1 is defensible; if topology matters more, use alpha = 0 or 0.5.
What weight-to-distance transformation should I use?
For frequency, strength, or capacity weights (higher = stronger), invert the weight: distance = 1/w. For cost, latency, or resistance weights (higher = weaker), use the weight directly as distance. Mixing these conventions without care will invert the centrality rankings.
How do I handle disconnected components?
The standard approach is to restrict the sum to reachable nodes and normalize by (n_reachable - 1) rather than (n - 1), or to use harmonic closeness centrality which naturally handles unreachable pairs by summing the reciprocal of distances.
Is weighted closeness better than unweighted closeness?
When weights carry substantive meaning (e.g., frequency of contact, volume of trade), weighted closeness gives a more accurate picture of reach efficiency. When weights are unreliable or weights and topology are nearly uncorrelated, the added complexity may not improve inference.
How does this differ from weighted betweenness centrality?
Weighted closeness measures how efficiently a node can reach others through strong paths. Weighted betweenness measures how often a node lies on the shortest paths between other pairs. A node can be close (high closeness) without being a critical bridge (high betweenness), and vice versa.
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 Closeness Centrality (Opsahl Generalized Closeness). ScholarGate. https://scholargate.app/en/network-analysis/weighted-closeness-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.
- Closeness CentralityNetwork analysis↔ compare
- Eigenvector CentralityNetwork analysis↔ compare
- Weighted Betweenness CentralityNetwork analysis↔ compare
- Weighted Degree CentralityNetwork analysis↔ compare
- Weighted Eigenvector CentralityNetwork analysis↔ compare
- Weighted Social Network AnalysisNetwork analysis↔ compare