Abstract
Anatomical connectivity between different brain regions can be mapped to a network representation, the connectome, where the intensities of the links, the weights, influence resilience and functional processes. Yet, many features associated with these weights are not fully understood, particularly their multiscale organization. In this paper, we elucidate the architecture of weights, including weak ties, in multiscale human brain connectomes reconstructed from empirical data. Our findings reveal multiscale self-similarity, including the ordering of weak ties, in every individual connectome and group representative. This phenomenon is captured by a renormalization technique based on a geometric network model that replicates the observed structure of connectomes across all length scales, using the same connectivity law and weighting function for both weak and strong ties. The observed symmetry represents a signature of criticality in the weighted connectivity of the human brain and raises important questions for future research, such as the existence of symmetry breaking at some scale or whether it is preserved in cases of neurodegeneration or psychiatric disorder.
Author summary
The human brain is a complex network where anatomical connections between regions, collectively known as the connectome, have varying intensities or weights. These weights influence brain resilience and functional processes, yet their organization across different length scales remains poorly understood. In this study, using human brain data, network geometry models, and a renormalization technique, we reveal that weighted connectomes resemble a fractal structure and exhibit multiscale self-similarity, meaning the same properties are observed at different resolutions. Weak and strong connections follow a consistent pattern and adhere to the same connectivity law across length scales. This multiscale self-similarity includes the organization of weak connections, which conform to the weak ties hypothesis in complex networks, asserting that weak ties are essential to their structure and function by facilitating integration and global information flow. In brain connectomes, we demonstrate that weak ties hold significant neurobiological importance, acting as essential bridges between distinct brain modules at each scale. Our findings not only enhance the understanding of the brain’s multiscale organization but also challenge existing theories that undervalue the role of weak ties in network connectivity, offering a framework to explore their significance in health and disease.
Introduction
The understanding of the interplay between the micro and the macro levels in the brain remains generally poor [1]. A remarkable finding is that the unweighted connectivity structure of hierarchical anatomical reconstructions of human connectomes exhibits self-similar structural features across a range of length scales. This phenomenon is replicated by the geometric network model , which emulates brain connectivity using a geometric representation in the hyperbolic plane [2] and predicts its multiscale unweighted structure via a renormalization group scheme [3]. However, the extent to which the intensities of connections, the link weights, in the brain alter this picture and interweave the multiscale network fabric is still unresolved.
Link weights in complex networks [4–7] are critically related with their vulnerability, resilience, and performance. Remarkably, linking small-scale interactions to macro-level patterns and behaviors was at the backdrop of Granovetter’s insights on the importance of weak ties in social systems [8]. Often perceived as less important, weak links play a crucial role in connecting different groups and facilitating large-scale diffusion of information. While strong ties foster local cohesion within groups, weak ties bridge separate communities, enabling global communication. This paradox highlights how weak ties, though seemingly insignificant, are essential for integrating distinct communities, while reliance on strong ties can slow or even halt the spread of information across a network.
In neuroscience, however, the weights of structural or functional links between brain regions have been frequently overlooked, and the significance of weak links has often been dismissed as negligible. Recent research has challenged this assumption suggesting that weak functional connections hold neurobiological significance and help explain individual differences in cognition and various disorders [9]. Moreover, there is growing evidence that brain networks align with the weak ties hypothesis [10–15]. This offers a solution to how information efficiently flows through the brain’s modular structure. Yet, a new paradox arises from the observation that weak ties also exist within modules alongside strong ties [14], leading to debate over their role in the brain’s organization and possible generative processes. Various theories propose different models for weak tie formation, from an independent random network superimposed on top of the underlying modular network of strong links [10,14,15] to weak ties acting as shortcuts between well-defined, large-world modules connected by strong links [11], or distance-based wiring economy principles [16], but none fully explain the complex interplay of weak and strong links in brain connectivity, leaving the question open for further exploration.
In this paper, we elucidate the multiscale organization of weights in individual human brain connectomes reconstructed from empirical data and in their group representatives. We found multiscale self-similarity in the weights of the connectome links when the observation resolution varies across length scales. The self-similar behavior includes weak ties fulfilling the weak ties hypothesis at all scales. Furthermore, we provide evidence that the observations are well explained by the weighted geometric soft configuration model [17], which uses the same set of rules to model weak and strong links, and its renormalizability [18] supports the observed scale invariance. Additionally, we report that weakly significant ties, defined as those carrying an anomalously small fraction of the local density of connections associated with a brain region, exhibit behavior very similar to weak ties, tending to bridge intermodular gaps at all scales.
Results
Evidence for the self-similarity of the weighted multiscale human brain connectome
We used two datasets for our study comprising a total of 84 weighted connectomes from healthy human subjects [19]. The University of Lausanne (UL) dataset includes connectomes of 40 subjects around 25 years old, obtained from diffusion spectrum MRI images. To test the reliability of our findings, we performed a replication study with an independent dataset from the Human Connectome Project (HCP) [20] consisting of 44 connectomes aged between 22 and 35 years old, derived from T1-weighted and corrected diffusion-weighted magnetic resonance images. The first dataset consists of 16 females and 24 males and the second dataset of 31 females and 11 males. No differences between biological sexes have been observed throughout our analysis.
The structural connectivity matrix between regions of interest (ROIs) of each connectome was computed using deterministic streamline tractography to track neural fibers. See Materials and Methods for more information. Cortex parcellation was conducted at five scales using a fine-graining process applied to 83 ROIs defined by the Desikan-Killiany atlas [21]. As a result, multiscale reconstructions of human brain connectomes organized in five hierarchical layers with increasing anatomical resolution were obtained. The layers contain roughly 1014, 462, 233, 128, and 82 nodes (these numbers fluctuate slightly across subjects, the brainstem was excluded in all of them) and are labeled l = 0 , 1 , 2 , 3 , 4, respectively. As the resolution decreases, each ROI corresponds to a larger parcel of the brain, and the average fiber length of the connections increases [3], since short-distance connections are absorbed inside coarse-grained parcels. See Fig 1A for an illustrative brain representation of the first three layers.
Fig 1. Self-similarity of weighted human brain connectomes across scales. A) Scheme of the anatomically hierarchical reconstruction of the multiscale connectomes. The sketch of the brain has been adapted from “Wisdom Memory Anatomical Intelligence" from ArtDraw.org, under license CC0 1.0 Universal. B, F) Complementary cumulative weight distribution across layers for UL Human 14 and the group-representative, respectively. C, G) Complementary cumulative strength distribution. D, H) Strength-degree relationship. We have computed the average strength for nodes in each degree class. The exponent of the relationship between the two magnitudes in layer l = 0 is displayed in the bottom right corner. E, I) Disparity of weights of connections around nodes. The straight line corresponds to the completely heterogeneous scenario and the orange area to the expectation for a random null model that distributes the strength of nodes locally uniformly at random.
In the multiscale human weighted (MHW) connectomes, nodes correspond to ROIs in the cortical and subcortical regions, and a connection between ROIs i and j denotes the presence of white matter tracts between them. There are different approaches to characterize the intensity of these connections [22], defining link weights . In our work, we use fiber density, i.e., the number of streamlines per unit surface connecting the two brain regions, where each streamline is normalized by its length in millimeters [23]. More specifically, the weight is calculated as
(1) |
where and are the areas of ROIs i and j respectively, is the set of all fibers connecting ROIs i and j, and l(f) is the length of the fiber. The sum of all weights incident to a ROI i define its strength , which is calculated as , where is the degree of ROI i, i.e., the number of other regions to which it is connected. In our datasets, the average weight is almost constant across layers and the average strength decreases slightly with the resolution, see Figs A and B in both S1 File and S2 File.
Additionally, for each dataset, we constructed the distance-dependent consensus-based threshold weighted group-representative introduced in Ref. [24]. In this group-representative, the consensus threshold is not imposed uniformly over all connections but changes as a function of the distance [25]. The final weight of a consensus connection is randomly chosen from the set of weights associated with it at the subject-level. In this way, the group-representative captures not only the topological distance-based organization of individual connectomes but also their weighted properties. See Materials and Methods for a detailed description of the group-representative construction procedure.
For each layer l of each MHW connectome and group-representative, we measured the following features: complementary cumulative weight distribution , complementary cumulative strength distribution , the dependency between strength and degree for each degree class , and the disparity , which quantifies the local heterogeneity of weights by measuring their variability in the connections attached to a given ROI, see Materials and Methods for more details. The results are very similar for all subjects. The properties of subject 14 in the UL dataset are shown in Fig 1B–1E, and Fig 1F–>1I> show the results for the UL group-representative. The results for the rest of the connectomes in the UL dataset, the connectomes in the HCP dataset and the group-representative of the HCP dataset are reported in Figs C–F in both S1 File and S2 File, and Fig M in S2 File.
We found that the curves of the complementary cumulative weight distributions of the different layers in each connectome overlap almost perfectly and denote a highly heterogeneous distribution of weights, which range over four orders of magnitude, Fig 1B. As shown in Fig 1C, the complementary cumulative strength distributions have an analogous self-similar behavior and the curves at the different resolutions coincide. However, the value of the maximum strength decreases slightly with the resolution. The relationship between strength and degree exhibits a power-law behavior at all scales, , Fig 1D. The particular values of the exponent η are reported in Table A in both S1 File and S2 File for subjects in the UL and HCP datasets, respectively, and are typically below but close to one. This implies that the strength of hub regions is less than expected due to their connectivity, and it is opposite to the common situation in complex networks, where the strength of nodes tends to grow superlinearly with the degree.
Finally, Fig 1E shows the local distribution of weights in the connections of ROIs for each degree class as measured by the disparity function Υ ( k ) , which quantifies how unevenly the strength attributed to a brain region is distributed among its connections. We can observe that the data points representing the nodes in the different layers of the MHW connectomes lie in between the completely heterogeneous scenario,Υ ( k ) = k, and the completely homogeneous one, Υ ( k ) = 1, and are significantly different from the expectation given by a local random distribution of weights, represented by the orange shadowed area, see Materials and Methods. Fig 1F–1I and Fig M in S2 File show that the group-representatives are fully consistent and in good agreement with the obtained subject-level results for all magnitudes at all resolution scales in both datasets.
Organization of weak ties across scales
We analyzed how the weak ties hypothesis relates to the observed self-similarity of the MHW connectomes. First, we checked the occurrence of the weak ties hypothesis in each layer of each connectome by measuring the tendency of weak ties to concentrate across modules, defined as groups of densely interconnected ROIs. To identify the modules we employed the Louvain algorithm for community detection in unweighted networks [26]. Ignoring weights in the detection of modules ensures that the obtained partition is not directly influenced by weights. Even though module detection was performed in each layer separately, modules at different resolutions significantly overlap, as reported in Fig G in both S1 File and S2 File, and previously in Ref. [3].
Once the structural modules were detected, we calculated the weak ties spectrum by applying a filter on the links of the connectomes. The stringency of the filter could be regulated with a threshold value, and the variation of the threshold resulted in a nested hierarchy of filtered connectomes. For each filtered connectome, we computed the density of intermodular connections , where n denotes the percentage of edges remaining in the connectome after applying the filter. This density is defined as the ratio between the number of links connecting ROIs in different modules and the total number of links in the filtered connectome. Then, we normalized this measure by , which is the density of intermodular connections for n = 100, i.e., in the original connectome where all edges remain. The resulting measure will be referred as normalized density of intermodular connections, . We implemented this procedure using two different weight filtering methods: a global threshold and the disparity filter [27].
To apply a global threshold, we ranked all connections by weight from lowest to highest and kept a given percentage of the ones with the lowest weight, see Fig 2A for an illustrative sketch. The normalized density of intermodular connections exhibits an exponential decrease when the percentage of connections considered increases, and this happens in all layers and in all connectomes. For instance, Fig 2B shows that when we consider only the top 1% of the links with lowest weight the normalized density of intermodular connections doubles the value we get when considering 100% of the connections. All subjects exhibit similar behavior, as reported in Fig H in S1 File. These results indicate clearly that the connections with smaller weights tend to link nodes belonging to different modules in MHW connectomes, in precise agreement with the weak ties hypothesis.
Fig 2. Weak-ties spectra. A) Scheme of the filtering procedure and definition of the weak ties statistic. The filters select a percentage of connections with the lowest weight or confidence, respectively. B, E) Normalized density of intermodular connections versus percentage of edges remaining in the subgraphs filtered by thresholding weights. X-axis in log scale. Results for UL Human 14 and the group-representative, respectively. C, F) Same as B and E, where subgraphs are obtained by thresholding confidence 1 − α. D, G) Average weight of intramodular links compared with average weight of intermodular links.
Alternatively, we used the disparity filter for weighted networks [27]. The disparity filter is a method aimed at detecting relevant connections by assessing which observed weights deviate significantly from expected values under the null hypothesis that weights are locally distributed uniformly at random. A confidence value measures the reliance of the deviation and can range between 0 and 1, where a higher value indicates higher reliability that the edge weight is not due to random chance. Edges with lower confidence than a specified threshold can be considered compatible with the null hypothesis and not significant. The confidence for each connection is calculated as , where is the probability that an observed weight is consistent with the hypothesis of random weights, see Materials and Methods. Interestingly, the results for the weak ties hypothesis when filtering by increasing confidence instead of weight yielded similar behavior to the global threshold filter, as portrayed in Fig 2C, where the curves decay exponentially. The curves show similar behavior for the weak ties spectrum in all layers and in all connectomes, see also Fig I in S1 File. The coincident results can be attributed to the correlation between weights and confidence, where smaller weights tend to be associated with smaller confidences. However, this relationship is not linear; rather, we observe considerable variation in confidence values for weights in the middle of the spectrum. The inset in Fig 2C corresponds to the weight-confidence relationship for layer 0, but similar results are found for other layers, see Fig J in S1 File.
Analogous results for the HCP dataset can be found in Figs H–J in S2 File. In most subjects of this dataset, the curves of stay almost constant until 10% of connections are considered and then decay exponentially when the percentage is further increased.
Additionally to the filtering approach, we also compared the average weight of intramodular and intermodular connections, i.e., connections linking ROIs within and between modules, respectively. For intramodular connections, we calculated the mean of the average values found for all separate modules. In the two datasets, we observed that intramodular connections generally have larger weights than intermodular connections, as shown in Fig 2D and in Fig K in both S1 File and S2 File. Furthermore, we corroborated that, as expected, using the weighted Louvain algorithm strengthened the alignment of the results with the weak ties hypothesis, revealing a more pronounced difference between average intramodular and intermodular weights, see Fig L in both S1 File and S2 File. The effect is more pronounced for the connectomes in the HCP dataset, which manifest a greater gap between the average weight inside and outside modules as compared to connectomes in the UL dataset.
Fig 2E–2G reports the results of the analysis of the weak ties hypothesis for the UL group-representative, which compared to the results for all UL subjects shown in Figs H, I and K in S1 File, can be considered as illustrative of the cohort. The results for the group-representative of the HCP dataset can be found in Figs N and O in S2 File, and are also in good agreement with the individual connectomes, Figs H, I and K in S2 File.
Taken together, our results indicate that the weak ties hypothesis holds at all the scales of the MHW connectomes analyzed in our study, and that the behavior is similar in all layers, with the two smallest ones more affected by finite size effects. Moreover, the results are independent of the specific method used to detect the communities; see Figs M and N in S1 File, which display the weak ties spectra with communities calculated using Infomap [28] and SBM [29], respectively.
A model for the organization of weights in MHW connectomes
The observed scale invariance of weight patterns, including the organization of weak ties, in the MHW connectomes of the two datasets can be explained in terms of the geometric renormalization technique for weighted networks introduced in Ref. [18]. This methodology is based on the model [17], which extends the geometric hyperbolic interpretation of real networks [30,31] to their weighted organization.
The model. The model explains the simultaneous occurrence of weak and strong ties in a connectome by applying a distance-dependent connectivity law between ROIs and assigning distance-dependent weights to them. The distances are not Euclidean but obtained by embedding the connectomes in an underlying hyperbolic plane, which serves as the natural space for representing their hierarchical and small-world organization. Once the hyperbolic coordinates of the ROIs have been estimated, the weighted renormalization protocol can be applied to produce a multiscale unfolding of the connectome over a range of length scales.
The coordinates are such that the hyperbolic distances are maximally congruent with the observed connectivity, effectively described by the geometric soft configuration model [32] or its isomorphic formulation in hyperbolic geometry, the model [33]. In the model, each ROI i has a similarity coordinate, , and a popularity, . Popularities are hidden variables that control the expected degrees k, and similarities are angular coordinates in a one-dimensional sphere or circle of radius R = N ∕ ( 2π ) , such that angular distances between pairs of ROIs stand for all factors other than degrees that affect the propensity of forming connections. Pairs of ROIs have a likelihood of being connected that grows with the product of popularities and decreases with the distance between the ROIs in the latent similarity space, akin to a gravity law. This probability function reads , where , μ controls the average degree, and β > 1 controls the clustering of the network ensemble and quantifies the level of coupling between the network topology and the metric space. The equivalent formulation is purely geometric. In this formulation, the popularity coordinate becomes a radial position in the hyperbolic disk with higher degree nodes located closer to the center of the disk, while the similarity coordinate remains as in the model, and the probability of connection depends on distances in the hyperbolic plane. As proved in Ref. [2], the hyperbolic geometric model replicates accurately the unweighted structure of brain connectomes across species. The effectiveness of hyperbolic geometry for brain connectivity analysis has been further demonstrated by recent research [34,35].
Extending this paradigm to describe weighted connections, the model [17] couples the weights in the links to the same underlying metric space to which the topology is coupled in the model. Weights are assigned on top of the topology generated by the model, and the weight between two connected ROIs i and j is given by
(2) |
The distance refers to the distance between the ROIs in the similarity space, and 0 ≤ τ < 1 is the coupling of the weighted structure to the metric space such that if τ = 0 weights are independent of the underlying geometry and maximally dependent on degrees, while τ = 1 implies that weights are maximally coupled to the underlying metric space with no direct contribution of the degrees. The variable is a random variable with mean equal to one and the variance of which regulates the level of statistical noise in the weights. To simplify, we assumed here the noiseless version of the model, that is, . In this case, the coupling constant τ is inferred by using the triangle inequality violation spectrum as described in Ref. [17]. Finally, a hidden variable , named the hidden strength of ROI i, controls the distribution of strengths. The free parameter ν can be chosen such that and ⟨ s ⟩ = ⟨ σ ⟩ .
The coordinates that maximize the likelihood that the topology of a connectome is reproduced by the model can be estimated by embedding the connectome in the latent space using statistical inference techniques [36]. The obtained maps offer a quantitative meaningful representation where ROIs that are more interrelated occupy closer locations [2]. We obtained hyperbolic embeddings of the higher resolution layer in each MHW connectome using the mapping tool Mercator [36]. To check the accuracy of the embedding, we used the parameters β and μ inferred by Mercator to generate an ensemble of 100 synthetic networks with the model, see Fig 3F and Ref. [3] for further validation of the topological properties. We then added weights to the links using Eq (2), for which we used observed degrees and strengths as proxies of hidden degrees and hidden strengths, and assumed a deterministic relation between these hidden variables and of the form , as observed in the real connectomes. The topological and weighted properties of the synthetic networks in the generated ensemble were computed and compared with those of the empirical connectomes. Fig 3A–3F shows the results for the complementary cumulative weight distribution, the complementary cumulative strength distribution, the average weight by degree class, the relationship between strength and degree, the normalized density of intermodular connections, the disparity, the complementary cumulative degree distribution and the degree-dependent clustering coefficient for UL subject 14. The results display a remarkable agreement between the connectome and the average of the synthetic ensemble, meaning that our model generates networks which reproduce the topological and weighted properties of the original connectomes accurately. See also Fig O in S1 File for the comparison between the strength of a node and its value of σ generated with the adjusted parameters. In Fig 3D, the qualitative behavior of the weak ties spectrum is correctly portrayed by the model. In Fig 3G, we display the hyperbolic map of the l = 0 connectome where each color represents a different module, while in Fig 3H we highlight the modules on a standard brain representation in Euclidean space. The nodes belonging to the same module appear concentrated in nearby positions both in the Euclidean and the similarity space, implying that physical distances in the connectome have an important role in determining similarity distances in the hyperbolic representation. Taken together, these results prove that the model reproduces accurately the connectivity and weighted structure of the MHW connectomes.
Fig 3. The model for l = 0 of UL Human 14. Red dots correspond to the empirical data using 30 bins (20 bins in the inset). The blue lines correspond to the average value obtained from 100 synthetic networks generated with the model, and the pink regions show the standard deviation around the expected value. A) Complementary cumulative weight distribution. B) Complementary cumulative strength distribution, and average weight by degree class in the inset. C) Strength-degree relationship. D) Normalized density of intermodular connections. E) Disparity in weights around nodes. F) Topological properties: complementary cumulative degree distribution, and degree-dependent clustering coefficient in the inset. G) Louvain modules in hyperbolic space. H) Louvain modules in a dorsal view of the brain from above (in Euclidean space).
We emphasize that networks generated using Euclidean distance instead of similarity distance in the connection probability of the model differ significantly from observations (see Fig 5 in [3]), proving that Euclidean distances alone are insufficient to fully account for the wiring of human brain connectomes. Furthermore, the multiscale effects introduced by the parcellation process in real connectomes inherently affect the multiscale nature of the nodes in the network representation. However, the multiscale properties of these networks encompass not only the nodes but also the connections between them which, as discussed, are influenced by factors beyond Euclidean distances alone. Thus, the multiscale effect introduced by parcellation cannot fully account for the observed self-similarity in the connectomes.
Scale transformation. Based on the obtained map coordinates, the high resolution connectomes at l = 0 can be unfolded into a multiscale sequence of self-similar layers by applying the geometric renormalization of weights (GRW) protocol. This process relies on the renormalizability of the model [18]. The GRW transformation proceeds in two steps, Fig 4A illustrates the process. First, a geometric renormalization technique for unweighted networks [37] is applied. Second, weights are renormalized.
Fig 4. Geometric renormalization of weighted connectomes. A) Figure adapted from Ref. [18]. Each scaled layer is obtained after a GRW step with resolution r starting from the embedding of the original connectome at l = 0. Each ROI i in blue has an angular position on the similarity space and its size is proportional to the logarithm of its hidden degree. Straight solid lines represent the links in each layer with weights denoted by their thickness. Coarse-graining blocks correspond to the orange shadowed areas, and dashed blue lines connect ROIs to their supernodes in layer l + 1. Two supernodes in layer l + 1 are connected if some ROI of one supernode in layer l is connected to some ROI of the other, with the supremum of the weights of the links between the constituent ROIs serving as the weight of the new connection. Note that the transformation with r = 4 goes from l = 0 to l = 2 in a single step due to the semigroup property. B–G) Self-similarity of UL connectome 14 along the GRW flow. Comparison of values obtained from the empirical data (points) and the model (solid lines). B) Complementary cumulative weight distributions. C) Complementary cumulative strength distributions. Inset: strength-degree relationship, where the average strength is shown for each degree class. D) Disparity in weights around nodes. E) Normalized density of intermodular connections thresholding by weight, X-axis in log scale. F) Normalized density of intermodular connections thresholding by confidence, X-axis in log scale. G) Average weight of intramodular links compared to average weight of intermodular links. In B, C and G weights, strengths, and degrees are rescaled by the average weight, average strength, or average degree of the respective layer.
Briefly, the first step in the renormalization technique is to delimit non-overlapping consecutive sectors along the similarity space containing each r consecutive ROIs, independently of whether those are anatomically connected (note that it is not mandatory for the sectors to be homogeneous in terms of the contained number of ROIs). Sectors are then coarse-grained to form supernodes. The specific angular position of each supernode is not relevant as far as it lays within the angular region defined by the corresponding block so that the order of supernodes preserves the original order of ROIs. Finally, the connections are rescaled by connecting two supernodes if there is at least one connection between the ROIs in one supernode and the ROIs in the other. In this way, a coarse-grained version of the topology of the original connectome with decreased resolution and progressively longer range connections is produced. The process can be iterated up to steps to avoid finite size effects. The average degree of the otherwise scale-invariant topologies of the connectomes increases slightly in the GR flow but, according to statistical tests, in a way that is compatible with an almost constant average degree. We refer to Ref. [3] for a complete description of the unweighted renormalization protocol and results on the same datasets used in this study.
GRW proceeds by defining the weight of the link between two supernodes as the maximum, or supremum, of the weights among the existing links between their constituent nodes in the original layer. This approach is named the sup-GRW scale transformation, and it is a very good approximation in real networks to the theoretical scale transformation that ensures the renormalizability of the model [18], more challenging in practical terms. The sup-GRW transformation has semigroup structure with respect to the composition, meaning that a certain number of iterations of a given resolution are equivalent to a single transformation of higher resolution. Note that the average weight increases in the sup-GRW renormalization flow by construction, see Fig P in both S1 File and S2 File for the results in the connectomes of the UL and HCP datasets respectively.
GRW flow vs MHW connectomes. We applied iteratively sup-GRW with r = 2 to the higher resolution layer at l = 0 to produce a multiscale unfolding with a total of five layers for each MHW connectome in our study. We found that the GRW transformation preserves the topological and weighted features of the connectomes at each scale. In Fig 4B–4D, we show a comparison of the weighted features of the multiscale connectome generated in the GRW flow and the same features in the MHW connectome of UL subject 14; the results for all subjects in the UL and HCP datasets can be found in Figs Q–T in both S1 File and S2 File. More specifically, we compared the complementary cumulative weight distribution, the complementary cumulative strength distribution, the relationship between strength and degree, and the disparity, layer by layer. Degrees, strengths and weights were rescaled by the average of the corresponding layer. The agreement between all magnitudes for the MHW and GRW connectomes is remarkable.
To answer the question whether GRW is also able to replicate the weak ties ordering and its behavior across scales in the empirical MHW connectomes, we calculated the normalized densities of intermodular weights on the GRW connectomes using the global weight filter and the disparity filter. The results are shown in Fig 4E and 4F, respectively. The original trend is replicated, which proves that GRW is clearly able to reproduce the observations. Again, the agreement is worse in the last two layers l = 3 and l = 4, which are more affected by finite size effects. In Fig 4G, we show that the rescaled mean weights of the connections inside and outside modules in the GRW and MHW connectomes are also in good agreement. The results for all subjects in the datasets are shown in Figs U–W in both S1 File and S2 File.
Therefore, we conclude that the GRW flow reproduces effectively the observed self-similarity in the weighted structure of MHW connectomes and the organization of weak and strong ties at each scale.
Self-similarity and weak ties
To clarify further the interplay between scale invariance and the organization of weak ties, we compared the weighted features of the MHW connectomes with the corresponding results obtained from two null models. The first null model is the Coordinate-Preserving Weight-Reshuffling (CP-WR) protocol, which creates surrogates that preserve the geometry and topology of the MHW connectomes, but reassigns the weights of the connections at random. As a result, weights are decoupled from the topology and the underlying geometry. We reshuffled the weights of the connections in each MHW layer and compared the results with the original empirical observations. In the second null model, we performed GRW after reshuffling the positions of the nodes in the similarity space of l = 0. This randomization decouples topology and weights from geometry, such that the coarse-graining does not preserve the original definition of modules. We call it Coordinate-Reshuffling Geometric Renormalization Weighted (CR-GRW) null model. Reshuffling weights and positions at random is a stochastic process and can give different final configurations. Therefore, for each null model we averaged the results over 10 realizations.
The comparison of the results obtained for the null models and the original MHW connectome of subject 14 in the UL dataset is shown in Fig 5, while the results for the group-representatives of the two datasets are shown in Fig X in both S1 File and S2 File. In the CP-WR surrogates, the curves of the complementary cumulative distributions of weight and strength of all layers maintain the original overlap, see Fig 5A and 5C. However, in Fig 5B and 5D we can see that the CR-GRW curves of the different layers are not superimposed anymore. Therefore, reshuffling weights does not affect the self-similarity of the distributions while reshuffling the positions breaks it. In fact, CR-GRW also breaks the self-similarity of the degree distribution, as observed in the inset of Fig 5B. The results displayed in the inset of Fig 5C show that, even though in CP-WR the self-similarity is not broken, reshuffling the weights causes the exponent of the relationship to get closer to one. In Fig 5E and 5F, we show the comparison of the original normalized density of intermodular connections after applying the global weight filter and the results obtained for the CP-WR and CR-GRW surrogates, respectively. The values of for the null models remain constant while varying the threshold of the filter, which implies that they do not fulfil the weak ties hypothesis. Note that layer l = 4 in the CR-GRW surrogate has been so largely damaged that the module detection algorithm only finds a single group. Therefore, there are no intermodular links to calculate .
Fig 5. Comparison of the MHW connectome of UL Subject 14 with random surrogates. Left column: CP-WR. Right column: CR-GRW. In all the graphs, the dots correspond to empirical data and the curves to the random surrogates. A, B) Complementary cumulative weight distributions. Inset in B: complementary cumulative degree distributions. C, D) Complementary cumulative strength distributions. Inset in C: exponent of the relationship. E, F) Normalized density of intermodular connections versus percent of edges considered by global thresholding. The standard deviation of the null model ensemble is represented by the shadowed area. In the CR-GRW, weight and strength have been rescaled by the average weight and strength of the corresponding layer.
Discussion
The investigation into how the intensities of anatomical connections between different regions in the human brain are organized at various macroscopic resolution lengths revealed several key findings: i) self-similarity emerges as a pervasive symmetry in the multiscale organization of anatomical weights in connectomes; ii) the weak ties hypothesis is validated. This contrasts with previous assertions that weak ties play no role in brain modular organization [14]. The aforementioned observations are reproducible using the model and the sup-GRW transformation. The results indicate that the fractal behavior of weights and the intermodular role of weak ties in the MHW connectomes are interrelated architectural hallmarks derived from a unique set of connectivity rules that shape human weighted connectomes across the various length scales analyzed in this study.
The unveiled self-similarity of the weighted features of MHW connectomes is not merely a byproduct of their self-similar unweighted topological properties. In complex networks, weights play a crucial role by adding a layer of information that can significantly influence the interregional connectivity and communicability in unexpected ways. Our analysis of MHW connectomes reveals that high-degree nodes tend to exhibit lower strength compared to what would be expected by extrapolating from nodes with lower degrees. This suggests that forming connections with new regions comes at the expense of mitigating the reinforcement of existing ones, and indicates a non-trivial interplay between the connectome’s weights and topology, and thus, between weights and the underlying hyperbolic geometry.
In our approach, both the topology and the weighted structure of connectomes share a common metric space with hyperbolic geometry, which is the natural geometry able to explain simultaneously the hierarchical and small-world nature of brain connectomes, where distances rule both the occurrence of links and their intensities. Our results challenge previous claims in studies of cortical networks [10,15], which posited that weaker anatomical connections are more topologically random than stronger ones, leading to the conclusion that they do not substantially contribute to the global topology of a weighted brain graph and may represent stochastic factors in connectome development. In contrast, our perspective surpass the need for separate models for weak and strong ties in brain networks; instead, a single weighted connectivity law in our renormalizable model effectively captures the findings across all scales examined.
A crucial aspect of our modeling framework is that it explains the non-uniform placement of weak links as a consequence of weights decreasing with distance. This aligns with neuroanatomical evidence showing that weaker connections tend to span longer distances than stronger ones, due to an economy principle driven by the energetic and metabolic costs of constructing and maintaining axonal signaling bundles, costs that increase with distance [16,24,38–40]. This explains why weak ties are the ones linking different structural modules, which are distant in space and require longer connections that consequently exhibit weaker weights. Increasing the weights is more biologically costly as distance increases and, thus, strong weights are preferentially found within more localized mesostructrures. Therefore, weak ties are not uniformly placed. Within our framework, weak and strong ties follow the same geometric model, which accurately replicates their specific distribution.
The multiscale self-similarity of human connectomes, in particular of their modular organization and weight distribution, ensures that the spectra representing the weak ties phenomenon are invariant across scales. This self-similarity indicates the system’s ability to display consistent statistical properties across different scales of observation. Critical systems often demonstrate such fractal behavior, reflecting their organization at a cross-roads point between various phases or states. Self-organized criticality, in particular, is typically observed in slowly driven non-equilibrium systems with many degrees of freedom and strong nonlinear dynamics, and has been recognized as a plausible source of natural complexity [41–44]. This implies that evolution may adjust the control parameters of brain structure to precise critical values that sustain this observed self-similarity, potentially offering advantages in terms of robustness and simplicity, as this avoids the need for a set of connectivity rules at every scale. These concepts lead us to the idea of evolutionary criticality, meaning that critical or quasi-critical states are achieved by evolutionary drift.
Therefore, MHW connectomes exhibit the same weighted statistical properties across all scales of observation explored in this study, indicating an organizational principle that spans different macroscopic levels. Our results raise many interesting questions for future work. For instance, if length scales were fine-grained to produce higher resolution connectomes, is there a resolution threshold where the observed symmetry breaks? Also, our results were derived using data from healthy individuals. Given that some neurodegenerative diseases present changes in the connectivity patterns as compared to healthy subjects, it remains unknown to what extent self-similarity is preserved in these cases. Furthermore, the universal role of weak ties in primates could also be studied as multiscale and higher-resolution data becomes available for primates such as the macaque. Further investigations in the future will clarify as well other critical questions regarding the role and ordering of weak connections in high-level neural computations and anomalous or developmental brain states. In a broader perspective, our work is relevant for complex networks in general and suggests that, as other structural properties, multiscale self-similarity, explainable by geometric renormalization, could potentially be one ubiquitous symmetry in the weighted structure of real-world networks.
Materials and methods
Description of the datasets
The University of Lausanne (UL) dataset consists of 40 connectomes of healthy individuals (16 females), with an average age of approximately 25 years old. These connectomes were reconstructed from diffusion spectrum MRI images (DSIs), and whole-brain deterministic streamline tractography was conducted on the DSI data to track neural fibers connecting regions of interest (ROIs). This process involved a random initialization of 32 streamline propagations (seeds) per diffusion direction per white-matter voxel. The fiber streamlines were tracked following directions of maximum diffusion and were grown in two opposite directions with a 1-mm fixed step. Tracking continued until the change in direction exceeded 60 degrees/mm or both ends exited the white-matter mask. The Connectome Mapper Toolkit [45] was used to process the data.
For cross validation, we used a dataset from the Human Connectome Project (HCP) [20], which comprises 44 connectomes (31 females) from subjects aged 22 to 35 years old. These connectomes were derived from T1-weighted and corrected diffusion-weighted magnetic resonance images (DWIs). Employing Dipy [46], the corrected DWI of each subject was used to fit a second-order tensor for each voxel and its various voxelwise scalar maps. Additionally, the DWIs were employed to determine the intravoxel fiber orientation distribution function (fODF) using the Constrained Spherical Deconvolution approach [47], which applies high-angular resolution to determine the orientation of multiple intravoxel fiber populations within white-matter regions with complex architecture, and it is integrated into MRtrix3 (https://www.mrtrix.org/). Then, the streamlines distribution for each subject was obtained through the SDSTREM deterministic fiber-tracking algorithm [48].
Structural connectivity matrices were obtained for each connectome in both datasets. The matrices include both hemispheres, with connection intensities between ROIs determined by the density of streamlines linking them. The cortex was parcellated at five different resolutions through a fine-graining process applied to the 83 ROIs outlined by the Desikan-Killiany atlas, as detailed in Ref. [21]. Further details on the data acquisition and processing can be found in Ref. [3], where the connectomes were analyzed to assess their multiscale organization. The navigability properties of the weighted higher resolution layers were studied in Ref. [24].
Construction of the group-representative
We constructed a group-representative weighted connectome for each layer of each dataset. To select the connections in the group representative, we used the distance-dependent consensus-based threshold method outlined in Refs. [25,49]. Initially, all edges present in individual subjects were binned based on their length into an arbitrary number of sufficient bins, in our case 22. Since connection length can vary slightly between humans due to different brain sizes and individual specificities, we used the average distance in the cohort for that connection to select the corresponding bin. Then, within each bin, we kept a certain number of the connections with greater consensus across subjects. The quantity of connections retained per bin was determined as the average across subjects of the number of connections in that bin at the subject level. For instance, if the average number of connections across subjects within bin i was , we preserved the most frequently occurring edges in that bin. When choosing between two connections with equal consensus, the one with higher average weight was selected. This process was independently executed for inter- and intra-hemispheric connections to prevent under-representation of inter-hemispheric links.
In Ref. [24] we observed that the typical averaging approach [50] to determine the connection weights in group-representatives distorts some of their weighted properties. To address this issue, we implemented an alternative approach where the weight assigned to a connection is randomly selected from all weights in the dataset related to that connection. Different realizations of this selection procedure yielded consistent outcomes. Our group-representative, termed distance-dependent weighted (DDW) group-representative, preserves the weighted properties of the original connectomes.
Hyperbolic maps of MHW connectomes
We embedded each connectome into hyperbolic space using the algorithm Mercator introduced in Ref. [36]. Mercator inputs the network adjacency matrix ( if there is a link between nodes i and j, and otherwise) and returns the inferred hidden degrees, angular positions of ROIs in the similarity space, and the global model parameters. More precisely, the hyperbolic coordinates were inferred by finding the hidden degree and angular position of each node, and , that maximize the likelihood L that the structure of the network was generated by the model, where
(3) |
Probability is the connection probability in the model , where , μ controls the average degree, and β > 1 controls the clustering of the network ensemble and quantifies the coupling between the network topology and the metric space. In Fig 3A–3F, we show the comparison of the topological and weighted properties of layer l = 0 of the connetome of UL subject 14 with synthetic reconstructions generated with the model. The agreement between measures validates our approach.
These hyperbolic embeddings are used as the starting point in the geometric renormalization weighted (GRW) process.
Disparity in weights around nodes
At the local level, the organization of weights in complex networks can be characterized by the disparity function [27], which measures the variability in the weights of the connections attached to a ROI i. The disparity function reads
(4) |
where is the number of connections of a node, i.e., its degree, and is the sum of all weights incident to a ROI, i.e., its strength. If the strength is homogeneously distributed between all connections, . On the contrary, if just one link accumulates all the strength .
If the normalized weights associated with node i were uniformly distributed at random, the disparity would be consistent with the null model , where the average E and the variance V are
(5) |
and
(6) |
Here υ = 2. This null model is based on the null hypothesis that the normalized weights of the connections of a node are generated by random assignment from a uniform distribution. In particular, for a node of degree k, we randomly distribute k–1 points in the interval from 0 to 1, such that the interval ends up split into k subintervals. Then, the length of the subinterval represents the expected value for the normalized weight of each link according to the null hypothesis. Consequently, this scenario is equivalent to a locally random distribution of weights.
For each connection, we can calculate the probability that its normalized weight is compatible with the null hypothesis, which states that weights around ROIs are distributed uniformly at random. Namely
(7) |
where k is degree of the ROI. This probability quantifies the likelihood that, if the null hypothesis is true, one obtains a value for the weight larger than or equal to the observed one. Connections where reject the null hypothesis and can be considered as significant heterogeneities due to the network-organizing principles.
Supporting information
(PDF)
(PDF)
Acknowledgments
We thank Robert Jankowski for helpful discussions about community detection in networks.
Data Availability
The datasets used in the manuscript are publicly available on Zenodo, DOI doi: 10.5281/zenodo.14017270.
Funding Statement
M.A.S. acknowledges support from grant PID2022-137505NB-C22 funded by MICIU/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, and Generalitat de Catalunya grant number 2021SGR00856. L.B. acknowledges support from an FPU21/03183 grant from the Spanish Government. M.Z. acknowledges support from National Natural Science Foundation of China (Grants No. 12005079), the Natural Science Foundation of Jiangsu Province (Grant No. BK20220511), the funding for Scientific Research Startup of Jiangsu University (Grant No. 4111710001), and Jiangsu Specially-Appointed Professor Program. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
References
- 1.Betzel RF, Bassett DS. Multi-scale brain networks. Neuroimage. 2017;160:73–83. doi: 10.1016/j.neuroimage.2016.11.006 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 2.Allard A, Serrano MÁ. Navigable maps of structural brain networks across species. PLoS Comput Biol 2020;16(2):e1007584. doi: 10.1371/journal.pcbi.1007584 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 3.Zheng M, Allard A, Hagmann P, Alemán-Gómez Y, Serrano MÁ. Geometric renormalization unravels self-similarity of the multiscale human connectome. Proc Natl Acad Sci U S A 2020;117(33):20244–53. doi: 10.1073/pnas.1922248117 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 4.Barrat A, Barthélemy M, Pastor-Satorras R, Vespignani A. The architecture of complex weighted networks. Proc Natl Acad Sci U S A 2004;101(11):3747–52. doi: 10.1073/pnas.0400087101 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 5.Serrano MA, Boguñá M, Pastor-Satorras R. Correlations in weighted networks. Phys Rev E Stat Nonlin Soft Matter Phys. 2006;74(5 Pt 2):055101. doi: 10.1103/PhysRevE.74.055101 [DOI] [PubMed] [Google Scholar]
- 6.Serrano MA. Rich-club vs rich-multipolarization phenomena in weighted networks. Phys Rev E Stat Nonlin Soft Matter Phys. 2008;78(2 Pt 2):026101. doi: 10.1103/PhysRevE.78.026101 [DOI] [PubMed] [Google Scholar]
- 7.Zhou C, Kurths J. Dynamical weights and enhanced synchronization in adaptive complex networks. Phys Rev Lett 2006;96(16):164102. doi: 10.1103/PhysRevLett.96.164102 [DOI] [PubMed] [Google Scholar]
- 8.Granovetter MS. The strength of weak ties. Am J Sociol 1973;78(6):1360–80. doi: 10.1086/225469 [DOI] [Google Scholar]
- 9.Santarnecchi E, Galli G, Polizzotto NR, Rossi A, Rossi S. Efficiency of weak brain connections support general cognitive functioning. Hum Brain Mapp 2014;35(9):4566–82. doi: 10.1002/hbm.22495 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 10.Pajevic S, Plenz D. The organization of strong links in complex networks. Nat Phys. 2012;8429–36. doi: 10.1038/nphys2257 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 11.Gallos LK, Makse HA, Sigman M. A small world of weak ties provides optimal global integration of self-similar modules in functional brain networks. Proc Natl Acad Sci U S A 2012;109(8):2825–30. doi: 10.1073/pnas.1106612109 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 12.Markov NT, Ercsey-Ravasz M, Lamy C, Ribeiro Gomes AR, Magrou L, Misery P, et al. The role of long-range connections on the specificity of the macaque interareal cortical network. Proc Natl Acad Sci U S A 2013;110(13):5187–92. doi: 10.1073/pnas.1218972110 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 13.Goulas A, Schaefer A, Margulies DS. The strength of weak connections in the macaque cortico-cortical network. Brain Struct Funct 2015;220(5):2939–51. doi: 10.1007/s00429-014-0836-3 [DOI] [PubMed] [Google Scholar]
- 14.DYBALLA L, BARBOSA VC. Further insights into the interareal connectivity of a cortical network. Net Sci 2015;3(4):526–50. doi: 10.1017/nws.2015.19 [DOI] [Google Scholar]
- 15.Ypma RJF, Bullmore ET. Statistical analysis of tract-tracing experiments demonstrates a dense, complex cortical network in the mouse. PLoS Comput Biol 2016;12(9):e1005104. doi: 10.1371/journal.pcbi.1005104 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 16.Ercsey-Ravasz M, Markov NT, Lamy C, Van Essen DC, Knoblauch K, Toroczkai Z, et al. A predictive network model of cerebral cortical connectivity based on a distance rule. Neuron 2013;80(1):184–97. doi: 10.1016/j.neuron.2013.07.036 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 17.Allard A, Serrano MÁ, García-Pérez G, Boguñá M. The geometric nature of weights in real complex networks. Nat Commun. 2017;8:14103. doi: 10.1038/ncomms14103 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 18.Zheng M, García-Pérez G, Boguná M, Serrano M. Geometric renormalization of weighted networks. Commun Phys 2024;7(1):97. doi: 10.1038/s42005-024-01589-7 [DOI] [Google Scholar]
- 19.Barjuan L, Soriano J, Aleman-Gomez Y, Hagmann P, Serrano M. Á. Dataset: UL and HCP multiscale weighted human brain connectomes; 2024. Available from: doi: 10.5281/zenodo.14017270 [DOI] [Google Scholar]
- 20.Van Essen DC, Ugurbil K, Auerbach E, Barch D, Behrens TEJ, Bucholz R, et al. The human connectome project: a data acquisition perspective. Neuroimage 2012;62(4):2222–31. doi: 10.1016/j.neuroimage.2012.02.018 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 21.Cammoun L, Gigandet X, Meskaldji D, Thiran JP, Sporns O, Do KQ, et al. Mapping the human connectome at multiple scales with diffusion spectrum MRI. J Neurosci Methods 2012;203(2):386–97. doi: 10.1016/j.jneumeth.2011.09.031 [DOI] [PubMed] [Google Scholar]
- 22.Gast H, Assaf Y. Weighting the structural connectome: exploring its impact on network properties and predicting cognitive performance in the human brain. Netw Neurosci 2024;8(1):119–37. doi: 10.1162/netn_a_00342 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 23.Hagmann P, Cammoun L, Gigandet X, Meuli R, Honey CJ, Wedeen VJ, et al. Mapping the structural core of human cerebral cortex. PLoS Biol 2008;6(7):e159. doi: 10.1371/journal.pbio.0060159 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 24.Barjuan L, Soriano J, Serrano MÁ. Optimal navigability of weighted human brain connectomes in physical space. Neuroimage. 2024;297:120703. doi: 10.1016/j.neuroimage.2024.120703 [DOI] [PubMed] [Google Scholar]
- 25.Betzel RF, Griffa A, Hagmann P, Mišić B. Distance-dependent consensus thresholds for generating group-representative structural brain networks. Netw Neurosci 2019;3(2):475–96. doi: 10.1162/netn_a_00075 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 26.Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. J Stat Mech. 2008;2008(10):P10008. doi: 10.1088/1742-5468/2008/10/p10008 [DOI] [Google Scholar]
- 27.Serrano MA, Boguñá M, Vespignani A. Extracting the multiscale backbone of complex weighted networks. Proc Natl Acad Sci U S A 2009;106(16):6483–8. doi: 10.1073/pnas.0808904106 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 28.Edler D, Holmgren A, Rosvall M. The MapEquation software package. 2025 [Google Scholar]
- 29.Peixoto TP. Bayesian stochastic blockmodeling. Advances in network clustering and blockmodeling. 2019; p. 289–332. [Google Scholar]
- 30.Boguñá M, Bonamassa I, De Domenico M, Havlin S, Krioukov D, Serrano MÁ. Network geometry. Nat Rev Phys 2021;3(2):114–35. doi: 10.1038/s42254-020-00264-4 [DOI] [Google Scholar]
- 31.Serrano MA, Boguñá M. The shortest path to network geometry: a practical guide to basic models and applications. Elements in structure and dynamics of complex networks. Cambridge University Press; 2022. [Google Scholar]
- 32.Serrano MA, Krioukov D, Boguñá M. Self-similarity of complex networks and hidden metric spaces. Phys Rev Lett 2008;100(7):078701. doi: 10.1103/PhysRevLett.100.078701 [DOI] [PubMed] [Google Scholar]
- 33.Krioukov D, Papadopoulos F, Kitsak M, Vahdat A, Boguñá M. Hyperbolic geometry of complex networks. Phys Rev E Stat Nonlin Soft Matter Phys. 2010;82(3 Pt 2):036106. doi: 10.1103/PhysRevE.82.036106 [DOI] [PubMed] [Google Scholar]
- 34.Longhena A, Guillemaud M, Fallani F, Migliaccio R, Chavez M. Hyperbolic embedding of brain networks detects regions disrupted by neurodegeneration. arXiv preprint 2024 [Google Scholar]
- 35.Zhang H, Rich PD, Lee AK, Sharpee TO. Hippocampal spatial representations exhibit a hyperbolic geometry that expands with experience. Nat Neurosci 2023;26(1):131–9. doi: 10.1038/s41593-022-01212-4 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 36.García-Pérez G, Allard A, Serrano M, Boguná M. Mercator: uncovering faithful hyperbolic embeddings of complex networks. New J Phys 2019;21(12):123033. doi: 10.1088/1367-2630/ab57d2 [DOI] [Google Scholar]
- 37.García-Pérez G, Bogun M, Serrano M. Multiscale unfolding of real networks by geometric renormalization. Nat Phys 2018;14(6):583–9. doi: 10.1038/s41567-018-0072-5 [DOI] [Google Scholar]
- 38.Roberts JA, Perry A, Lord AR, Roberts G, Mitchell PB, Smith RE, et al. The contribution of geometry to the human connectome. Neuroimage. 2016;124(Pt A):379–93. doi: 10.1016/j.neuroimage.2015.09.009 [DOI] [PubMed] [Google Scholar]
- 39.Markov NT, Ercsey-Ravasz M, Van Essen DC, Knoblauch K, Toroczkai Z, Kennedy H. Cortical high-density counterstream architectures. Science. 2013;342(6158):1238406. doi: 10.1126/science.1238406 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 40.Rosen BQ, Halgren E. A whole-cortex probabilistic diffusion tractography connectome. eNeuro. 2021;8(1):ENEURO.0416-20.2020. doi: 10.1523/ENEURO.0416-20.2020 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 41.Hesse J, Gross T. Self-organized criticality as a fundamental property of neural systems. Front Syst Neurosci. 2014;8:166. doi: 10.3389/fnsys.2014.00166 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 42.Munoz M. Colloquium: criticality and dynamical scaling in living systems. Rev Mod Phys. 2018:90(3);031001. [Google Scholar]
- 43.Vidiella B, Guillamon A, Sardanyés J, Maull V, Pla J, Conde N, et al. Engineering self-organized criticality in living cells. Nat Commun 2021;12(1):4415. doi: 10.1038/s41467-021-24695-4 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 44.Plenz D, Ribeiro TL, Miller SR, Kells PA, Vakili A, Capek EL. Self-organized criticality in the brain. Front Phys. 2021;9:639389. doi: 10.3389/fphy.2021.639389 [DOI] [Google Scholar]
- 45.Tourbier S, Aleman-Gomez Y, Mullier E, Griffa A, Bach Cuadra M, Hagmann P. Connectomicslab/connectomemapper3: connectome Mapper v3.0.0-beta-RC1; 2020. Available from: https://github.com/connectomicslab/connectomemapper3 [Google Scholar]
- 46.Garyfallidis E, Brett M, Amirbekian B, Rokem A, van der Walt S, Descoteaux M, et al. Dipy, a library for the analysis of diffusion MRI data. Front Neuroinform. 2014;8:8. doi: 10.3389/fninf.2014.00008 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 47.Tournier J-D, Calamante F, Connelly A. Robust determination of the fibre orientation distribution in diffusion MRI: non-negativity constrained super-resolved spherical deconvolution. Neuroimage 2007;35(4):1459–72. doi: 10.1016/j.neuroimage.2007.02.016 [DOI] [PubMed] [Google Scholar]
- 48.Tournier J, Calamante F, Connelly A. MRtrix: Diffusion tractography in crossing fiber regions. Int J Imaging Syst Tech 2012;22(1):53–66. doi: 10.1002/ima.22005 [DOI] [Google Scholar]
- 49.Mišić B, Betzel RF, Nematzadeh A, Goñi J, Griffa A, Hagmann P, et al. Cooperative and competitive spreading dynamics on the human connectome. Neuron 2015;86(6):1518–29. doi: 10.1016/j.neuron.2015.05.035 [DOI] [PubMed] [Google Scholar]
- 50.van den Heuvel MP, Sporns O. Rich-club organization of the human connectome. J Neurosci 2011;31(44):15775–86. doi: 10.1523/JNEUROSCI.3539-11.2011 [DOI] [PMC free article] [PubMed] [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Supplementary Materials
(PDF)
(PDF)
Data Availability Statement
The datasets used in the manuscript are publicly available on Zenodo, DOI doi: 10.5281/zenodo.14017270.