Weighted Degree Centrality
Weighted Degree Centrality (Node Strength in Weighted Networks) · Also known as: node strength, strength centrality, weighted node degree, WDC
Weighted degree centrality — also called node strength — extends the classic degree centrality measure to networks whose edges carry numeric weights. Instead of simply counting a node's connections, it sums the weights of all edges incident to that node, capturing both the volume and the intensity of a node's ties in a single, interpretable score.
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.
+4 more
When to use it
Use weighted degree centrality when your network has meaningful numeric edge weights — collaboration frequency, communication volume, trade value, physical flow — and you want to identify the most active or influential nodes without the complexity of path-based measures. It is the appropriate first centrality measure when binary degree would discard important variation in tie strength. Do not use it when edge weights are nominal or ordinal categories (convert to meaningful ordinal scores first), when network structure rather than raw throughput matters most (prefer betweenness or eigenvector centrality), or when the network is unweighted (use standard degree centrality instead).
Strengths & limitations
- Computationally cheap — O(m) where m is the number of edges — and trivially parallelizable for large networks.
- Intuitive interpretation: it directly reflects the total volume or intensity of a node's connections.
- Discriminates between nodes with equal degree but different tie strengths, which binary degree centrality cannot do.
- Widely implemented in NetworkX, igraph, Gephi, and R's igraph package.
- Combines naturally with unweighted degree to detect whether high-degree nodes also carry heavy traffic.
- Sensitive to the scale and distribution of edge weights; skewed weights can inflate a few nodes' scores dramatically.
- Does not account for the position of a node in the global network structure — a peripheral but heavily weighted node may outscore a topologically central one.
- Ignores the direction of edges in directed networks unless in-strength and out-strength are computed separately.
- Provides no information about clustering, brokerage, or the reach of indirect connections.
Frequently asked
How does weighted degree centrality differ from standard degree centrality?
Standard degree centrality counts the number of edges incident to a node, treating all connections equally. Weighted degree centrality sums the edge weights, so a node connected to one very strong tie can outscore a node with many weak ties. The two measures together reveal whether a node's influence comes from breadth or intensity of connections.
Should I log-transform edge weights before computing node strength?
When weights span several orders of magnitude — for instance, trade volumes ranging from thousands to billions — log-transformation prevents a handful of extreme ties from dominating the scores. Always inspect the weight distribution and apply transformation if it is heavily right-skewed.
How do I handle directed networks?
Compute in-strength (sum of incoming edge weights) and out-strength (sum of outgoing edge weights) separately. In-strength often reflects popularity or authority, while out-strength reflects activity or effort. Combining them into a single score discards directional information.
What is a reasonable software choice for computing weighted degree centrality?
NetworkX in Python (strength method via degree with weight parameter), igraph in R or Python (strength function), and Gephi (built-in weighted degree column) all compute node strength with a single function call. For very large sparse networks, graph-tool or GraphBLAS-based implementations are more efficient.
When should I prefer betweenness centrality over weighted degree centrality?
Use betweenness centrality when you care about which nodes control information or resource flow along shortest paths — brokers and bridges in a network. Use weighted degree centrality when you care about raw activity or throughput at each node. They are complementary and often informative when reported together.
Sources
- Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752. DOI: 10.1073/pnas.0400087101 ↗
- Newman, M. E. J. (2010). Networks: An Introduction. Oxford University Press. ISBN: 978-0-19-920665-0
How to cite this page
ScholarGate. (2026, June 3). Weighted Degree Centrality (Node Strength in Weighted Networks). ScholarGate. https://scholargate.app/en/network-analysis/weighted-degree-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
- Closeness CentralityNetwork analysis↔ compare
- Degree CentralityNetwork analysis↔ compare
- Eigenvector CentralityNetwork analysis↔ compare
- Social Network AnalysisNetwork analysis↔ compare
- Weighted Betweenness CentralityNetwork analysis↔ compare