A new information dimension of complex networks

The fractal and self-similarity properties are revealed in many complex networks. The classical information dimension is an important method to study fractal and self-similarity properties of planar networks. However, it is not practical for real complex networks. In this Letter, a new information dimension of complex networks is proposed. The nodes number in each box is considered by using the box-covering algorithm of complex networks. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient when dealing with the fractal dimension problem of complex networks.     

Weighted Fractal Networks

In this paper we define a new class of weighted complex networks sharing several properties with fractal sets, and whose topology can be completely analytically characterized in terms of the involved parameters and of the fractal dimension. General networks with fractal or hierarchical structures can be set in the proposed framework that moreover could be used to provide some answers to the widespread emergence of fractal structures in nature.     

Weighted coupling for geographical networks: Application to reducing consensus time in sensor networks

Although many complex real-world networks are weighted, unweighted networks are used in many applications such as sensor networks. In this Letter it is shown using properly weighted networks the performance can be greatly enhanced by reducing the time necessary for the average consensus. Random geographical models are adapted as network models and a method based on mutually coupled phase oscillators is used for providing average consensus over the network. The consensus time is calculated by numerically solving the network's differential equations and monitoring the average error. The simulation results on some sample networks show that the consensus time is dramatically reduced when the proposed weights are used for the links of the underlying network.     

Scaling of weighted spectral distribution in weighted small-world networks

Many real-world systems can be modeled by weighted small-world networks with high clustering coefficients. Recent studies for rigorously analyzing the weighted spectral distribution(W SD) have focused on unweighted networks with low clustering coefficients. In this paper, we rigorously analyze the W SD in a deterministic weighted scale-free small-world network model and find that the W SD grows sublinearly with increasing network order(i.e., the number of nodes) and provides a sensitive discrimination for each input of this model. This study demonstrates that the scaling feature of the W SD exists in the weighted network model which has high and order-independent clustering coefficients and reasonable power-law exponents.     

The adaptive coupling scheme and the heterogeneity in intrinsic frequency and degree distributions of the complex networks

In the paper, we applied an adaptive principle to three kinds of complex networks as well as a random network within the context of the Kuramoto model. We found that the adaptive scheme could suppress the negative effect of the heterogeneity in the networks and the phase synchronization is enhanced obviously. The paper mainly investigates the adaptive coupling scheme in the small-world network, the scale-free network, and the modular network. Comparing with other weighted or unweighted static coupling schemes, the adaptive coupling scheme has a better performance in synchronization and communication efficiency, and provides a more realistic picture of synchronization in complex networks.     

Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices

In this paper, firstly, we study analytically the topological features of a family of hierarchical lattices (HLs) from the view point of complex networks. We derive some basic properties of HLs controlled by a parameter q: scale-free degree distribution with exponent γ=2+ln 2/(ln q), null clustering coefficient, power-law behavior of grid coefficient, exponential growth of average path length (non-small-world), fractal scaling with dimension d_B=ln (2q)/(ln 2), and disassortativity. Our results show that scale-free networks are not always small-world, and support the conjecture that self-similar scale-free networks are not assortative. Secondly, we define a deterministic family of graphs called small-world hierarchical lattices (SWHLs). Our construction preserves the structure of hierarchical lattices, including its degree distribution, fractal architecture, clustering coefficient, while the small-world phenomenon arises. Finally, the dynamical processes of intentional attacks and collective synchronization are studied and the comparisons between HLs and Barabási-Albert (BA) networks as well as SWHLs are shown. We find that the self-similar property of HLs and SWHLs significantly increases the robustness of such networks against targeted damage on hubs, as compared to the very vulnerable non fractal BA networks, and that HLs have poorer synchronizability than their counterparts SWHLs and BA networks. We show that degree distribution of scale-free networks does not suffice to characterize their synchronizability, and that networks with smaller average path length are not always easier to synchronize.     

Fractal Analysis of Mobile Social Networks

Fractal and self similarity of complex networks have attracted much attention in recent years.The fractal dimension is a useful method to describe the fractal property of networks.However,the fractal features of mobile social networks(MSNs) are inadequately investigated.In this work,a box-covering method based on the ratio of excluded mass to closeness centrality is presented to investigate the fractal feature of MSNs.Using this method,we find that some MSNs are fractal at different time intervals.Our simulation results indicate that the proposed method is available for analyzing the fractal property of MSNs.     

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

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

On the rich-club effect in dense and weighted networks

For many complex networks present in nature only a single instance, usually of large size, is available. Any measurement made on this single instance cannot be repeated on different realizations. In order to detect significant patterns in a real-world network it is therefore crucial to compare the measured results with a null model counterpart. Here we focus on dense and weighted networks, proposing a suitable null model and studying the behaviour of the degree correlations as measured by the rich-club coefficient. Our method solves an existing problem with the randomization of dense unweighted graphs, and at the same time represents a generalization of the rich-club coefficient to weighted networks which is complementary to other recently proposed ones.     

权重分布对加权局域世界网络动力学同步的影响

加权网络可以更细致地刻画复杂系统中两节点之间的相互作用, 所以加权网络也比无权网络更接近真实的复杂系统. 改变权重分布来调节和改善复杂网络的性质也成为一种新的研究方法. 基于现有无权网络同步的概念, 应用特征值比R来衡量加权局域世界网络的同步能力, 发现权重分布对加权局域世界网络的同步能力有很重要的影响, 权重分布越均匀, 网络的同步能力就越大. 关键词： 权重分布 局域世界 加权网络 同步     

花簇分形无标度网络中节点影响力的区分度

大量研究表明分形尺度特性广泛存在于真实复杂系统中, 且分形结构显著影响网络上的传播动力学行为. 虽然复杂网络的节点传播影响力吸引了越来越多学者的关注, 但依旧缺乏针对分形网络结构的节点影响力的系统研究. 鉴于此, 本文基于花簇分形网络模型, 研究了分形无标度结构上的节点传播影响力. 首先, 对比了不同分形维数下的节点影响力, 结果表明, 当分形维数很小时, 节点影响力的区分度几乎不随节点度变化, 很难区分不同节点的传播影响力, 而随着分形维数的增大, 从全局和局域角度都能很容易识别网络中的超级传播源. 其次, 通过对原分形网络进行不同程度的随机重连来分析网络噪声对节点影响力区分度的影响, 发现在低维分形网络上, 加入网络噪声之后能够容易区分不同节点的影响力, 而在无穷维超分形网络中, 加入网络噪声之后能够区分中间度节点的影响力, 但从全局和局域角度都很难识别中心节点的影响力. 所得结论进一步补充、深化了基于花簇分形网络的节点影响力研究, 研究结果对实际病毒传播的预警控制提供了一定的理论借鉴.     

Effects of Different Connectivity Topologies in Small World Networks on EEG-Like Activities

Based on our previously pulse-coupled integrate-and-fire neuron model in small world networks, we investigate the effects of different connectivity topologies on complex behavior of electroencephalographic-like signals produced by this model. We show that several times series analysis methods that are often used for analyzing complex behavior of electroencephalographic-like signals, such as reconstruction of the phase space, correlation dimension, fractal dimension, and the Hurst exponent within the rescaled range analysis (R/S). We find that the different connectivity topologies lead to different dynamical behaviors in models of integrate-and-fire neurons.     

一种识别关联维数无标度区间的新方法

在计算关联维数过程中, 为了减少人为因素识别无标度区间带来的误差, 提出一种基于模拟退火遗传模糊C均值聚类识别无标度区间的新方法. 该方法根据无标度区间对应曲线的二阶导数在零附近波动的变化特征, 利用分类算法进行识别. 首先对双对数关联积分的离散数据进行二阶差分; 然后利用模拟退火遗传模糊C均值聚类方法对该数据进行分类, 选出在零附近波动的数据; 再剔除粗大误差保留有效数据; 最后进行统计分析识别出线性度最好的作为无标度区间. 应用新方法对两个著名的混沌系统Lorenz 和Henon 进行了仿真, 计算结果与理论值非常符合. 实验表明, 所提出的新方法与主观识别、K-means和2-means方法比较, 可以有效自动识别无标度区间, 减少误差, 计算结果更加精确.     

The influence of tie strength on evolutionary games on networks: An empirical investigation

Extending previous work on unweighted networks, we present here a systematic numerical investigation of standard evolutionary games on weighted networks. In the absence of any reliable model for generating weighted social networks, we attribute weights to links in a few ways supported by empirical data ranging from totally uncorrelated to weighted bipartite networks. The results of the extensive simulation work on standard complex network models show that, except in a case that does not seem to be common in social networks, taking the tie strength into account does not change in a radical manner the long-run steady-state behavior of the studied games. Besides model networks, we also included a real-life case drawn from a coauthorship network. In this case also, taking the weights into account only changes the results slightly with respect to the raw unweighted graph, although to draw more reliable conclusions on real social networks many more cases should be studied as these weighted networks become available.     

Small World Effects in a Harmonious Unifying Hybrid Preferential Model Networks

Small world effects in the harmonious unifying hybrid preferential model (HUHPM) networks are studied both numerically and analytically. The idea and method of the HUHPM is applied to three typical examples of unweighted BA model, weighted BBV model, and the TDE model, so-called HUHPM-BA, HUHPM-BBV and HUHPM-TDE networks. Comparing the HUHPM with current typical models above, it is found that the HUHPM networks has the smallest average path length and the biggest average clustering coefficient. The results demonstrate that the HUHPM is more suitable not only for the un-weighted models but also for the weighted models.     

一种基于随机行走和策略连接的网络演化模型

本文提出了一个基于随机行走和策略选择的复杂网络局域演化模型RAPA. 新节点加入系统不需要全局知识,而是通过随机行走构造局域世界;然后依据概率采用随机连接,"扶贫"连接或"亲富"连接策略,从局域世界中选择节点增加连接边;最终自组织演化具有幂律特点的复杂网络. 初步的解析计算和仿真实验都表明,RAPA模型不仅重现了具有小世界特性、整体上的无标度特性,还可以演化出小变量饱和以及指数截断等现象,同时也具有明显的聚类特性,并能够构造出同配或异配等不同混合模式的网络. 关键词： 复杂网络 模型 随机行走 策略连接     

A review of fractality and self-similarity in complex networks

We review recent findings of self-similarity in complex networks. Using the box-covering technique, it was shown that many networks present a fractal behavior, which is seemingly in contrast to their small-world property. Moreover, even non-fractal networks have been shown to present a self-similar picture under renormalization of the length scale. These results have an important effect in our understanding of the evolution and behavior of such systems. A large number of network properties can now be described through a set of simple scaling exponents, in analogy with traditional fractal theory.     

Fractal analysis on human dynamics of library loans

In this paper, the fractal characteristic of human behaviors is investigated from the perspective of time series constructed with the amount of library loans. The values of the Hurst exponent and length of non-periodic cycle calculated through rescaled range analysis indicate that the time series of human behaviors and their sub-series are fractal with self-similarity and long-range dependence. Then the time series are converted into complex networks by the visibility algorithm. The topological properties of the networks such as scale-free property and small-world effect imply that there is a close relationship among the numbers of repetitious behaviors performed by people during certain periods of time. Our work implies that there is intrinsic regularity in the human collective repetitious behaviors. The conclusions may be helpful to develop some new approaches to investigate the fractal feature and mechanism of human dynamics, and provide some references for the management and forecast of human collective behaviors.     

Link prediction based on a semi-local similarity index

Missing link prediction provides significant instruction for both analysis of network structure and mining of unknown links in incomplete networks. Recently, many algorithms have been proposed based on various node-similarity measures. Among these measures, the common neighbour index, the resource allocation index, and the local path index, stemming from different source, have been proved to have relatively high accuracy and low computational effort. In this paper, we propose a similarity index by combining the resource allocation index and the local path index. Simulation results on six unweighted networks show that the accuracy of the proposed index is higher than that of the local path one. Based on the same idea of the present index, we develop its corresponding weighted version and test it on several weighted networks. It is found that, except for the USAir network, the weighted variant also performs better than both the weighted resource allocation index and the weighted local path index. Due to the improved accuracy and the still low computational complexity, the indices may be useful for link prediction.     

Embedding complex networks in a low dimensional Euclidean space based on vertex dissimilarities

We propose a method for representing vertices of a complex network as points in a Euclidean space of an appropriate dimension. To this end, we first adopt two widely used quantities as the measures for the dissimilarity between vertices. The dissimilarity is then transformed into its corresponding distance in a Euclidean space via the non-metric multidimensional scaling. We applied the proposed method to real-world as well as models of complex networks. We empirically found that real-world complex networks were embedded in a Euclidean space of relatively lower dimensions and the configuration of vertices in the space was mostly characterized by the self-similarity of a multifractal. In contrast, by applying the same scheme to the network models, we found that, in general, higher dimensions were needed to embed the networks into a Euclidean space and the embedding results usually did not exhibit the self-similar property. From the analysis, we learn that the proposed method serves a way not only to visualize the complex networks in a Euclidean space but to characterize the complex networks in a different manner from conventional ways.