Download - Social Network Analysis (Part 2)
![Page 2: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/2.jpg)
indegree
In each of the following networks, X has higher centrality than Y according to a particular measure
outdegree betweenness closeness
different notions of centrality
![Page 3: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/3.jpg)
review: indegree
![Page 4: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/4.jpg)
trade in petroleum and petroleum products, 1998, source: NBER-United Nations Trade Data
![Page 5: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/5.jpg)
Quiz Q:
• Which countries have high indegree (import petroleum and petroleum products from many others)• Saudi Arabia• Japan• Iraq• USA• Venezuela
![Page 6: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/6.jpg)
review: outdegree
![Page 7: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/7.jpg)
![Page 8: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/8.jpg)
Quiz Q:
• Which country has low outdegree but exports a significant quantity (thickness of the edges represents $$ value of export) of petroleum products• Saudi Arabia• Japan• Iraq• USA• Venezuela
![Page 9: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/9.jpg)
Undirected degree, e.g. nodes with more friends are more central.
putting numbers to it
![Page 10: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/10.jpg)
divide degree by the max. possible, i.e. (N-1)
normalization
![Page 11: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/11.jpg)
example financial trading networks
high in-centralization: one node buying from many others
low in-centralization: buying is more evenly distributed
real-world examples
![Page 12: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/12.jpg)
In what ways does degree fail to capture centrality in the following graphs?
what does degree not capture?
![Page 13: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/13.jpg)
Brokerage not captured by degree
![Page 14: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/14.jpg)
• intuition: how many pairs of individuals would have to go through you in order to reach one another in the minimum number of hops?
betweenness: capturing brokerage
![Page 15: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/15.jpg)
Where gjk = the number of shortest paths connecting jk gjk(i) = the number that actor i is on.
Usually normalized by:
number of pairs of vertices excluding the vertex itself
betweenness: definition
![Page 16: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/16.jpg)
betweenness on toy networks• non-normalized version:
![Page 17: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/17.jpg)
betweenness on toy networks
• non-normalized version:
A B C ED
A lies between no two other vertices B lies between A and 3 other vertices: C, D, and E C lies between 4 pairs of vertices (A,D),(A,E),(B,D),(B,E)
note that there are no alternate paths for these pairs to take, so C gets full credit
![Page 18: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/18.jpg)
betweenness on toy networks
• non-normalized version:
![Page 19: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/19.jpg)
betweenness on networks• non-normalized version:
A B
C
E
D
why do C and D each have betweenness 1?
They are both on shortest paths for pairs (A,E), and (B,E), and so must share credit: ½+½ = 1
![Page 20: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/20.jpg)
Quiz Question• What is the betweenness of node E?
E
![Page 21: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/21.jpg)
Lada’s old Facebook network: nodes are sized by degree, and colored by betweenness.
betweenness: example
![Page 22: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/22.jpg)
Quiz Q:
Find a node that has high betweenness but low degree
![Page 23: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/23.jpg)
Quiz Q:
Find a node that has low betweenness but high degree
![Page 24: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/24.jpg)
closeness• What if it’s not so important to have many direct
friends?• Or be “between” others• But one still wants to be in the “middle” of things, not
too far from the center
![Page 25: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/25.jpg)
need not be in a brokerage position
![Page 26: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/26.jpg)
Closeness is based on the length of the average shortest path between a node and all other nodes in the network
Closeness Centrality:
Normalized Closeness Centrality
closeness: definition
![Page 27: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/27.jpg)
A B C ED
closeness: toy example
![Page 28: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/28.jpg)
closeness: more examples
![Page 29: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/29.jpg)
Quiz Q:
Which node has relatively high degree but low closeness?
![Page 30: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/30.jpg)
Is everything connected?
![Page 31: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/31.jpg)
• Strongly connected components• Each node within the component can be reached from every other node
in the component by following directed links
Strongly connected components B C D E A G H F
Weakly connected components: every node can be reached from every other node by following links in either direction
A
B
C
DE
FG
H
A
B
C
DE
FG
H
Weakly connected components A B C D E G H F
In undirected networks one talks simply about ‘connected components’
Connected Components
![Page 32: Social Network Analysis (Part 2)](https://reader034.vdocuments.mx/reader034/viewer/2022042717/55d5777abb61eb8b0d8b46a5/html5/thumbnails/32.jpg)
• if the largest component encompasses a significant fraction of the graph, it is called the giant component
Giant component
http://ccl.northwestern.edu/netlogo/models/index.cgi