Summary
This chapter has shown how to analyze the microscale structure of networks by calculating centrality measures and other node-based measures of network structure. Betweenness centrality identifies bridges and brokers: edges and nodes that connect otherwise poorly connected parts of a network. Eigenvector centrality identifies nodes that are connected to other well-connected nodes. Closeness centrality identifies nodes that are, on average, closest to other nodes. Finally, the triangle count and local clustering coefficient quantify how well-connected a node's friends are. By examining a historical social network of suffragette activists, we saw that ranking highly on one centrality value doesn't necessarily mean a node ranks highly ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access