Node-level |
Degree centrality |
•Considers a given node’s number of direct connections•Nodes high in degree centrality have a large number of immediate exchanges of information |
Borgatti (2005)
|
|
Closeness centrality |
•Considers the average shortest path from a given node to all other nodes in the network•Nodes high in closeness centrality can reach all the other nodes in the network in a short number of steps and, therefore, can be efficient in accessing or sharing information |
Wasserman and Faust (1994)
|
|
Betweenness centrality |
•Considers the extent to which a given node is positioned between other nodes on their shortest paths, or geodesics•Nodes high in betweenness centrality can serve as a bridge to transport information or control the interactions between other nodes |
Freeman (1977), Wasserman and Faust (1994)
|
|
Eigenvector centrality |
•Considers the centralities of a given node’s neighbors (in contrast to degree centrality which exclusively relies on the number of connections)•Nodes high in eigenvector centrality are more influential than nodes which have a large number of connections to less central nodes |
Bonacich (2007)
|
Overall network-level |
Diameter |
•Measures the distance between the two nodes furthest apart in the network, or the largest geodesic distance across the entire network•Represents the maximum distance a piece of information needs to travel in a network |
Yamaguchi (1994)
|
|
Mean geodesic distance |
•Measures the average number of shortest steps between pairs of nodes•Reflects the overall connectivity of a network and impacts the extent to which information can be shared among nodes in few steps |
Hanneman and Riddle (2005)
|
|
Clique |
•A cohesive subgroup of nodes that are all directly connected to all others in the group•Members in a clique have constraints in accessing non-redundant information if they do not have ties to nodes outside of the clique |
Haythornthwaite (1996), Hanneman and Riddle (2005)
|
|
Community structure |
•Structures of densely connected subsets of nodes•Represents social groupings, impacting the flow of information within and across those boundaries |
Girvan and Newman (2002)
|