Clusters in weighted macroeconomic networks: the EU case. Introducing the overlapping index of GDP/capita fluctuation correlations

GDP/capita correlations are investigated in various time windows (TW), for the time interval 1990–2005. The target group of countries is the set of 25 EU members, 15 till 2004 plus the 10 countries which joined EU later on. The TW-means of the statistical correlation coefficients are taken as the weights (links) of a fully connected network having the countries as nodes. Thereafter we define and introduce the overlapping index of weighted network nodes. A cluster structure of EU countries is derived from the statistically relevant eigenvalues and eigenvectors of the adjacency matrix. This may be considered to yield some information about the structure, stability and evolution of the EU country clusters in a macroeconomic sense.     

Local Events and Dynamics on Weighted Complex Networks

We examine the weighted networks grown and evolved by local events, such as the addition of new vertices and links and we show that depending on frequency of the events, a generalized power-law distribution of strength can emerge. Continuum theory is used to predict the scaling function as well as the exponents, which is in good agreement with the numerical simulation results. Depending on event frequency, power-law distributions of degree and weight can also be expected. Probability saturation phenomena for small strength and degree in many real world networks can be reproduced. Particularly, the non-trivial clustering coefficient, assortativity coefficient and degree-strength correlation in our model are all consistent with empirical evidences.     

Local affinity in heterogeneous growing networks

In this paper we present a study of the influence of local affinity in heterogeneous preferential attachment (PA) networks. Heterogeneous PA models are a generalization of the Barabási-Albert model to heterogeneous networks, where the affinity between nodes biases the attachment probability of links. Threshold models are a class of heterogeneous PA models where the affinity between nodes is inversely related to the distance between their states. We propose a generalization of threshold models where network nodes have individual affinity functions, which are then combined to yield the affinity of each potential interaction. We analyze the influence of the affinity functions in the topological properties averaged over a network ensemble. The network topology is evaluated through the distributions of connectivity degrees, clustering coefficients and geodesic distances. We show that the relaxation of the criterion of a single global affinity still leads to a reasonable power-law scaling in the connectivity and clustering distributions under a wide spectrum of assumptions. We also show that the richer behavior of the model often exhibits a better agreement with the empirical observations on real networks.     

Network evolution by different rewiring schemes

Many real world networks, such as social networks, are characterized by rearrangements of the links between nodes (rewiring). Indeed, very few natural networks are static in time, and it is therefore important to study the properties of networks in which rewiring occurs. In this paper, two different rewiring schemes are formulated and compared using a general ordinary differential equation (ODE) model. The equilibrium distributions are analytically derived. It is found that by uniformly choosing a node and a link connected to it, rewiring from different ends of the link yields different equilibrium degree distributions. Rewiring from the neighbor generally produces more high degree nodes. The equilibrium distributions of the ODE model are compared with simulation results of the corresponding stochastic process for rewiring. Conditions are discussed under which our ODE provides a good approximation for the mean of the corresponding stochastic process.     

The structural role of weak and strong links in a financial market network

We investigate the properties of correlation based networks originating from economic complex systems, such as the network of stocks traded at the New York Stock Exchange (NYSE). The weaker links (low correlation) of the system are found to contribute to the overall connectivity of the network significantly more than the strong links (high correlation). We find that nodes connected through strong links form well defined communities. These communities are clustered together in more complex ways compared to the widely used classification according to the economic activity. We find that some companies, such as General Electric (GE), Coca Cola (KO), and others, can be involved in different communities. The communities are found to be quite stable over time. Similar results were obtained by investigating markets completely different in size and properties, such as the Athens Stock Exchange (ASE). The present method may be also useful for other networks generated through correlations.     

A Law of Gravitation for Complex Networks

Inspiring Newton＇s law of universal gravitation and empirical studies, we propose a concept of virtual network mass and network gravitational force in complex networks. Then a network gravitational model for complex networks is presented. In the model, each node in the network is described with its position, edges （links） and virtual network mass. The proposed model is examined by experiments to show its potential applications.     

Cluster synchronization in networks of distinct groups of maps

In this paper, we study cluster synchronization in general bi-directed networks of nonidentical clusters, where all nodes in the same cluster share an identical map. Based on the transverse stability analysis, we present sufficient conditions for local cluster synchronization of networks. The conditions are composed of two factors: the common inter-cluster coupling, which ensures the existence of an invariant cluster synchronization manifold, and communication between each pair of nodes in the same cluster, which is necessary for chaos synchronization. Consequently, we propose a quantity to measure the cluster synchronizability for a network with respect to the given clusters via a function of the eigenvalues of the Laplacian corresponding to the generalized eigenspace transverse to the cluster synchronization manifold. Then, we discuss the clustering synchronous dynamics and cluster synchronizability for four artificial network models: (i) p-nearest-neighborhood graph; (ii) random clustering graph; (iii) bipartite random graph; (iv) degree-preferred growing clustering network. From these network models, we are to reveal how the intra-cluster and inter-cluster links affect the cluster synchronizability. By numerical examples, we find that for the first model, the cluster synchronizability regularly enhances with the increase of p, yet for the other three models, when the ratio of intra-cluster links and the inter-cluster links reaches certain quantity, the clustering synchronizability reaches maximal.     

Estimating the clustering coefficient in scale-free networks on lattices with local spatial correlation structure

When we study the architecture of networks of spatially extended systems the nodes in the network are subject to local correlation structures. In this case, we show that for scale-free networks the traditional way to estimate the clustering coefficient may not be meaningful. Here we explain why and propose an approach that corrects this problem.     

A tree-like complex network model

We propose a new tree-like network model. Our results indicate that the tree-like model has a small-world effect with a small average path length and large clustering coefficient. Strikingly, our tree-like model is scale-free. We also add weight to the links following the network structure. With this adding-weight method, the weight of the nodes shows exponential growth, which is ubiquitous in social networks.     

Robustness of heterogeneous complex networks

In this paper we study the robustness of heterogeneous preferential attachment networks. The robustness of a network measures its structural tolerance to the random removal of nodes and links. We numerically analyze the influence of the affinity parameters on a set of ensemble-averaged robustness metrics. We show that the presence of heterogeneity does not fundamentally alter the smooth nature of the fragmentation process of the models. We also show that a moderate level of locality translates into slight improvements in the robustness metrics, which prompts us to conjecture an evolutionary argument for the existence of real networks with power-law scaling in their connectivity and clustering distributions.     

Wave localization in complex networks with high clustering

We show that strong clustering of links in complex networks, i.e., a high probability of triadic closure, can induce a localization-delocalization quantum phase transition (Anderson-like transition) of coherent excitations. For example, the propagation of light wave packets between two distant nodes of an optical network (composed of fibers and beam splitters) will be absent if the fraction of closed triangles exceeds a certain threshold. We suggest that such an experiment is feasible with current optics technology. We determine the corresponding phase diagram as a function of clustering coefficient and disorder for scale-free networks of different degree distributions P(k) approximately k;{-lambda}. Without disorder, we observe no phase transition for lambda<4, a quantum transition for lambda>4, and an additional distinct classical transition for lambda>4.5. Disorder reduces the critical clustering coefficient such that phase transitions occur for smaller lambda.     

The complexity of Chinese syntactic dependency networks

This paper proposes how to build a syntactic network based on syntactic theory and presents some statistical properties of Chinese syntactic dependency networks based on two Chinese treebanks with different genres. The results show that the two syntactic networks are small-world networks, and their degree distributions obey a power law. The finding, that the two syntactic networks have the same diameter and different average degrees, path lengths, clustering coefficients and power exponents, can be seen as an indicator that complexity theory can work as a means of stylistic study. The paper links the degree of a vertex with a valency of a word, the small world with the minimized average distance of a language, that reinforces the explanations of the findings from linguistics.     

Statistical properties of weighted complex networks characterized by metaweights

We propose several characterizations of weighted complex networks by incorporating the concept of metaweight into the clustering coefficient, degree correlation, and module decomposition. These incorporations make it possible to describe weighted networks depending on how strongly we emphasize weights. Using some applications to real-world weighted networks, we demonstrate that the proposed approach provides rich information that was inaccessible by previous analyses such as the degree correlation for a specific magnitude of weights or the community structure under controlling the importance of roles of the topology and weights.     

Network structure of cross-correlations among the world market indices

We report the results of an investigation of the properties of the networks formed by the cross-correlations of the daily and weekly index changes of 143 stock market indices from 59 different countries. Analysis of the asset graphs, minimum spanning trees (MST) and planar maximally filtered graphs (PMFG) of the afermentioned networks confirms that globalization has been increasing in recent years. North American and European markets are observed to be much more strongly connected among themselves compared to the integration with the other geographical regions. Surprisingly, the integration of East Asian markets among themselves as well as to the Western markets is found to be rather weak. MST and PMFG of both daily and weekly return correlations indicates that the clustering of the indices is mostly geographical. The French fsbf250 index is found to be most important node of the MST and PMFG based on several graph centrality measures.     

Clusters or networks of economies? A macroeconomy study through Gross Domestic Product

We study correlations between web-downloaded gross domestic product (GDP)'s of rich countries. GDP is used as wealth signatures of the country economical state. We calculate the yearly fluctuations of the GDP. We look for forward and backward correlations between such fluctuations. The correlation measure is based on the Theil index. The system is represented by an evolving weighted network, nodes being the GDP fluctuations (or countries) at different times.In order to extract structures from the network, we focus on filtering the time delayed correlations by removing the least correlated links. This percolation idea-based method reveals the emergence of connections, that are visualized by a branching representation. Note that the network is made of weighted and directed links when taking into account a delay time. Such a measure of collective habits does not readily fit the usual expectations, except if an economy globalization framework is accepted.     

COVID-19’s Impact on International Trade

We analyze how the COVID-19 pandemic affected the trade of products between countries. With this aim, using the United Nations Comtrade database, we perform a Google matrix analysis of the multiproduct World Trade Network (WTN) for the years 2018–2020, comprising the emergence of the COVID-19 as a global pandemic. The applied algorithms—PageRank, CheiRank and the reduced Google matrix—take into account the multiplicity of the WTN links, providing new insights into international trade compared to the usual import–export analysis. These complex networks analysis algorithms establish new rankings and trade balances of countries and products considering all countries on equal grounds, independent of their wealth, and every product on the basis of its relative exchanged volumes. In comparison with the pre-COVID-19 period, significant changes in these metrics occurred for the year 2020, highlighting a major rewiring of the international trade flows induced by the COVID-19 pandemic crisis. We define a new PageRank–CheiRank product trade balance, either export or import-oriented, which is significantly perturbed by the pandemic.     

Deterministic factors of stock networks based on cross-correlation in financial market

The stock market has been known to form homogeneous stock groups with a higher correlation among different stocks according to common economic factors that influence individual stocks. We investigate the role of common economic factors in the market in the formation of stock networks, using the arbitrage pricing model reflecting essential properties of common economic factors. We find that the degree of consistency between real and model stock networks increases as additional common economic factors are incorporated into our model. Furthermore, we find that individual stocks with a large number of links to other stocks in a network are more highly correlated with common economic factors than those with a small number of links. This suggests that common economic factors in the stock market can be understood in terms of deterministic factors.     

Understanding changes in DTI metrics in patients with different stages of neurocysticercosis

Diffusion tensor imaging (DTI) was performed on 25 patients with neurocysticercosis (NCC). The aim of this study was to investigate the changes in DTI measures during the evolutionary course of NCC lesions from vesicular to calcified stage in the brain. DTI measures were quantified from the NCC lesions of all patients. On the basis of conventional imaging findings, NCC lesions were classified into vesicular, vesicular colloidal, granular nodular and calcified stages. Significant inverse correlation was observed between the evolutionary stage of NCC lesion and mean diffusivity (MD; r=−0.748, P<0.001) and spherical anisotropy (CS; r=−0.585, P<.001) values. Significant direct correlations were observed between evolutionary stages of NCC lesion and mean fractional anisotropy (FA; r=0.575, P<0.001), linear anisotropy (CL; r=0.478, p<0.001) and planar anisotropy (CP; r=0.561, p<0.001) values. Successive decrease in MD values calculated from NCC lesions was observed, moving from vesicular to granular nodular stage. On FA, CL and CP maps, a significant increase in signal intensity value was observed in calcified as compared to other stages. We conclude that DTI measures may indicate the evolutionary changes in NCC from vesicular to calcified stage.     

一类高聚类系数的加权无标度网络及其同步能力分析

针对真实世界中大规模网络都具有明显聚类效应的特点, 提出一类具有高聚类系数的加权无标度网络演化模型, 该模型同时考虑了优先连接、三角结构、随机连接和社团结构等四种演化机制. 在模型演化规则中, 以概率p增加单个节点, 以概率1–p增加一个社团. 与以往研究的不同在于新边的建立, 以概率φ在旧节点之间进行三角连接, 以概率1–φ进行随机连接. 仿真分析表明, 所提出的网络度、强度和权值分布都是服从幂律分布的形式, 且具有高聚类系数的特性, 聚类系数的提高与社团结构和随机连接机制有直接的关系. 最后通过数值仿真分析了网络演化机制对同步动态特性的影响, 数值仿真结果表明, 网络的平均聚类系数越小, 网络的同步能力越强. 关键词： 无标度网络 加权网络 聚类系数 同步能力     

Analysis of the Structure and Dynamics of European Flight Networks

We analyze structure and dynamics of flight networks of 50 airlines active in the European airspace in 2017. Our analysis shows that the concentration of the degree of nodes of different flight networks of airlines is markedly heterogeneous among airlines reflecting heterogeneity of the airline business models. We obtain an unsupervised classification of airlines by performing a hierarchical clustering that uses a correlation coefficient computed between the average occurrence profiles of 4-motifs of airline networks as similarity measure. The hierarchical tree is highly informative with respect to properties of the different airlines (for example, the number of main hubs, airline participation to intercontinental flights, regional coverage, nature of commercial, cargo, leisure or rental airline). The 4-motif patterns are therefore distinctive of each airline and reflect information about the main determinants of different airlines. This information is different from what can be found looking at the overlap of directed links.