Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

The geometric nature of weights in real complex networks.

ABSTRACT: The topology of many real complex networks has been conjectured to be embedded in hidden metric spaces, where distances between nodes encode their likelihood of being connected. Besides of providing a natural geometrical interpretation of their complex topologies, this hypothesis yields the recipe for sustainable Internet's routing protocols, sheds light on the hierarchical organization of biochemical pathways in cells, and allows for a rich characterization of the evolution of international trade. Here we present empirical evidence that this geometric interpretation also applies to the weighted organization of real complex networks. We introduce a very general and versatile model and use it to quantify the level of coupling between their topology, their weights and an underlying metric space. Our model accurately reproduces both their topology and their weights, and our results suggest that the formation of connections and the assignment of their magnitude are ruled by different processes.

SUBMITTER: Allard A

PROVIDER: S-EPMC5253659 | biostudies-literature | 2017 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

The geometric nature of weights in real complex networks.

Allard Antoine A Serrano M Ángeles MÁ García-Pérez Guillermo G Boguñá Marián M

Nature communications 20170118

The topology of many real complex networks has been conjectured to be embedded in hidden metric spaces, where distances between nodes encode their likelihood of being connected. Besides of providing a natural geometrical interpretation of their complex topologies, this hypothesis yields the recipe for sustainable Internet's routing protocols, sheds light on the hierarchical organization of biochemical pathways in cells, and allows for a rich characterization of the evolution of international tra ...[more]

PMID: 28098155

Similar Datasets

The heterogeneity in link weights may decrease the robustness of real-world complex weighted networks.

Project description:Here we report a comprehensive analysis of the robustness of seven high-quality real-world complex weighted networks to errors and attacks toward nodes and links. We use measures of the network damage conceived for a binary (e.g. largest connected cluster LCC, and binary efficiency Effbin) or a weighted network structure (e.g. the efficiency Eff, and the total flow TF). We find that removing a very small fraction of nodes and links with respectively higher strength and weight triggers an abrupt collapse of the weighted functioning measures while measures that evaluate the binary-topological connectedness are almost unaffected. These findings unveil a problematic response-state where the attack toward a small fraction of nodes-links returns the real-world complex networks in a connected but inefficient state. Our findings unveil how the robustness may be overestimated when focusing on the connectedness of the components only. Last, to understand how the networks robustness is affected by link weights heterogeneity, we randomly assign link weights over the topological structure of the real-world networks and we find that highly heterogeneous networks show a faster efficiency decrease under nodes-links removal: i.e. the robustness of the real-world complex networks against nodes-links removal is negatively correlated with link weights heterogeneity.

| S-EPMC6650436 | biostudies-literature

Scaling up real networks by geometric branching growth.

Project description: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.

| S-EPMC8166096 | biostudies-literature

Geometric explanation of the rich-club phenomenon in complex networks.

Project description:The rich club organization (the presence of highly connected hub core in a network) influences many structural and functional characteristics of networks including topology, the efficiency of paths and distribution of load. Despite its major role, the literature contains only a very limited set of models capable of generating networks with realistic rich club structure. One possible reason is that the rich club organization is a divisive property among complex networks which exhibit great diversity, in contrast to other metrics (e.g. diameter, clustering or degree distribution) which seem to behave very similarly across many networks. Here we propose a simple yet powerful geometry-based growing model which can generate realistic complex networks with high rich club diversity by controlling a single geometric parameter. The growing model is validated against the Internet, protein-protein interaction, airport and power grid networks.

| S-EPMC5431775 | biostudies-literature

Geometric Deep Lean Learning: Deep Learning in Industry 4.0 Cyber-Physical Complex Networks.

Project description:In the near future, value streams associated with Industry 4.0 will be formed by interconnected cyber-physical elements forming complex networks that generate huge amounts of data in real time. The success or failure of industry leaders interested in the continuous improvement of lean management systems in this context is determined by their ability to recognize behavioral patterns in these big data structured within non-Euclidean domains, such as these dynamic sociotechnical complex networks. We assume that artificial intelligence in general and deep learning in particular may be able to help find useful patterns of behavior in 4.0 industrial environments in the lean management of cyber-physical systems. However, although these technologies have meant a paradigm shift in the resolution of complex problems in the past, the traditional methods of deep learning, focused on image or video analysis, both with regular structures, are not able to help in this specific field. This is why this work focuses on proposing geometric deep lean learning, a mathematical methodology that describes deep-lean-learning operations such as convolution and pooling on cyber-physical Industry 4.0 graphs. Geometric deep lean learning is expected to positively support sustainable organizational growth because customers and suppliers ought to be able to reach new levels of transparency and traceability on the quality and efficiency of processes that generate new business for both, hence generating new products, services, and cooperation opportunities in a cyber-physical environment.

| S-EPMC7038400 | biostudies-literature

Power-Hop: A Pervasive Observation for Real Complex Networks.

Project description:Complex networks have been shown to exhibit universal properties, with one of the most consistent patterns being the scale-free degree distribution, but are there regularities obeyed by the r-hop neighborhood in real networks? We answer this question by identifying another power-law pattern that describes the relationship between the fractions of node pairs C(r) within r hops and the hop count r. This scale-free distribution is pervasive and describes a large variety of networks, ranging from social and urban to technological and biological networks. In particular, inspired by the definition of the fractal correlation dimension D2 on a point-set, we consider the hop-count r to be the underlying distance metric between two vertices of the network, and we examine the scaling of C(r) with r. We find that this relationship follows a power-law in real networks within the range 2 ≤ r ≤ d, where d is the effective diameter of the network, that is, the 90-th percentile distance. We term this relationship as power-hop and the corresponding power-law exponent as power-hop exponent h. We provide theoretical justification for this pattern under successful existing network models, while we analyze a large set of real and synthetic network datasets and we show the pervasiveness of the power-hop.

| S-EPMC4790966 | biostudies-literature

Deciphering the global organization of clustering in real complex networks.

Project description:We uncover the global organization of clustering in real complex networks. To this end, we ask whether triangles in real networks organize as in maximally random graphs with given degree and clustering distributions, or as in maximally ordered graph models where triangles are forced into modules. The answer comes by way of exploring m-core landscapes, where the m-core is defined, akin to the k-core, as the maximal subgraph with edges participating in at least m triangles. This property defines a set of nested subgraphs that, contrarily to k-cores, is able to distinguish between hierarchical and modular architectures. We find that the clustering organization in real networks is neither completely random nor ordered although, surprisingly, it is more random than modular. This supports the idea that the structure of real networks may in fact be the outcome of self-organized processes based on local optimization rules, in contrast to global optimization principles.

| S-EPMC3755293 | biostudies-literature

A method for creating complex real-world networks using ESRI Shapefiles.

Project description:A classic optimization problem with many real-world applications is optimal route search in graphs or networks. Graphical networks resembling real world networks are an important requirement for these studies. Python packages NetworkX and OSMnx are probably the most popular approaches in industry for creating and analyzing real world graphical networks using ESRI Shapefiles (Geospatial Vector Data). However, creating such a network is a complex and tedious process as these packages require the input data to be in a specific format. In this study,•We outline a flexible method that can be used to easily create graphical network representations in NetworkX or OSMnx using road network topology data stored in ESRI Shapefiles.•A detailed step-by-step process is outlined to successfully transform the ESRI Shapefile data into the compatible format for graph analysis libraries like OSMnx and NetworkX.•A data cleaning strategy is suggested to reduce resource consumption without distorting the actual structure of the graph.This method will allow researchers to efficiently generate graphical networks and validate their theories by evaluating their efficiencies using real-world network data of different sizes and topologies. This method could benefit, but is not limited to, research areas such as Advanced Transportation Systems (ATS), Graph Neural Networks (GNN), Multi-Objective Genetic Algorithms, to mention a few.

| S-EPMC10587512 | biostudies-literature

Geometric de-noising of protein-protein interaction networks.

Project description:Understanding complex networks of protein-protein interactions (PPIs) is one of the foremost challenges of the post-genomic era. Due to the recent advances in experimental bio-technology, including yeast-2-hybrid (Y2H), tandem affinity purification (TAP) and other high-throughput methods for protein-protein interaction (PPI) detection, huge amounts of PPI network data are becoming available. Of major concern, however, are the levels of noise and incompleteness. For example, for Y2H screens, it is thought that the false positive rate could be as high as 64%, and the false negative rate may range from 43% to 71%. TAP experiments are believed to have comparable levels of noise.We present a novel technique to assess the confidence levels of interactions in PPI networks obtained from experimental studies. We use it for predicting new interactions and thus for guiding future biological experiments. This technique is the first to utilize currently the best fitting network model for PPI networks, geometric graphs. Our approach achieves specificity of 85% and sensitivity of 90%. We use it to assign confidence scores to physical protein-protein interactions in the human PPI network downloaded from BioGRID. Using our approach, we predict 251 interactions in the human PPI network, a statistically significant fraction of which correspond to protein pairs sharing common GO terms. Moreover, we validate a statistically significant portion of our predicted interactions in the HPRD database and the newer release of BioGRID. The data and Matlab code implementing the methods are freely available from the web site: http://www.kuchaev.com/Denoising.

| S-EPMC2711306 | biostudies-literature

A comparative analysis of link removal strategies in real complex weighted networks.

Project description:In this report we offer the widest comparison of links removal (attack) strategies efficacy in impairing the robustness of six real-world complex weighted networks. We test eleven different link removal strategies by computing their impact on network robustness by means of using three different measures, i.e. the largest connected cluster (LCC), the efficiency (Eff) and the total flow (TF). We find that, in most of cases, the removal strategy based on the binary betweenness centrality of the links is the most efficient to disrupt the LCC. The link removal strategies based on binary-topological network features are less efficient in decreasing the weighted measures of the network robustness (e.g. Eff and TF). Removing highest weight links first is the best strategy to decrease the efficiency (Eff) in most of the networks. Last, we found that the removal of a very small fraction of links connecting higher strength nodes or of highest weight does not affect the LCC but it determines a rapid collapse of the network efficiency Eff and the total flow TF. This last outcome raises the importance of both to adopt weighted measures of network robustness and to focus the analyses on network response to few link removals.

| S-EPMC7054356 | biostudies-literature

Improved Neural Networks with Random Weights for Short-Term Load Forecasting.

Project description:An effective forecasting model for short-term load plays a significant role in promoting the management efficiency of an electric power system. This paper proposes a new forecasting model based on the improved neural networks with random weights (INNRW). The key is to introduce a weighting technique to the inputs of the model and use a novel neural network to forecast the daily maximum load. Eight factors are selected as the inputs. A mutual information weighting algorithm is then used to allocate different weights to the inputs. The neural networks with random weights and kernels (KNNRW) is applied to approximate the nonlinear function between the selected inputs and the daily maximum load due to the fast learning speed and good generalization performance. In the application of the daily load in Dalian, the result of the proposed INNRW is compared with several previously developed forecasting models. The simulation experiment shows that the proposed model performs the best overall in short-term load forecasting.

| S-EPMC4667993 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data