Table 1. Graph theoretical properties of peak convergent networks.
Atlas (nodes) | DC | Connections | Density | PL | CC | G.Eff | L Eff | AS |
Common (34) | 0.710.03 | 110 | 0.196 | |||||
P1 | 2.390.08 | 0.470.02 | 0.420.01 | 0.710.04 | 0.120.09 | |||
P2 | 2.420.17 | 0.470.05 | 0.420.03 | 0.720.05 | 0.040.08 | |||
Hammers (44) | 0.740.05 | 152 | 0.161 | |||||
P1 | 2.690.11 | 0.480.02 | 0.370.02 | 0.740.03 | 0.100.10 | |||
P2 | 2.610.11 | 0.480.04 | 0.380.02 | 0.710.03 | 0.060.06 | |||
Freesurfer (68) | 0.660.05 | 242 | 0.106 | |||||
P1 | 2.930.14 | 0.410.03 | 0.340.02 | 0.670.05 | 0.120.06 | |||
P2 | 2.940.18 | 0.430.04 | 0.340.02 | 0.710.04 | 0.020.05 | |||
AAL (78) | 0.700.11 | 427 | 0.142 | |||||
P1 | 2.400.09 | 0.450.03 | 0.420.02 | 0.420.01 | 0.110.07 | |||
P2 | 2.430.04 | 0.470.01 | 0.410.01 | 0.420.01 | 0.070.06 |
Graph theoretical characteristics of subject binary networks thresholded at the peak convergence density. Shown are the mean standard deviation of the graph theoretical properties of Pathlength (PL), Clustering Coefficient (CC), Global Efficiency (G. Eff), Local Efficiency (L. Eff) and Assortativity (AS), across subjects.