In graph theory, eigenvector centrality (also called eigencentrality) is a measure of the influence of a node in a network. It assigns relative scores to all nodes in the network based on the concept that connections to high-scoring nodes contribute more to the score of the node in question than equal connections to low-scoring nodes.
Google's PageRank and the Katz centrality are variants of the eigenvector centrality.
For a given graph
G
:=
(
V
,
E
)
with
|
V
|
vertices let
A
=
(
a
v
,
t
)
be the adjacency matrix, i.e.
a
v
,
t
=
1
if vertex
v
is linked to vertex
t
, and
a
v
,
t
=
0
otherwise. The relative centrality score of vertex
v
can be defined as:
x
v
=
1
λ
∑
t
∈
M
(
v
)
x
t
=
1
λ
∑
t
∈
G
a
v
,
t
x
t
where
M
(
v
)
is a set of the neighbors of
v
and
λ
is a constant. With a small rearrangement this can be rewritten in vector notation as the eigenvector equation
A
x
=
λ
x
In general, there will be many different eigenvalues
λ
for which a non-zero eigenvector solution exists. However, the additional requirement that all the entries in the eigenvector be non-negative implies (by the Perron–Frobenius theorem) that only the greatest eigenvalue results in the desired centrality measure. The
v
th
component of the related eigenvector then gives the relative centrality score of the vertex
v
in the network. The eigenvector is only defined up to a common factor, so only the ratios of the centralities of the vertices are well defined. To define an absolute score one must normalise the eigen vector e.g. such that the sum over all vertices is 1 or the total number of vertices n. Power iteration is one of many eigenvalue algorithms that may be used to find this dominant eigenvector. Furthermore, this can be generalized so that the entries in A can be real numbers representing connection strengths, as in a stochastic matrix.
