Browse
Submit Data
Databases
API
Help

Dataset Information

38 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Scale free is not rare in international trade networks.

ABSTRACT: Failing to consider the strong correlations between weights and topological properties in capacity-weighted networks renders test results on the scale-free property unreliable. According to the preferential attachment mechanism, existing high-degree nodes normally attract new nodes. However, in capacity-weighted networks, the weights of existing edges increase as the network grows. We propose an optimized simplification method and apply it to international trade networks. Our study covers more than 1200 product categories annually from 1995 to 2018. We find that, on average, 38%, 38% and 69% of product networks in export, import and total trade are scale-free. Furthermore, the scale-free characteristics differ depending on the technology. Counter to expectations, the exports of high-technology products are distributed worldwide rather than concentrated in a few developed countries. Our research extends the scale-free exploration of capacity-weighted networks and demonstrates that choosing appropriate filtering methods can clarify the properties of complex networks.

SUBMITTER: Liu L

PROVIDER: S-EPMC8233329 | biostudies-literature | 2021 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Scale free is not rare in international trade networks.

Liu Linqing L Shen Mengyun M Tan Chang C

Scientific reports 20210625 1

Failing to consider the strong correlations between weights and topological properties in capacity-weighted networks renders test results on the scale-free property unreliable. According to the preferential attachment mechanism, existing high-degree nodes normally attract new nodes. However, in capacity-weighted networks, the weights of existing edges increase as the network grows. We propose an optimized simplification method and apply it to international trade networks. Our study covers more t ...[more]

PMID: 34172820

Similar Datasets

Scale-free networks are rare.

Project description:Real-world networks are often claimed to be scale free, meaning that the fraction of nodes with degree k follows a power law k-α, a pattern with broad implications for the structure and dynamics of complex systems. However, the universality of scale-free networks remains controversial. Here, we organize different definitions of scale-free networks and construct a severe test of their empirical prevalence using state-of-the-art statistical tools applied to nearly 1000 social, biological, technological, transportation, and information networks. Across these networks, we find robust evidence that strongly scale-free structure is empirically rare, while for most networks, log-normal distributions fit the data as well or better than power laws. Furthermore, social networks are at best weakly scale free, while a handful of technological and biological networks appear strongly scale free. These findings highlight the structural diversity of real-world networks and the need for new theoretical explanations of these non-scale-free patterns.

| S-EPMC6399239 | biostudies-literature

Networks of military alliances, wars, and international trade.

Project description:We investigate the role of networks of alliances in preventing (multilateral) interstate wars. We first show that, in the absence of international trade, no network of alliances is peaceful and stable. We then show that international trade induces peaceful and stable networks: Trade increases the density of alliances so that countries are less vulnerable to attack and also reduces countries' incentives to attack an ally. We present historical data on wars and trade showing that the dramatic drop in interstate wars since 1950 is paralleled by a densification and stabilization of trading relationships and alliances. Based on the model we also examine some specific relationships, finding that countries with high levels of trade with their allies are less likely to be involved in wars with any other countries (including allies and nonallies), and that an increase in trade between two countries correlates with a lower chance that they will go to war with each other.

| S-EPMC4687585 | biostudies-literature

Subnets of scale-free networks are not scale-free: sampling properties of networks.

Project description:Most studies of networks have only looked at small subsets of the true network. Here, we discuss the sampling properties of a network's degree distribution under the most parsimonious sampling scheme. Only if the degree distributions of the network and randomly sampled subnets belong to the same family of probability distributions is it possible to extrapolate from subnet data to properties of the global network. We show that this condition is indeed satisfied for some important classes of networks, notably classical random graphs and exponential random graphs. For scale-free degree distributions, however, this is not the case. Thus, inferences about the scale-free nature of a network may have to be treated with some caution. The work presented here has important implications for the analysis of molecular networks as well as for graph theory and the theory of networks in general.

| S-EPMC555505 | biostudies-literature

Emergent scale-free networks.

Project description:Many complex systems-from the Internet to social, biological, and communication networks-are thought to exhibit scale-free structure. However, prevailing explanations require that networks grow over time, an assumption that fails in some real-world settings. Here, we explain how scale-free structure can emerge without growth through network self-organization. Beginning with an arbitrary network, we allow connections to detach from random nodes and then reconnect under a mixture of preferential and random attachment. While the numbers of nodes and edges remain fixed, the degree distribution evolves toward a power-law with an exponent γ=1+1p that depends only on the proportion p of preferential (rather than random) attachment. Applying our model to several real networks, we infer p directly from data and predict the relationship between network size and degree heterogeneity. Together, these results establish how scale-free structure can arise in networks of constant size and density, with broad implications for the structure and function of complex systems.

| S-EPMC11223655 | biostudies-literature

Estimating international trade status of countries from global liner shipping networks.

Project description:Maritime shipping is a backbone of international trade and, thus, the world economy. Cargo-loaded vessels travel from one country's port to another via an underlying port-to-port transport network, contributing to international trade values of countries en route. We hypothesize that ports that involve trans-shipment activities serve as a third-party broker to mediate trade between two foreign countries and contribute to the corresponding country's status in international trade. We test this hypothesis using a port-level dataset of global liner shipping services. We propose two indices that quantify the importance of countries in the global liner shipping network and show that they explain a large amount of variation in individual countries' international trade values and related measures. These results support a long-standing view in maritime economics, which has yet to be directly tested, that countries that are strongly integrated into the global maritime transportation network have enhanced access to global markets and trade opportunities.

| S-EPMC7657917 | biostudies-literature

Spectra of weighted scale-free networks.

Project description:Much information about the structure and dynamics of a network is encoded in the eigenvalues of its transition matrix. In this paper, we present a first study on the transition matrix of a family of weight driven networks, whose degree, strength, and edge weight obey power-law distributions, as observed in diverse real networks. We analytically obtain all the eigenvalues, as well as their multiplicities. We then apply the obtained eigenvalues to derive a closed-form expression for the random target access time for biased random walks occurring on the studied weighted networks. Moreover, using the connection between the eigenvalues of the transition matrix of a network and its weighted spanning trees, we validate the obtained eigenvalues and their multiplicities. We show that the power-law weight distribution has a strong effect on the behavior of random walks.

| S-EPMC4669447 | biostudies-other

Are RNA networks scale-free?

Project description:A network is scale-free if its connectivity density function is proportional to a power-law distribution. It has been suggested that scale-free networks may provide an explanation for the robustness observed in certain physical and biological phenomena, since the presence of a few highly connected hub nodes and a large number of small-degree nodes may provide alternate paths between any two nodes on average-such robustness has been suggested in studies of metabolic networks, gene interaction networks and protein folding. A theoretical justification for why many networks appear to be scale-free has been provided by Barabási and Albert, who argue that expanding networks, in which new nodes are preferentially attached to highly connected nodes, tend to be scale-free. In this paper, we provide the first efficient algorithm to compute the connectivity density function for the ensemble of all homopolymer secondary structures of a user-specified length-a highly nontrivial result, since the exponential size of such networks precludes their enumeration. Since existent power-law fitting software, such as powerlaw, cannot be used to determine a power-law fit for our exponentially large RNA connectivity data, we also implement efficient code to compute the maximum likelihood estimate for the power-law scaling factor and associated Kolmogorov-Smirnov p value. Hypothesis tests strongly indicate that homopolymer RNA secondary structure networks are not scale-free; moreover, this appears to be the case for real (non-homopolymer) RNA networks.

| S-EPMC7052049 | biostudies-literature

International Trade Modelling Using Open Flow Networks: A Flow-Distance Based Analysis.

Project description:This paper models and analyzes international trade flows using open flow networks (OFNs) with the approaches of flow distances, which provide a novel perspective and effective tools for the study of international trade. We discuss the establishment of OFNs of international trade from two coupled viewpoints: the viewpoint of trading commodity flow and that of money flow. Based on the novel model with flow distance approaches, meaningful insights are gained. First, by introducing the concepts of trade trophic levels and niches, countries' roles and positions in the global supply chains (or value-added chains) can be evaluated quantitatively. We find that the distributions of trading "trophic levels" have the similar clustering pattern for different types of commodities, and summarize some regularities between money flow and commodity flow viewpoints. Second, we find that active and competitive countries trade a wide spectrum of products, while inactive and underdeveloped countries trade a limited variety of products. Besides, some abnormal countries import many types of goods, which the vast majority of countries do not need to import. Third, harmonic node centrality is proposed and we find the phenomenon of centrality stratification. All the results illustrate the usefulness of the model of OFNs with its network approaches for investigating international trade flows.

| S-EPMC4646344 | biostudies-literature

Resonant learning in scale-free networks.

Project description:Large networks of interconnected components, such as genes or machines, can coordinate complex behavioral dynamics. One outstanding question has been to identify the design principles that allow such networks to learn new behaviors. Here, we use Boolean networks as prototypes to demonstrate how periodic activation of network hubs provides a network-level advantage in evolutionary learning. Surprisingly, we find that a network can simultaneously learn distinct target functions upon distinct hub oscillations. We term this emergent property resonant learning, as the new selected dynamical behaviors depend on the choice of the period of the hub oscillations. Furthermore, this procedure accelerates the learning of new behaviors by an order of magnitude faster than without oscillations. While it is well-established that modular network architecture can be selected through evolutionary learning to produce different network behaviors, forced hub oscillations emerge as an alternative evolutionary learning strategy for which network modularity is not necessarily required.

| S-EPMC9983844 | biostudies-literature

A multiresolution framework for the analysis of community structure in international trade networks.

Project description:International trade networks are complex systems that consist of overlapping multiple trade blocs of varying sizes. However, the resulting structures of community detection in trade networks often fail to accurately represent the complexity of international trade. To address this issue, we propose a multiresolution framework that integrates information from a range of resolutions to consider trade communities of different sizes and reveal the hierarchical structure of trade networks and their constituent blocks. In addition, we introduce a measure called multiresolution membership inconsistency for each country, which demonstrates the positive correlation between a country's structural inconsistency in terms of network topology and its vulnerability to external intervention in terms of economic and security functioning. Our findings show that network science-based approaches can effectively capture the complex interdependencies between countries and provide new metrics for evaluating the characteristics and behaviors of countries in both economic and political contexts.

| S-EPMC10082076 | 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