Table 1.
Graph metrics used in the study.
| Assortativity | A correlation coefficient between degrees of all nodes between pair of nodes. When assortativity is positive it indicates that nodes tend to connect to other nodes with same or similar degree. |
| Betweenness centrality | High values indicate that nodes participate in a greater number of shortest paths. |
| Characteristic path length (local) | Average shortest path length of a node to the rest of the network. |
| Clustering coefficient | The fraction of a nodes neighbours which are also neighbours of each other. This is zero if nodes are isolated or only connect with one other node. |
| Degree | Total number of links connected to a node. |
| Density | A fraction of present connections to all possible connections in a network. |
| Network global efficiency | Average inverse shortest path length in the network. |
| Network local efficiency | This is calculated as global efficiency on node neighbourhoods. |
| Small-worldness | Measures the extent of how tightly clustered the network is. |