Figure 1.

Calculation of C and L. a. The clustering coefficient (C) of node i is informative about the local connectedness of the network and is given by the ratio of the number of connections between the direct neighbors of node i and the maximum number of possible connections between the neighbors of node i. b. Characteristic path length (L) of node i gives information about how close it is to all other nodes in the network. It is calculated by averaging the distance d _{( i , j )} to all other nodes j in the network. The distance d _{( i , j )} between the two nodes is defined as the minimum number of edges that have to be crossed to get from i to j.