Maximum betweenness centrality |
Betweenness centrality indicates the number of shortest paths passing through a node. Maximum betweenness centrality indicates the highest value of betweenness centrality in the network. |
Correlates positively with network integration |
Leaf Fraction |
The ratio of the number of nodes with only one edge (i.e. ‘end-points’ in the graph) and the maximum possible number of nodes with only one edge (i.e. the number of nodes minus 1, this indicates a star-shaped graph). |
Correlates positively with network integration |
Diameter |
The length of the longest path in the network. |
Correlates negatively with network integration |
Average eccentricity |
Eccentricity of a node is defined as the longest distance (measured in number of edges) between that node and any other node. Average eccentricity is the artithmetic mean of all nodes. |
Correlates negatively with network integration |