Scribd
Upload
177 views7 pages

Eigenvector Centrality

Eigenvector centrality is a measure of the importance of a node in a network based on the principle that connections to high-scoring nodes contribute more to the score of the node than equal connections to low-scoring nodes. It assigns relative scores to all nodes in the network based on the eigenvector of the adjacency matrix. Google's PageRank is a variant of eigenvector centrality. Eigenvector centrality, degree centrality, closeness centrality, and betweenness centrality are calculated for nodes in sample networks like a wiring room, karate club network, and medieval Russian trade network to demonstrate how the different centrality measures can vary.

Uploaded by

Piotr Pytlarz
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
177 views7 pages

Eigenvector Centrality

Eigenvector centrality is a measure of the importance of a node in a network based on the principle that connections to high-scoring nodes contribute more to the score of the node than equal connections to low-scoring nodes. It assigns relative scores to all nodes in the network based on the eigenvector of the adjacency matrix. Google's PageRank is a variant of eigenvector centrality. Eigenvector centrality, degree centrality, closeness centrality, and betweenness centrality are calculated for nodes in sample networks like a wiring room, karate club network, and medieval Russian trade network to demonstrate how the different centrality measures can vary.

Uploaded by

Piotr Pytlarz
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

EIGENVECTOR CENTRALITY Eigenvector centrality is a measure of the importance of a node in a network.

It assigns relative scores to all nodes in the network based on the principle 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 is a variant of the Eigenvector centrality measure. Using the adjacency matrix to find eigenvector centrality Let xi denote the score of the i node. Let A = (ai,j) be the adjacency matrix of the network. th th Hence ai,j = 1 if the i node is linked to the j node, and ai,j = 0 otherwise. More generally, the entries in A can be real numbers representing connection strengths, as in a stochastic matrix. For the i node, let the centrality score be proportional to the sum of the scores of all nodes which are connected to it. Hence
th th

where M(i) is the set of nodes that are connected to the i node, N is the total number of nodes and is a constant. In vector notation this can be rewritten as

th

or as the eigenvector equation In general, there will be many different eigenvalues for which an eigenvector solution exists. However, the additional requirement that all the entries in the eigenvector be positive implies (by the PerronFrobenius theorem) that only the greatest eigenvalue results in the desired centrality th th measure. The i component of the related eigenvector then gives the centrality score of the i node in the network. (wikipedia.org/wiki/centrality)

Wiring Room

CS4 = CW9 =
. . .

1 1

(CW9 + CW8 ) (CS4 + CW8 + CW7)

CI1 =

(CW3)

Wiring Room

Eigenvector Centrality S1 (.498) W3 (.472) W1,W4 (.438) W7 (.254) W8,W9 (.159) I1 (.147) S4 (.099)

Degree Centrality W3,S1 W9,W8,W7,W1,W4 S4 I1

Closeness Centrality S1 W7 W3 W1,W4 W8, W9 I1 S4

Betweenness Centrality S1 W7 W3 W8,W9 W1,I1,W4,S4 (0)

Karate Club

Eigenvector Centrality 1 (.355) 3 (.317) 2 (.266) 9 (.227) 14 (.226) 4 (.211) 31 (.175) 8 (.171) . . .

Degree Centrality 34 (17) 1 (16) 33 (12) 3 (10) 2 (9) 4,32 (6) 9,14,24 6,7,8,28,30,31 . . .

Closeness Centrality 1 33 34 329,14,33 20 2 4 . . .

Betweenness Centrality 1 (231) 34 (161) 33 (77) 3 (76) 32 (73) 9 (30) . . .

Martin Everett Problem

Eigenvector Centrality 8 (.470) 9 (.458) 7 (.451) 10 (.346) 11 (.301) 6 (.274) 4 (.177) 12 (.151) 5 (.103) 1,2,3 (.067) 13 (.056)

Degree Centrality 4 6,7,8,9,10 11,12 1,2,3,5,13

Closeness Centrality 7 6 8 9 4 10 11 5 1,2,3,12 13

Betweenness Centrality 6 7 4 8 10 12 9 11 1,2,3,5,13 (0)

Medieval Russian Trade Network

Eigenvector Centrality 10 (.405) 34 (.381) 12 (.350) 8 (.265) 30 (.239) 35 (.237) 11 (.231) 32 (.208) 36 (.201) . . .

Degree Centrality 10,16,34 (5) 8,11,12,14,30,32,35 . . .

Closeness Centrality 34 35 12 10 16,36 11 14 . . .

Betweenness Centrality 34 35 16 10 11 14 23 12 . . .

35 is Moscow 34 is Kolomna See http://www.analytictech.com/networks/pitts.htm on the controversy.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy