Degree Centrality:
Eigenvector Centrality:
Eigenvector centrality tries to generalize degree centrality by incorporating
the importance of the neighbors
where
is some fixed constant.
Assuming
is the centrality vectors for all nodes,
This basically means that
is an eigenvector of adjacency matrix
and is t
he corresponding
eigenvalue(
)
Katz Centrality:
Add a bias term to the eigenvector centrality value:
PageRank:
Divide the value of passed centrality by the number of outgoing links
where is a diagonal matrix of degrees
Betweenness Centrality:
Another way of looking at centrality is by considering how important
nodes are in connecting other nodes.
where
is the number of shortest paths from node s to t.
More effective algorithms such as the Brandes
algorithm have been designed.
Closeness Centrality:
The intuition is that the more central nodes are, the
more quickly they can reach other nodes.