Table 1.
Statistical characteristic | Symbol | Equationa,b,c,d | Description | |
---|---|---|---|---|
Degree | k |
|
The total number of edges for a node i | |
Average degree | <k> |
|
The average degree of the network | |
Average path length | L |
|
The mean distance between two nodes, averaged over all pairs of nodes | |
Diameter | D | D = max{dij} | The maximum distance between any pair of nodes | |
Clustering coefficient | C |
|
The probability that two nodes are linked to each other given that they are both connected to node i | |
Degree centrality | Cd |
|
The proportion of other nodes that are adjacent to node i | |
Betweenness centrality | Cb |
|
The proportion of all geodesics between pairs of other nodes that include this node i | |
Closeness centrality | Cc |
|
The number of other nodes divided by the sum of the distances between the node i and all the other nodes |
eij is the numbers of edges from node i to j.
dij is the shortest path length from node i to j.
N is the total number of nodes in the network.
gjk is the numbers of geodesics connecting nodes j and k.