Optimal navigability of weighted human brain connectomes in physical space.

Communication protocols in the brain connectome describe how to transfer information from one region to another. Typically, these protocols hinge on either the spatial distances between brain regions or the intensity of their connections. Yet, none of them combine both factors to achieve optimal efficiency. Here, we introduce a continuous spectrum of decentralized routing strategies that integrates link weights and the spatial embedding of connectomes to route signal transmission. We implemented the protocols on connectomes from individuals in two cohorts and on group-representative connectomes designed to capture weighted connectivity properties. We identified an intermediate domain of routing strategies, a sweet spot, where navigation achieves maximum communication efficiency at low transmission cost. This phenomenon is robust and independent of the particular configuration of weights. Our findings suggest an interplay between the intensity of neural connections and their topology and geometry that amplifies communicability, where weights play the role of noise in a stochastic resonance phenomenon. Such enhancement may support more effective responses to external and internal stimuli, underscoring the intricate diversity of brain functions.

Scaling up real networks by geometric branching growth.

Real networks often grow through the sequential addition of new nodes that connect to older ones in the graph. However, many real systems evolve through the branching of fundamental units, whether those be scientific fields, countries, or species. Here, we provide empirical evidence for self-similar growth of network structure in the evolution of real systems-the journal-citation network and the world trade web-and present the geometric branching growth model, which predicts this evolution and explains the symmetries observed. The model produces multiscale unfolding of a network in a sequence of scaled-up replicas preserving network features, including clustering and community structure, at all scales. Practical applications in real instances include the tuning of network size for best response to external influence and finite-size scaling to assess critical behavior under random link failures.

Geometric renormalization unravels self-similarity of the multiscale human connectome.

Structural connectivity in the brain is typically studied by reducing its observation to a single spatial resolution. However, the brain possesses a rich architecture organized over multiple scales linked to one another. We explored the multiscale organization of human connectomes using datasets of healthy subjects reconstructed at five different resolutions. We found that the structure of the human brain remains self-similar when the resolution of observation is progressively decreased by hierarchical coarse-graining of the anatomical regions. Strikingly, a geometric network model, where distances are not Euclidean, predicts the multiscale properties of connectomes, including self-similarity. The model relies on the application of a geometric renormalization protocol which decreases the resolution by coarse-graining and averaging over short similarity distances. Our results suggest that simple organizing principles underlie the multiscale architecture of human structural brain networks, where the same connectivity law dictates short- and long-range connections between different brain regions over many resolutions. The implications are varied and can be substantial for fundamental debates, such as whether the brain is working near a critical point, as well as for applications including advanced tools to simplify the digital reconstruction and simulation of the brain.

Navigable maps of structural brain networks across species.

Connectomes are spatially embedded networks whose architecture has been shaped by physical constraints and communication needs throughout evolution. Using a decentralized navigation protocol, we investigate the relationship between the structure of the connectomes of different species and their spatial layout. As a navigation strategy, we use greedy routing where nearest neighbors, in terms of geometric distance, are visited. We measure the fraction of successful greedy paths and their length as compared to shortest paths in the topology of connectomes. In Euclidean space, we find a striking difference between the navigability properties of mammalian and non-mammalian species, which implies the inability of Euclidean distances to fully explain the structural organization of their connectomes. In contrast, we find that hyperbolic space, the effective geometry of complex networks, provides almost perfectly navigable maps of connectomes for all species, meaning that hyperbolic distances are exceptionally congruent with the structure of connectomes. Hyperbolic maps therefore offer a quantitative meaningful representation of connectomes that suggests a new cartography of the brain based on the combination of its connectivity with its effective geometry rather than on its anatomy only. Hyperbolic maps also provide a universal framework to study decentralized communication processes in connectomes of different species and at different scales on an equal footing.

Metabolic plasticity in synthetic lethal mutants: Viability at higher cost.

The most frequent form of pairwise synthetic lethality (SL) in metabolic networks is known as plasticity synthetic lethality. It occurs when the simultaneous inhibition of paired functional and silent metabolic reactions or genes is lethal, while the default of the functional partner is backed up by the activation of the silent one. Using computational techniques on bacterial genome-scale metabolic reconstructions, we found that the failure of the functional partner triggers a critical reorganization of fluxes to ensure viability in the mutant which not only affects the SL pair but a significant fraction of other interconnected reactions, forming what we call a SL cluster. Interestingly, SL clusters show a strong entanglement both in terms of reactions and genes. This strong overlap mitigates the acquired vulnerabilities and increased structural and functional costs that pay for the robustness provided by essential plasticity. Finally, the participation of coessential reactions and genes in different SL clusters is very heterogeneous and those at the intersection of many SL clusters could serve as supertargets for more efficient drug action in the treatment of complex diseases and to elucidate improved strategies directed to reduce undesired resistance to chemicals in pathogens.

Popularity versus similarity in growing networks.

The principle that 'popularity is attractive' underlies preferential attachment, which is a common explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting distribution of the number of connections possessed by nodes follows power laws, as observed in many real networks. Preferential attachment has been directly validated for some real networks (including the Internet), and can be a consequence of different underlying processes based on node fitness, ranking, optimization, random walks or duplication. Here we show that popularity is just one dimension of attractiveness; another dimension is similarity. We develop a framework in which new connections optimize certain trade-offs between popularity and similarity, instead of simply preferring popular nodes. The framework has a geometric interpretation in which popularity preference emerges from local optimization. As opposed to preferential attachment, our optimization framework accurately describes the large-scale evolution of technological (the Internet), social (trust relationships between people) and biological (Escherichia coli metabolic) networks, predicting the probability of new links with high precision. The framework that we have developed can thus be used for predicting new links in evolving networks, and provides a different perspective on preferential attachment as an emergent phenomenon.

Geometric Correlations Mitigate the Extreme Vulnerability of Multiplex Networks against Targeted Attacks.

We show that real multiplex networks are unexpectedly robust against targeted attacks on high-degree nodes and that hidden interlayer geometric correlations predict this robustness. Without geometric correlations, multiplexes exhibit an abrupt breakdown of mutual connectivity, even with interlayer degree correlations. With geometric correlations, we instead observe a multistep cascading process leading into a continuous transition, which apparently becomes fully continuous in the thermodynamic limit. Our results are important for the design of efficient protection strategies and of robust interacting networks in many domains.

Essential plasticity and redundancy of metabolism unveiled by synthetic lethality analysis.

We unravel how functional plasticity and redundancy are essential mechanisms underlying the ability to survive of metabolic networks. We perform an exhaustive computational screening of synthetic lethal reaction pairs in Escherichia coli in a minimal medium and we find that synthetic lethal pairs divide in two different groups depending on whether the synthetic lethal interaction works as a backup or as a parallel use mechanism, the first corresponding to essential plasticity and the second to essential redundancy. In E. coli, the analysis of pathways entanglement through essential redundancy supports the view that synthetic lethality affects preferentially a single function or pathway. In contrast, essential plasticity, the dominant class, tends to be inter-pathway but strongly localized and unveils Cell Envelope Biosynthesis as an essential backup for Membrane Lipid Metabolism. When comparing E. coli and Mycoplasma pneumoniae, we find that the metabolic networks of the two organisms exhibit a large difference in the relative importance of plasticity and redundancy which is consistent with the conjecture that plasticity is a sophisticated mechanism that requires a complex organization. Finally, coessential reaction pairs are explored in different environmental conditions to uncover the interplay between the two mechanisms. We find that synthetic lethal interactions and their classification in plasticity and redundancy are basically insensitive to medium composition, and are highly conserved even when the environment is enriched with nonessential compounds or overconstrained to decrease maximum biomass formation.

The D-Mercator method for the multidimensional hyperbolic embedding of real networks.

One of the pillars of the geometric approach to networks has been the development of model-based mapping tools that embed real networks in its latent geometry. In particular, the tool Mercator embeds networks into the hyperbolic plane. However, some real networks are better described by the multidimensional formulation of the underlying geometric model. Here, we introduce D-Mercator, a model-based embedding method that produces multidimensional maps of real networks into the (D + 1)-hyperbolic space, where the similarity subspace is represented as a D-sphere. We used D-Mercator to produce multidimensional hyperbolic maps of real networks and estimated their intrinsic dimensionality in terms of navigability and community structure. Multidimensional representations of real networks are instrumental in the identification of factors that determine connectivity and in elucidating fundamental issues that hinge on dimensionality, such as the presence of universality in critical behavior.

Extracting the multiscale backbone of complex weighted networks.

A large number of complex systems find a natural abstraction in the form of weighted networks whose nodes represent the elements of the system and the weighted edges identify the presence of an interaction and its relative strength. In recent years, the study of an increasing number of large-scale networks has highlighted the statistical heterogeneity of their interaction pattern, with degree and weight distributions that vary over many orders of magnitude. These features, along with the large number of elements and links, make the extraction of the truly relevant connections forming the network's backbone a very challenging problem. More specifically, coarse-graining approaches and filtering techniques come into conflict with the multiscale nature of large-scale systems. Here, we define a filtering method that offers a practical procedure to extract the relevant connection backbone in complex multiscale networks, preserving the edges that represent statistically significant deviations with respect to a null model for the local assignment of weights to edges. An important aspect of the method is that it does not belittle small-scale interactions and operates at all scales defined by the weight distribution. We apply our method to real-world network instances and compare the obtained results with alternative backbone extraction techniques.

Detecting the ultra low dimensionality of real networks.

Reducing dimension redundancy to find simplifying patterns in high-dimensional datasets and complex networks has become a major endeavor in many scientific fields. However, detecting the dimensionality of their latent space is challenging but necessary to generate efficient embeddings to be used in a multitude of downstream tasks. Here, we propose a method to infer the dimensionality of networks without the need for any a priori spatial embedding. Due to the ability of hyperbolic geometry to capture the complex connectivity of real networks, we detect ultra low dimensionality far below values reported using other approaches. We applied our method to real networks from different domains and found unexpected regularities, including: tissue-specific biomolecular networks being extremely low dimensional; brain connectomes being close to the three dimensions of their anatomical embedding; and social networks and the Internet requiring slightly higher dimensionality. Beyond paving the way towards an ultra efficient dimensional reduction, our findings help address fundamental issues that hinge on dimensionality, such as universality in critical behavior.

Erratum: Precision as a measure of predictability of missing links in real networks [Phys. Rev. E 101, 052318 (2020)].

This corrects the article DOI: 10.1103/PhysRevE.101.052318.

Percolation in self-similar networks.

We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering, scale-free graphs with finite clustering and metric structure, growing scale-free networks, and many real networks. The proof and the derivation of the giant component size do not require the assumption that networks are treelike. Our results rely only on the observation that self-similar networks possess a hierarchy of nested subgraphs whose average degree grows with their depth in the hierarchy. We conjecture that this property is pivotal for percolation in networks.

Risk of death after emergency repair of abdominal wall hernias. Still waiting for improvement.

PURPOSE: The precise importance of factors affecting morbidity and mortality in patients with complicated abdominal wall hernias undergoing emergency surgical repair has been not completely elucidated. PATIENTS AND METHODS: A retrospective multicentric study of all patients (n = 402) with abdominal wall hernia who underwent urgent operations over 1-year period was conducted in ten hospitals. Logistic regression analysis was used to evaluate variables that affect morbidity and mortality. RESULTS: Thirty-five percent of patients had inguinal hernia, 22% femoral hernia, 20% umbilical hernia, and 15% incisional hernia. Mesh repair was used in 92.5% of cases. Intestinal resection was required in 49 patients. Perioperative complications occurred in 130 patients, and 18 patients died (mortality rate 4.5%). Complications and mortality rate were significantly higher in the group of intestinal resection. Patients older than 70 years also showed more complications, required intestinal resection more frequently, and had a higher mortality rate than younger patients. In the logistic regression analysis, age over 70 years, intestinal resection, and American Society of Anesthesiologists (ASA) III/IV class emerged as independent predictors of a poor outcome. Based in our results, we propose a simple schema to calculate risk of death in these patients. CONCLUSION: Using multivariate logistic regression analysis, probabilities of death after complicated abdominal wall hernia surgery are increased in patients with: age over 70 years, high ASA class, and associated intestinal resection. Guidelines should be developed to improve prognosis in these patients.

Precision as a measure of predictability of missing links in real networks.

Predicting missing links in real networks is an important open problem in network science to which considerable efforts have been devoted, giving as a result a vast plethora of link prediction methods in the literature. In this work, we take a different point of view on the problem and focus on predictability instead of prediction. By considering ensembles defined by well-known network models, we prove analytically that even the best possible link prediction method, given by the ensemble connection probabilities, yields a limited precision that depends quantitatively on the topological properties-such as degree heterogeneity, clustering, and community structure-of the ensemble. This suggests an absolute limitation to the predictability of missing links in real networks, due to the irreducible uncertainty arising from the random nature of link formation processes. We show that a predictability limit can be estimated in real networks, and we propose a method to approximate such a bound from real-world networks with missing links. The predictability limit gives a benchmark to gauge the quality of link prediction methods in real networks.

The interconnected wealth of nations: Shock propagation on global trade-investment multiplex networks.

The increasing integration of world economies, which organize in complex multilayer networks of interactions, is one of the critical factors for the global propagation of economic crises. We adopt the network science approach to quantify shock propagation on the global trade-investment multiplex network. To this aim, we propose a model that couples a spreading dynamics, describing how economic distress propagates between connected countries, with an internal contagion mechanism, describing the spreading of such economic distress within a given country. At the local level, we find that the interplay between trade and financial interactions influences the vulnerabilities of countries to shocks. At the large scale, we find a simple linear relation between the relative magnitude of a shock in a country and its global impact on the whole economic system, albeit the strength of internal contagion is country-dependent and the inter-country propagation dynamics is non-linear. Interestingly, this systemic impact can be associated to intra-layer and inter-layer scale factors that we name network multipliers, that are independent of the magnitude of the initial shock. Our model sets-up a quantitative framework to stress-test the robustness of individual countries and of the world economy.

Rich-club vs rich-multipolarization phenomena in weighted networks.

Large-scale hierarchies characterize complex networks in different domains. Elements at the top, usually the most central or influential, may show multipolarization or tend to club together, forming tightly interconnected communities. The rich-club phenomenon quantified this tendency based on unweighted network representations. Here, we define this metric for weighted networks and discuss the appropriate normalization which preserves the nodes' strengths and discounts structural strength-strength correlations if present. We find that in some real networks the results given by the weighted rich-club coefficient can be in sharp contrast to the ones in the unweighted approach. We also discuss the ability of the scanning of weighted subgraphs formed by the high-strength hubs to unveil features in contrast to the average: the formation of local alliances in multipolarized environments, or a lack of cohesion even in the presence of rich-club ordering. Beyond structure, this analysis matters for correct understanding of functionalities and dynamical processes relying on hub interconnectedness.

Navigability of temporal networks in hyperbolic space.

Information routing is one of the main tasks in many complex networks with a communication function. Maps produced by embedding the networks in hyperbolic space can assist this task enabling the implementation of efficient navigation strategies. However, only static maps have been considered so far, while navigation in more realistic situations, where the network structure may vary in time, remains largely unexplored. Here, we analyze the navigability of real networks by using greedy routing in hyperbolic space, where the nodes are subject to a stochastic activation-inactivation dynamics. We find that such dynamics enhances navigability with respect to the static case. Interestingly, there exists an optimal intermediate activation value, which ensures the best trade-off between the increase in the number of successful paths and a limited growth of their length. Contrary to expectations, the enhanced navigability is robust even when the most connected nodes inactivate with very high probability. Finally, our results indicate that some real networks are ultranavigable and remain highly navigable even if the network structure is extremely unsteady. These findings have important implications for the design and evaluation of efficient routing protocols that account for the temporal nature of real complex networks.

Detecting the Significant Flux Backbone of Escherichia coli metabolism.

The heterogeneity of computationally predicted reaction fluxes in metabolic networks within a single flux state can be exploited to detect their significant flux backbone. Here, we disclose the backbone of Escherichia coli, and compare it with the backbones of other bacteria. We find that, in general, the core of the backbones is mainly composed of reactions in energy metabolism corresponding to ancient pathways. In E. coli, the synthesis of nucleotides and the metabolism of lipids form smaller cores which rely critically on energy metabolism. Moreover, the consideration of different media leads to the identification of pathways sensitive to environmental changes. The metabolic backbone of an organism is thus useful to trace simultaneously both its evolution and adaptation fingerprints.

Noise-induced polarization switching in complex networks.

The combination of bistability and noise is ubiquitous in complex systems, from biology to social interactions, and has important implications for their functioning and resilience. Here we use a simple three-state dynamical process, in which nodes go from one pole to another through an intermediate state, to show that noise can induce polarization switching in bistable systems if dynamical correlations are significant. In large, fully connected networks, where dynamical correlations can be neglected, increasing noise yields a collapse of bistability to an unpolarized configuration where the three possible states of the nodes are equally likely. In contrast, increased noise induces abrupt and irreversible polarization switching in sparsely connected networks. In multiplexes, where each layer can have a different polarization tendency, one layer is dominant and progressively imposes its polarization state on the other, offsetting or promoting the ability of noise to switch its polarization. Overall, we show that the interplay of noise and dynamical correlations can yield discontinuous transitions between extremes, which cannot be explained by a simple mean-field description.