Table 1.

Network properties (definitions are based on [Stam and van Straaten, 2012])

N	Nodes	Number of nodes in the network
M	Links	Number of links in the MST
C	Clustering	The unweighted clustering coefficient describes the likelihood that neighbors of a vertex are also connected, and it quantifies the tendency of network elements to form local clusters. We used the weighted equivalent of this measure to characterize local clustering.
	Path length	Measure for integration; path with lowest sum of link weights between two nodes
k	Degree	Number of neighbors for a given node in the MST or the whole network
L	Leaf fraction	Fraction of leaf nodes in the MST where a leaf node is defined as a node with degree one
D	Diameter	Longest shortest path of an MST
T h	Tree hierarchy	A hierarchical metric that quantifies the trade‐off between large scale integration in the MST and the overload of central nodes.
κ	Degree divergence	Measure of the broadness of the degree distribution