Table 5 Topological parameters assessed in this study
Parameter | Definition |
|---|---|
Connected Components | It is the number of networks in which any two vertices are connected to each other by links, and which is connected to no additional vertices in the network. |
Number of nodes | It is the total number of molecules involved. |
Number of edges | It is the total number of interactions found. |
Clustering coefficient | It is calculated as CI = 2nI/kI(kI–1), where nI is the number of links connecting the kI neighbors of node I to each other. It is a measure of how the nodes tend to form clusters. |
Network diameter | It is the longest of all the calculated shortest paths in a network. |
Shortest paths | The length of the shortest path between two nodes n and m is L(n,m). The shortest path length distribution gives the number of node pairs (n,m) with L(n,m) = k for k = 1,2,… |
Characteristic path length | It is the expected distance between two connected nodes. |
Averaged number of neighbors | It is the mean number of connections of each node. |
Node degree | It is the number of interaction of each node. |
Node degree distribution | It represents the probability that a selected nodes has k links. |
Îł | Exponent of node degree equation. |
R2 | Coefficient of determination of node degree vs. number of nodes, on logarithmized data. |