Investigating the topology of interacting networks

Network theory provides various tools for investigating the structural or functional topology of many complex systems found in nature, technology and society. Nevertheless, it has recently been realised that a considerable number of systems of interest should be treated, more appropriately, as interacting networks or networks of networks. Here we introduce a novel graph-theoretical framework for studying the interaction structure between subnetworks embedded within a complex network of networks. This framework allows us to quantify the structural role of single vertices or whole subnetworks with respect to the interaction of a pair of subnetworks on local, mesoscopic and global topological scales. Climate networks have recently been shown to be a powerful tool for the analysis of climatological data. Applying the general framework for studying interacting networks, we introduce coupled climate subnetworks to represent and investigate the topology of statistical relationships between the fields of distinct climatological variables. Using coupled climate subnetworks to investigate the terrestrial atmosphere’s three-dimensional geopotential height field uncovers known as well as interesting novel features of the atmosphere’s vertical stratification and general circulation. Specifically, the new measure “cross-betweenness” identifies regions which are particularly important for mediating vertical wind field interactions. The promising results obtained by following the coupled climate subnetwork approach present a first step towards an improved understanding of the Earth system and its complex interacting components from a network perspective.     

Inferring interdependencies in climate networks constructed at inter-annual, intra-season and longer time scales

We study global climate networks constructed by means of ordinal time series analysis. Climate interdependencies among the nodes are quantified by the mutual information, computed from time series of monthly-averaged surface air temperature anomalies, and from their symbolic ordinal representation (OP). This analysis allows identifying topological changes in the network when varying the time-interval of the ordinal pattern. We consider intra-season time-intervals (e.g., the patterns are formed by anomalies in consecutive months) and inter-annual time-intervals (e.g., the patterns are formed by anomalies in consecutive years). We discuss how the network density and topology change with these time scales, and provide evidence of correlations between geographically distant regions that occur at specific time scales. In particular, we find that an increase in the ordinal pattern spacing (i.e., an increase in the timescale of the ordinal analysis), results in climate networks with increased connectivity on the equatorial Pacific area. On the contrary, the number of significant links decreases when the ordinal analysis is done with a shorter timescale (by comparing consecutive months), and interpret this effect as due to more stochasticity in the time-series in the short timescale. As the equatorial Pacific is known to be dominated by El Niño-Southern Oscillation (ENSO) on scales longer than several months, our methodology allows constructing climate networks where the effect of ENSO goes from mild (monthly OP) to intense (yearly OP), independently of the length of the ordinal pattern and of the thresholding method employed.     

A Path-Based Distribution Measure for Network Comparison

As network data increases, it is more common than ever for researchers to analyze a set of networks rather than a single network and measure the difference between networks by developing a number of network comparison methods. Network comparison is able to quantify dissimilarity between networks by comparing the structural topological difference of networks. Here, we propose a kind of measures for network comparison based on the shortest path distribution combined with node centrality, capturing the global topological difference with local features. Based on the characterized path distributions, we define and compare network distance between networks to measure how dissimilar the two networks are, and the network entropy to characterize a typical network system. We find that the network distance is able to discriminate networks generated by different models. Combining more information on end nodes along a path can further amplify the dissimilarity of networks. The network entropy is able to detect tipping points in the evolution of synthetic networks. Extensive numerical simulations reveal the effectivity of the proposed measure in network reduction of multilayer networks, and identification of typical system states in temporal networks as well.     

The “small-world” topology of rock fracture networks

In this contribution we show that natural rock fracture networks, acting as media for the delivery of a variety of geological fluids, can be studied by using the principles of complex systems. Natural networks at different length scales (from the metre to the micrometer) have been analysed by evaluating their connectivity at global and local scale and results show that they share topological properties of “small-worlds”, a class of networks characterised by high global and local transport efficiency. This may have important geological implications for a variety of geological processes related to the transfer of fluids within the Earth, from the delivery of magmas to the Earth surface to the dispersion of pollutants in shallow aquifers.     

磁刺激穴位复杂脑功能网络构建与分析

本文采用互信息方法对磁刺激内关穴过程中的脑电信 号进行了两两通道间非线性时域关联特性分析, 构建了不同频率刺激前、刺激中、刺激后的脑功能网络, 并基于复杂网络理论对脑功能网络的特征进行了深入研究. 结果表明, 磁刺激频率为3 Hz 时, 大脑功能网络的平均度、平均聚类系数和全局效率与刺激前相比均有显著升高, 平均路径长度显著降低, 并且相应脑功能网络的"小世界"属性有所增强, 信息在大脑各区域间的传递更加高效. 本研究首次开展了磁刺激穴位复杂脑功能网络的构建与分析, 为探索磁刺激穴位对大脑神经调节的作用和机理提供新思路和新方法. 关键词： 复杂网络 磁刺激 脑功能网络 互信息     

A new local-world evolving network model

In some real complex networks, only a few nodes can obtain the global information about the entire networks, but most of the nodes own only local connections therefore own only local information of the networks. A new local-world evolving network model is proposed in this paper. In the model, not all the nodes obtain local network information, which is different from the local world network model proposed by Li and Chen (LC model). In the LC model, each node has only the local connections therefore owns only local information about the entire networks. Theoretical analysis and numerical simulation show that adjusting the ratio of the number of nodes obtaining the global information of the network to the total number of nodes can effectively control the valuing range for the power-law exponent of the new network. Therefore, if the topological structure of a complex network, especially its exponent of power-law degree distribution, needs controlling, we just add or take away a few nodes which own the global information of the network.     

一种基于用户相对权重的在线社交网络信息传播模型

根据在线社交网络信息传播特点和目前社交网络传播模型研究中存在的问题, 本文定义了网络用户之间的相互影响力函数, 在此基础上提出了一种基于用户相对权重的社交网络信息传播模型, 并对网络中的传播路径及传播过程进行了分析, 讨论了不同路径的信息传播影响力.为验证模型的有效性, 将传统的SIR模型和本文模型在六类不同网络拓扑下进行了仿真实验.仿真结果表明, 两类模型在均匀网络中没有明显差异, 但在非均匀网络中本文模型更能体现真实网络特点, 实验同时验证了节点的地位影响着信息的传播, 并且发现英文社交平台Twitter和中文社交平台新浪微博在拓扑结构上具备一定相似性.     

Multiple dynamical time-scales in networks with hierarchically nested modular organization

Many natural and engineered complex networks have intricate mesoscopic organization, e.g., the clustering of the constituent nodes into several communities or modules. Often, such modularity is manifested at several different hierarchical levels, where the clusters defined at one level appear as elementary entities at the next higher level. Using a simple model of a hierarchical modular network, we show that such a topological structure gives rise to characteristic time-scale separation between dynamics occurring at different levels of the hierarchy. This generalizes our earlier result for simple modular networks, where fast intramodular and slow intermodular processes were clearly distinguished. Investigating the process of synchronization of oscillators in a hierarchical modular network, we show the existence of as many distinct time-scales as there are hierarchical levels in the system. This suggests a possible functional role of such mesoscopic organization principle in natural systems, viz., in the dynamical separation of events occurring at different spatial scales.     

Multiscale characterization of recurrence-based phase space networks constructed from time series

Recently, a framework for analyzing time series by constructing an associated complex network has attracted significant research interest. One of the advantages of the complex network method for studying time series is that complex network theory provides a tool to describe either important nodes, or structures that exist in the networks, at different topological scale. This can then provide distinct information for time series of different dynamical systems. In this paper, we systematically investigate the recurrence-based phase space network of order k that has previously been used to specify different types of dynamics in terms of the motif ranking from a different perspective. Globally, we find that the network size scales with different scale exponents and the degree distribution follows a quasi-symmetric bell shape around the value of 2k with different values of degree variance from periodic to chaotic Ro?ssler systems. Local network properties such as the vertex degree, the clustering coefficients and betweenness centrality are found to be sensitive to the local stability of the orbits and hence contain complementary information.     

Exploring maps with greedy navigators

During the last decade of network research focusing on structural and dynamical properties of networks, the role of network users has been more or less underestimated from the bird's-eye view of global perspective. In this era of global positioning system equipped smartphones, however, a user's ability to access local geometric information and find efficient pathways on networks plays a crucial role, rather than the globally optimal pathways. We present a simple greedy spatial navigation strategy as a probe to explore spatial networks. These greedy navigators use directional information in every move they take, without being trapped in a dead end based on their memory about previous routes. We suggest that the centralities measures have to be modified to incorporate the navigators' behavior, and present the intriguing effect of navigators' greediness where removing some edges may actually enhance the routing efficiency, which is reminiscent of Braess's paradox. In addition, using samples of road structures in large cities around the world, it is shown that the navigability measure we define reflects unique structural properties, which are not easy to predict from other topological characteristics. In this respect, we believe that our routing scheme significantly moves the routing problem on networks one step closer to reality, incorporating the inevitable incompleteness of navigators' information.     

Implications of recording strategy for estimates of neocortical dynamics with electroencephalography

Neocortical dynamics evidently involves very complex, nonlinear processes including top-down and bottom-up interactions across spatial scales. The dynamics may also be strongly influenced by global (periodic) boundary conditions. The primary experimental measure of human neocortical dynamics at short time scales ( approximately few ms) is the scalp electroencephalogram (EEG). It is shown that different recording and data analysis strategies are sensitive to different parts of the spatial spectrum. Thus experimental measures of system dynamics (e.g., correlation dimension estimates) can generally be expected to depend on experimental method. These ideas are illustrated in two ways: a large scale, quasilinear theory of neocortical dynamics in which standing wave phenomenon occur with predicted frequencies in the general range of EEG, and a relatively simple nonlinear physical system consisting of a linear string with attached nonlinear springs. The string/springs system is integrated numerically to illustrate transitions from periodic to chaotic behavior as mesoscopic nonlinear influences dominate macroscopic linear effects. The implications of these results for new theories of neocortical dynamics, experimental estimates of dynamic properties, and cognitive EEG studies are considered.     

A time-series approach to measuring node similarity in networks and its application to community detection

A central concept in network analysis is that of similarity between nodes. In this paper, we introduce a dynamic time-series approach to quantifying the similarity between nodes in networks. The problem of measuring node similarity is exquisitely embedded into the framework of time series for state evolution of nodes. We develop a deterministic parameter-free diffusion model to drive the dynamic evolution of node states, and produce a unique time series for each source node. Then we introduce a measure quantifying how far all the other nodes are located from each source one. Following this measure, a quantity called dissimilarity index is proposed to signify the extent of similarity between nodes. Thereof, our dissimilarity index gives a deep and natural integration between the local and global perspectives of topological structure of networks. Furthermore, we apply our dissimilarity index to unveil community structure in networks, which verifies the proposed dissimilarity index.     

一种基于文本互信息的金融复杂网络模型

复杂网络能够解决许多金融问题,能够发现金融市场的拓扑结构特征,反映不同金融主体之间的相互依赖关系.相关性度量在金融复杂网络构建中至关重要.通过将多元金融时间序列符号化,借鉴文本特征提取以及信息论的方法,定义了一种基于文本互信息的相关系数.为检验方法的有效性,分别构建了基于不同相关系数(Pearson和文本互信息)和不同网络缩减方法(阈值和最小生成树)的4个金融复杂网络模型.在阈值网络中提出了使用分位数来确定阈值的方法,将相关系数6等分,取第4部分的中点作为阈值,此时基于Pearson和文本互信息的阈值模型将会有相近的边数,有利于这两种模型的对比.数据使用了沪深两地证券市场地区指数收盘价,时间从2006年1月4日至2016年12月30日,共计2673个交易日.从网络节点相关性看,基于文本互信息的方法能够体现出大约20%的非线性相关关系;在网络整体拓扑指标上,本文计算了4种指标,结果显示能够使所保留的节点联系更为紧密,有效提高保留节点的重要性以及挖掘出更好的社区结构;最后,计算了阈值网络的动态指标,将数据按年分别构建网络,缩减方法只用了阈值方法,结果显示本文提出的方法在小世界动态和网络度中心性等指标上能够成功捕捉到样本区间内存在的两次异常波动.此外,本文构建的地区金融网络具有服从幂律分布、动态稳定性、一些经济欠发达地区在金融地区网络中占据重要地位等特性.     

季节因素对气候网络影响研究

气候网络在地球科学领域研究中是一个新的热点,对于分析和揭示气候场的特征及关联结构具有较强优势.已有气候网络的构建一般选取冬季月份的样本数据,而且在研究中忽略了其他季节月份对气候网络的影响.本文研究了季节因素对气候网络的影响,研究发现:气候网络在不同季节的整体特征参数基本保持稳定,但是网络社团结构以及局部节点拓扑连接随季节变化显著.可以利用这一结论来研究不同季节全球遥相关模态变化情况以及局部地区气候特征随季节变化情况.     

Flow field topology of transient mixing driven by buoyancy

Transient mixing driven by buoyancy occurs through the birth of a symmetric Rayleigh-Taylor morphology (RTM) structure for large length scales. Beyond its critical bifurcation the RTM structure exhibits self-similarity and occurs on smaller and smaller length scales. The dynamics of the RTM structure, its nonlinear growth and internal collision, show that its genesis occurs from an explosive bifurcation which leads to the overlap of resonance regions in phase space. This event shows the coexistence of regular and chaotic regions in phase space which is corroborated with the existence of horseshoe maps. A measure of local chaos given by the topological entropy indicates that as the system evolves there is growth of uncertainty. Breakdown of the dissipative RTM structure occurs during the transition from explosive to catastrophic bifurcation; this event gives rise to annihilation of the separatrices which drives overlap of resonance regions. The global bifurcation of explosive and catastrophic events in phase space for the large length scale of the RTM structure serves as a template for which mixing occurs on smaller and smaller length scales.     

基于多路可视图的健康与心梗患者心电图信号复杂网络识别

可视图(visibility graph, VG)算法已被证明是将时间序列转换为复杂网络的简单且高效的方法,其构成的复杂网络在拓扑结构中继承了原始时间序列的动力学特性.目前,单维时间序列的可视图分析已趋于成熟,但应用于复杂系统时,单变量往往无法描述系统的全局特征.本文提出一种新的多元时间序列分析方法,将心梗和健康人的12导联心电图(electrocardiograph, ECG)信号转换为多路可视图,以每个导联为一个节点,两个导联构成可视图的层间互信息为连边权重,将其映射到复杂网络.由于不同人群的全连通网络表现为完全相同的拓扑结构,无法唯一表征不同个体的动力学特征,根据层间互信息大小重构网络,提取权重度和加权聚类系数,实现对不同人群12导联ECG信号的识别.为判断序列长度对识别效果的影响,引入多尺度权重度分布熵.由于健康受试者拥有更高的平均权重度和平均加权聚类系数,其映射网络表现为更加规则的结构、更高的复杂性和连接性,可以与心梗患者进行区分,两个参数的识别准确率均达到93.3%.     

一种基于离散数据从局部到全局的网络重构算法

网络的结构和功能彼此相互影响,网络上的功能往往体现为网络上的动力学过程,网络上的动力学过程通过网络中的行为表象数据进行体现.因此,根据网络上可观测的相关数据对网络结构进行重构将成为可能.本文拟解决如何根据网络上可观测的离散数据还原网络拓扑结构的问题,提出了在网络局部利用每一条离散数据对应节点的相似程度来推测节点间发生连边的可能性,通过多条离散数据重构网络各个局部拓扑并将由多条数据得到的局部拓扑进行叠加,最终重构出整个网络的全局拓扑结构的算法.为了验证算法的可行性与准确性,在小世界、无标度和随机网络中进行了网络重构实验,通过在三种不同类型及不同规模的网络中进行网络重构实验可以看出,网络重构算法在不同类型网络中的表现也不同,且网络的平均度值也会影响网络重构算法对数据的要求.为了验证算法的适用性,对三个实际网络进行了网络重构实验,结果显示算法能够适用实际较大规模网络的重构.该算法具有很好的适用性和准确度,适合不同类型网络的拓扑结构重构场景.     

Economic small-world behavior in weighted networks

The small-world phenomenon has been already the subject of a huge variety of papers, showing its appeareance in a variety of systems. However, some big holes still remain to be filled, as the commonly adopted mathematical formulation is valid only for topological networks. In this paper we propose a generalization of the theory of small worlds based on two leading concepts, efficiency and cost, and valid also for weighted networks. Efficiency measures how well information propagates over the network, and cost measures how expensive it is to build a network. The combination of these factors leads us to introduce the concept of economic small worlds, that formalizes the idea of networks that are “cheap” to build, and nevertheless efficient in propagating information, both at global and local scale. In this way we provide an adequate tool to quantitatively analyze the behaviour of complex networks in the real world. Various complex systems are studied, ranging from the realm of neural networks, to social sciences, to communication and transportation networks. In each case, economic small worlds are found. Moreover, using the economic small-world framework, the construction principles of these networks can be quantitatively analyzed and compared, giving good insights on how efficiency and economy principles combine up to shape all these systems. Received 6 November 2002 / Received in final form 24 January 2003 Published online 1st April 2003 RID="a" ID="a"e-mail: latora@ct.infn.it     

Shear banding in mesoscopic dusty plasma liquids

We experimentally demonstrate shear banding and construct a microscopic dynamic picture of a sheared 2D mesoscopic dust Coulomb liquid at the kinetic level. Under the topological constraints from the discreteness and finite boundary, the nonlinear threshold-type response of motion to the local stress induced by thermal and external drives leads to shear thinning and the enhanced avalanche-type local topological transitions with stress relaxation in the form of clusters. It causes the formation of the outer shear bands in which the mean shear rate, the velocity fluctuations, and the structural rearrangement rate are all enhanced, and leaves a weakly perturbed center band. The typical size of the cooperative hopping vortex (about three interparticle distance) sets up a common length scale for the widths of the confinement induced layering and the shear band.     

Analysis of Air Mean Temperature Anomalies by Using Horizontal Visibility Graphs

The last decades have been successively warmer at the Earth’s surface. An increasing interest in climate variability is appearing, and many research works have investigated the main effects on different climate variables. Some of them apply complex networks approaches to explore the spatial relation between distinct grid points or stations. In this work, the authors investigate whether topological properties change over several years. To this aim, we explore the application of the horizontal visibility graph (HVG) approach which maps a time series into a complex network. Data used in this study include a 60-year period of daily mean temperature anomalies in several stations over the Iberian Peninsula (Spain). Average degree, degree distribution exponent, and global clustering coefficient were analyzed. Interestingly, results show that they agree on a lack of significant trends, unlike annual mean values of anomalies, which present a characteristic upward trend. The main conclusions obtained are that complex networks structures and nonlinear features, such as weak correlations, appear not to be affected by rising temperatures derived from global climate conditions. Furthermore, different locations present a similar behavior and the intrinsic nature of these signals seems to be well described by network parameters.