[1] "Degree Centrality:"
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
16 9 10 6 3 4 4 4 5 2 3 1 2 5 2 2 2 2 2 3 2 2 2 5 3 3
27 28 29 30 31 32 33 34
2 4 3 4 4 6 12 17
Bro, can you pass me that leaflet?
Brochure.
[1] "Degree Centrality:"
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
16 9 10 6 3 4 4 4 5 2 3 1 2 5 2 2 2 2 2 3 2 2 2 5 3 3
27 28 29 30 31 32 33 34
2 4 3 4 4 6 12 17
Average distance to all other nodes
Counts the number of shortest paths that go through each node. This is based on the value of being in a “structural hole”
Which of these has the highest betweenness?It’s not what you know, it’s who you know
Directed \[ \frac{\sum(edges)}{N * (N-1)} \]
Undirected: Multiply by 2
How unequal is the centrality between nodes?
Betweenness Centralization scores:
[1] 0.1972789
[1] 1
[1] 0
Does information flow from the top down or in both directions?
[1] "Hierarchy of advice network:"
Mut
0.4761905