Skip to content
Back to search results

Weighted Eigenvector Centrality

Introduced by
Bonacich, P. (binary); Opsahl, T. et al. (weighted extension)
Year
1987 (binary); 2010 (weighted generalization)
Type
Spectral centrality measure
Family
Network science
Font size

What does it do?

Weighted eigenvector centrality extends the classic eigenvector centrality measure to graphs where edges carry numerical weights, scoring each node proportionally to the sum of its neighbors' scores multiplied by the connecting edge weights.

Nodes score highly not just by having many connections but by being strongly linked to other influential nodes, making the measure sensitive to both tie strength and network position simultaneously.

The intuition behind the method

In an unweighted network, eigenvector centrality captures prestige recursively: being connected to important nodes raises your own importance. In a weighted network, a weak tie to a central actor counts less than a strong tie to the same actor. Weighted eigenvector centrality internalises this intuition by replacing the simple adjacency matrix with a weight matrix, so that a researcher collaborating intensely with a field leader is ranked higher than one who has only a cursory co-authorship with the same leader. The score of each node is proportional to the weighted sum of the scores of its neighbors.

History

Eigenvector centrality was introduced by Phillip Bonacich in 1987 as a prestige measure for social networks, generalising simple degree by weighting each connection by the centrality of its source. The explicit extension to weighted networks gained formal treatment in Opsahl, Agneessens, and Skvoretz (2010), who provided a unified framework generalising both degree and path-based centralities to weighted graphs. The measure is now a standard tool in scientometrics, neuroscience connectomics, and international trade network analysis.

When to use it

Use weighted eigenvector centrality when your network has meaningful edge weights (collaboration frequency, communication volume, trade flow, co-occurrence count) and you need to identify nodes that are both strongly connected and connected to other well-connected nodes. It is especially appropriate in co-authorship networks, economic trade networks, and brain connectivity analyses. Avoid it when edge weights are ordinal or arbitrarily scaled, when the network is highly sparse or disconnected (the principal eigenvector may not converge or may be dominated by a small clique), when weights represent distances rather than affinities, or when interpretability of a single summary score is insufficient and path-based measures such as betweenness are more relevant.

Limitations and considerations

  • Problematic on disconnected or near-disconnected graphs, where the principal eigenvector can collapse to zero for peripheral components.
  • Sensitive to weight scaling: multiplying all weights by a constant changes eigenvalues but not rankings, yet arbitrary weight transformations can distort results.
  • Does not account for path length or bridging roles; nodes on important shortest paths may be underrated compared to betweenness-based measures.
  • Computationally expensive for very large dense networks; sparse approximations or power-iteration methods are needed at scale.

Source conditions do not replace independent scientific review or validation by an analysis engine.

Strengths

  • Captures both tie strength and global prestige simultaneously, unlike degree centrality which ignores who the neighbors are.
  • Theoretically grounded in spectral graph theory; the Perron-Frobenius theorem guarantees a unique, non-negative solution for connected non-negative matrices.
  • Sensitive to edge weight heterogeneity, rewarding nodes with strong links to other influential nodes over nodes with many weak links.
  • Widely implemented in standard network libraries (NetworkX, igraph, R's igraph package), making it accessible without custom code.
  • Applicable to both undirected and directed weighted networks.

Applications

  • Identifying key influencers in weighted collaboration or co-authorship networks in scientometrics.
  • Mapping hub regions in brain connectivity networks where edge weights reflect signal correlation strength.
  • Ranking countries by centrality in global trade networks weighted by export volume.
  • Detecting dominant species or keystone nodes in ecological food webs with interaction-strength weights.
  • Prioritising nodes for intervention in epidemiological contact networks with contact-frequency weights.
  • Evaluating router or server importance in communication networks weighted by traffic volume.

How it works

How it works

1

Represent the network as a weighted adjacency matrix W where entry W_ij holds the edge weight between nodes i and j. Weights must be non-negative; symmetric matrices apply to undirected networks, while asymmetric matrices extend the measure to directed weighted graphs.

Formula
W \in \mathbb{R}^{n \times n},\; W_{ij} = w_{ij} \geq 0
2

Compute the eigenvalues and eigenvectors of W. The principal eigenvector — associated with the largest positive eigenvalue — satisfies the recursive equation Wx = lambda*x, guaranteeing that each node's score is proportional to the weighted sum of its neighbors' scores.

Formula
W \mathbf{x} = \lambda \mathbf{x}
3

Select the eigenvector corresponding to the largest eigenvalue (Perron-Frobenius theorem ensures this eigenvector has all non-negative entries for a connected non-negative matrix), which is the meaningful centrality solution.

Formula
\mathbf{x}^* = \text{eigenvector for } \lambda_{\max}
4

Rescale the raw eigenvector entries so that the maximum score equals 1 (or the L2 norm equals 1, depending on convention), yielding interpretable centrality scores that rank nodes relative to the most central node in the network.

Formula
x_i^* = \frac{x_i}{\max_j x_j}

Common pitfalls

  • Using raw co-occurrence counts as weights without normalising for node activity, inflating centrality for high-volume nodes regardless of selectivity.
  • Applying the measure to disconnected graphs without first extracting the largest connected component, producing meaningless zero scores for peripheral nodes.
  • Treating distance-type weights (e.g., geographic distance, latency) as affinity weights, which reverses the interpretation — high weight should mean strong connection, not large cost.
  • Ignoring convergence diagnostics when using iterative (power-iteration) computation; failing to check whether the algorithm converged before trusting the scores.

Frequently asked questions

How does weighted eigenvector centrality differ from standard (binary) eigenvector centrality?

Binary eigenvector centrality uses an unweighted adjacency matrix, so each neighbor contributes equally regardless of tie strength. The weighted version uses a weight matrix, so a neighbor contributes in proportion to the weight of the connecting edge, making tie strength explicitly part of the prestige calculation.

What if my network is directed?

For directed weighted networks the weight matrix is asymmetric. You can compute left eigenvectors (reflecting in-flow prestige, analogous to a weighted hub score) or right eigenvectors (reflecting out-flow prestige), depending on whether you care about who receives influence or who sends it. This is analogous to the distinction between authority and hub scores in HITS.

Can negative edge weights be used?

The Perron-Frobenius guarantee of a non-negative principal eigenvector applies only to non-negative matrices. Negative weights (e.g., antagonistic relationships) break this guarantee and can produce eigenvectors with mixed signs that are difficult to interpret. Pre-process negative weights by either separating positive and negative layers or applying an absolute-value transformation with caution.

Is it better than weighted degree (strength) centrality?

They capture different things. Weighted degree (node strength) counts total weight of direct ties but ignores who the neighbors are. Weighted eigenvector centrality incorporates global network position recursively. In practice, the two measures correlate strongly in many empirical networks, so if eigenvector centrality fails to converge or the graph is disconnected, node strength may be the safer fallback.

How should I handle very large networks?

Use sparse matrix representations and power-iteration algorithms (available in NetworkX and igraph) rather than full eigendecomposition. Check convergence tolerance and iteration limits. For networks with millions of nodes, consider sampling or community-level aggregation before applying the measure.

Related methods

Sources

  1. Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182.

    Open DOI reference
    Copied.
  2. Opsahl, T., Agneessens, F., & Skvoretz, J. (2010). Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3), 245–251.

    Open DOI reference
    Copied.