Eigenvector Centrality
Also known as: eigenvector centrality, EC, Bonacich centrality, power centrality
Eigenvector centrality, introduced by Bonacich in 1972, measures a node's influence by considering not just how many neighbors it has, but how influential those neighbors are. A node scores highly if it is connected to other high-scoring nodes, making it a recursive, globally-aware measure of structural importance in a network.
Key highlights
- Captures recursive, global influence rather than just local degree, revealing prestige and structural importance simultaneously.
- Grounded in a principled linear-algebraic framework with a unique solution guaranteed by the Perron-Frobenius theorem for connected networks.
- Naturally accounts for the quality of connections, not just their quantity, making it suitable for prestige and status research.
- Efficient to compute via power iteration even on large sparse networks.
- Directly interpretable: scores reflect proportional influence relative to the most central node.
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
Use eigenvector centrality when you want to identify nodes that are influential not merely because they have many connections, but because they are embedded in densely connected, high-status regions of the network — typical in citation networks, social influence research, and organizational prestige analysis. It is appropriate for undirected or symmetric directed networks where the notion of mutual reinforcement makes substantive sense. Avoid it on disconnected graphs (scores become undefined for isolated components), on directed acyclic graphs (the leading eigenvector degenerates), or when local connectivity rather than global prestige is the research question. For directed networks with asymmetric influence, PageRank is generally preferable.
Strengths & limitations
- Captures recursive, global influence rather than just local degree, revealing prestige and structural importance simultaneously.
- Grounded in a principled linear-algebraic framework with a unique solution guaranteed by the Perron-Frobenius theorem for connected networks.
- Naturally accounts for the quality of connections, not just their quantity, making it suitable for prestige and status research.
- Efficient to compute via power iteration even on large sparse networks.
- Directly interpretable: scores reflect proportional influence relative to the most central node.
- Undefined or degenerate on disconnected graphs and directed acyclic graphs, where the leading eigenvector does not yield meaningful scores for all nodes.
- Sensitive to network density and structure: in very sparse networks nearly all nodes collapse to near-zero scores except a small hub.
- Does not account for path length or bridging roles; a node connecting two dense clusters may score low despite its structural importance.
- For directed asymmetric networks the measure requires adaptation (e.g., PageRank), and naive application can be misleading.
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Applications
This section is available to Pro members. Upgrade to Pro
Frequently asked
How does eigenvector centrality differ from degree centrality?
Degree centrality counts only immediate neighbors, treating all connections as equal. Eigenvector centrality weights each neighbor by that neighbor's own centrality, so a connection to a highly central node contributes more than a connection to a peripheral one. A node with few but very influential neighbors can outrank a high-degree node connected mostly to peripheral nodes.
Why does eigenvector centrality fail on directed acyclic graphs?
In a directed acyclic graph there are no cycles, so influence cannot flow back upstream. The leading eigenvector of the adjacency matrix assigns zero scores to all nodes except those with no outgoing edges (sinks), making the measure degenerate. PageRank solves this by adding a teleportation term that redistributes weight uniformly.
Can I use eigenvector centrality on weighted networks?
Yes. Replace the binary adjacency matrix with a weighted adjacency matrix and apply the same eigen-decomposition. The leading eigenvector then reflects both the number and strength of connections. Ensure that edge weights are non-negative for the Perron-Frobenius guarantees to hold.
How should I report eigenvector centrality in a paper?
Report the normalized eigenvector centrality scores (max = 1), specify the software and version used (e.g., NetworkX, igraph), state whether the network was directed or undirected, and confirm that the largest connected component was used if the graph is disconnected. A visualization coloring or sizing nodes by their score greatly aids interpretation.
What is the relationship between eigenvector centrality and PageRank?
PageRank is a directed, damped generalization of eigenvector centrality. It adds a damping factor (typically 0.85) and a uniform teleportation probability to handle disconnected and directed graphs. For undirected connected networks, PageRank and eigenvector centrality produce nearly identical rankings.
Sources
- 1.Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120.
- 2.Eigenvector centrality. Wikipedia.
You have read it. What now?
Cite this page
ScholarGate. (2026, June 3). Eigenvector Centrality. ScholarGate. https://scholargate.app/network-analysis/eigenvector-centrality