Metric Definition Reference
Betweenness The frequency of a node is in the shortest path between others in the network. (Newman, 2010)
Closeness Reciprocal average shortest path length between a node and all other nodes. (Lentz et al., 2016)
Clustering coefficient The proportion of neighbours who are also neighbours of another. (Watts and Strogatz, 1998)
Degree The number of edges attached to a node. In directed networks in-degree and out-degree correspond to the number of edges pointing inward to and outward from those nodes. (Newman, 2010)
Density The density of a graph is the ratio of the number of edges and the number of possible edges. (Wasserman et al., 1994)
Diameter The longest geodesic between any pair of nodes in the network (maximum shortest path length). (Wasserman et al., 1994)
Average shortest path length Average steps to go from two randomly chosen nodes. (Lentz et al., 2016)
Giant strongly connected component (GSCC) Subset of nodes mutually accessible to each other via a series of links, is an estimate of the lower bound of the maximum epidemic size. (Kao et al., 2007)
Giant weakly connected component (GWCC) Contains a strongly connected component as well as nodes that are linked in one direction or the other, but not both, is an estimate of the upper bound of the maximum epidemic size. (Kao et al., 2007)