Scribd
Upload
158 views6 pages

Degree Centrality

The document discusses three measures of centrality - degree centrality, closeness centrality, and betweenness centrality. It provides the scores and standardized scores for 7 nodes on each measure based on the given network. It then discusses two example networks (Network A and Network B) and uses the provided equations to calculate the centrality scores for each network on each measure. Network A has a score of 1 for all measures, indicating it is fully centralized, while Network B has a score of 0 for all measures, indicating it is not centralized at all. The document concludes by discussing some advantages and disadvantages of centralized versus non-centralized networks.

Uploaded by

karpagam jeyakumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
158 views6 pages

Degree Centrality

The document discusses three measures of centrality - degree centrality, closeness centrality, and betweenness centrality. It provides the scores and standardized scores for 7 nodes on each measure based on the given network. It then discusses two example networks (Network A and Network B) and uses the provided equations to calculate the centrality scores for each network on each measure. Network A has a score of 1 for all measures, indicating it is fully centralized, while Network B has a score of 0 for all measures, indicating it is not centralized at all. The document concludes by discussing some advantages and disadvantages of centralized versus non-centralized networks.

Uploaded by

karpagam jeyakumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Degree Centrality

Standardized
Node Score
Score
1 1 1/6
2 1 1/6
3 3 3/6 = 1/2
4 2 2/6 = 1/3
5 3 3/6 = 1/2
6 2 2/6 = 1/3
7 2 2/6 = 1/3

Closeness Centrality

Standardized
Node Score
Score
1 1/16 6/16 = 3/8
2 1/16 6/16 = 3/8
3 1/11 6/11
4 1/10 6/10 = 3/5
5 1/11 6/11
6 1/15 6/15 = 2/5
7 1/15 6/15 = 2/5

Betweenness Centrality
Standardized
Node Score
Score
1 0 0
2 0 0
3 16/3 16/45
4 13/3 13/45
5 13/3 13/45
6 0 0
7 0 0

Use equations 6.8, 6.9, and 6.10 on Page 171 in the


textbook for this question. The basic idea of centrality for
entire graph is to calculate average deviance of each node
from the most central node.

Degree centrality (Equation 6.8)


Network A
Node 1 - centrality score 3
Node 2 - centrality score 1
Node 3 - centrality score 1
Node 4 - centrality score 1
The maximum score is 3.
Use Eq.6.8
((3-3)+(3-1)+(3-1)+(3-1))/(16-12+2) = (0+2+2+2)/6 = 1
The degree centrality score of Network A is 1.
Network B
Node 1 - centrality score 3
Node 2 - centrality score 3
Node 3 - centrality score 3
Node 4 - centrality score 3
The maximum score is 3.
Use Eq.6.8
((3-3)+(3-3)+(3-3)+(3-3))/(16-12+2) = (0+0+0+0)/6 = 0
The degree centrality score of Network B is 0.
Thus, Network A is more centralized than Network B for
degree centrality.

Closeness centrality (Equation 6.9)


* You need to use standardized score.
Network A
Node 1 - centrality score 3/3 = 1
Node 2 - centrality score 3/5
Node 3 - centrality score 3/5
Node 4 - centrality score 3/5
The maximum score is 3/3 = 1.
Use Eq.6.9.
((1-1)+(1-3/5)+(1-3/5)+(1-3/5))/((16-12+2)/(8-3))
= (0+2/5+2/5+2/5)/(6/5)
= (6/5)/(6/5) = 1 .
The closeness centrality score of Network A is 1.
Network B
Node 1 - centrality score 3/3 = 1
Node 2 - centrality score 3/3 = 1
Node 3 - centrality score 3/3 = 1
Node 4 - centrality score 3/3 = 1
The maximum score is 1.
Use Eq.6.9.
((1-1)+(1-1)+(1-1)+(1-1))/((16-12+2)/(8-3)) =
(0+0+0+0)/(6/5) = 0
The closeness centrality score of Network B is 0.
Thus, Network A is more centralized than Network B for
closeness centrality.

Betweenness centrality (Equation 6.10)


* You need to use standardized score.
Network A
Node 1 - centrality score 3/3 = 1
Node 2 - centrality score 0
Node 3 - centrality score 0
Node 4 - centrality score 0
The maximum score is 3/3 = 1.
Use Eq.6.10.
((1-1)+(1-0)+(1-0)+(1-0))/(4-1) = (0+1+1+1)/3 = 1.
The closeness centrality score of Network A is 1.
Network B
Node 1 - centrality score 0
Node 2 - centrality score 0
Node 3 - centrality score 0
Node 4 - centrality score 0
The maximum score is 0.
Use Eq.6.10.
((0-0)+(0-0)+(0-0)+(0-0))/(4-1) = (0+0+0+0)/3 = 0
The closeness centrality score of Network B is 0.
Thus, Network A is more centralized than Network B for
betweenness centrality.
I note that centrality score of Network A is 1 for any
centrality measures while centrality score of Network B is
0 for any centrality measures because Network A is the
maximally centralized network with four nodes and
Network B is the non-centralized network with four nodes.

(b) Comparing the centralized and non-centralized graph


above, discuss advantages and disadvantages of centralized
network.
This is an open-ended question. The aim of the question is
to let you imagine some centralized and non-centralized
networks in the real world and compare them. Since this
course is a sociology course, it is important that you apply
the mathematical approach to actual social
phenomenon. I give you a sample answer.

A Sample Answer
If the network represents information flow, Node 1 in
Network A has huge controllability of information flow. If
node 1 works very well, the network is very efficient
because there is no redundant edges in the
network. However, if node 1 does not work, node 2, 3, and
4 are isolated. In this sense, Network A is risky in that
efficiency of information flow totally depends on node 1's
performance. On the other hand, Network B is more
flexible. Even if node 1 does not work, all other nodes can
still communicate one another. However, in another
sense, this network has many redundant edges. If it takes
costs to make edges, this network is very costly.

You might also like