Table 2.

Traditional measures on a weighted brain graph.

Graph concept	Explanation
Intensity	The intensity of a triangle is the geometric mean of its normalized edge weights (each weight is normalized by the maximum weight in a graph).
Weighted clustering coefficient	The weighted clustering coefficient of a node in a weighted brain graph is the average intensity of triangles in which that node participates. It reflects the tendency to which edges tend to cluster into tightly connected neighborhoods.
Inverse weighted length	The inverse weighted length of a path in a weighted brain graph is the sum of the reciprocals of its edge weights.
Weighted distance	The weighted distance between two distinct vertices in a weighted (brain) graph is the shortest inverse weighted length of any path between them.