These network measures correspond to the communicability of brain regions, the connectivity structure, segregation phenomena, and synchronization in a weighted graph. These network features can be computed as shown in the literature [7,32]. Local efficiency of node i (LocEi) is computed as shown in Equation (2). (2)LocEi=1di(di−1)∑j=gi1Li,j where di represents the degree of the node (number of nodes connected to node i), Li,j shows shortest path length between nodes i and j, and gi is a graph of neighbors of node i excluding node i. The local efficiency of the network is calculated by taking the average of all nodes, as shown in Equation (3). (3)LocE=1NLocEi
