Spectral centrality measures in complex networks

Details Spectral centrality measures in complex networks Spectral centrality measures in complex networks

2008-05-21

arxiv.org/abs/0805.3322v2

Phys. Rev. E 78, 036107 (2008)

Physics

Physics and Society

11 pages, 10 figures, 5 tables. Final version published in Physical Review E

Scientific paper

10.1103/PhysRevE.78.036107

Complex networks are characterized by heterogeneous distributions of the degree of nodes, which produce a large diversification of the roles of the nodes within the network. Several centrality measures have been introduced to rank nodes based on their topological importance within a graph. Here we review and compare centrality measures based on spectral properties of graph matrices. We shall focus on PageRank, eigenvector centrality and the hub/authority scores of HITS. We derive simple relations between the measures and the (in)degree of the nodes, in some limits. We also compare the rankings obtained with different centrality measures.

Affiliated with

Also associated with

No associations

Rating

Spectral centrality measures in complex networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spectral centrality measures in complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral centrality measures in complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-290666