中国城市航空网络的实证研究与分析

以城市为节点，城市间直航线路为边，实证地研究了中国城市航空网络的拓扑性质.研究表明，中国城市航空网络是一个小世界网络，具有短的平均路径长度和大的簇系数，且其度分布服从双段幂律分布.它的度度相关性质与世界航空网络和北美航空网络都不相同.当度较小时，世界航空网络和北美航空网络都是正相关的，但中国城市航空网络未表现出度度相关性；而对于度较大的节点，世界航空网络中其邻点平均度几乎是一个常值，但中国城市航空网络却呈现出负相关性.以往的实证研究暗示，节点具有明确几何位置的网络，如计算机互联网、电力网络等，不表现层次性.但是中国城市航空网络展现出明显的层次性，表明地理因素对其结构演化的影响并不强烈.进一步地，以城市间直航计划每周提供的座位数为边权，研究了网络的含权性质，发现该网络节点度权之间是幂律相关的，相关指数为1.37.     

加权方式对网络同步能力的影响

针对真实网络中权值与端点度的相关特性,提出了一种与始点和终点的度 都相关的非对称加权方式.在不同的网络结构下研究加权方式对同步能力的影响. 研究发现网络异质性越强时,通过调节网络权值改变网络同步能力的效果越显著, 而网络越匀质时,调节权值的方式改变网络同步能力的效果越不明显. 仿真实验显示无论在小世界网络还是无标度网络中,网络都是在节点的输入强度为1处获得最优的同步能力.     

Enhancing synchronizability by weight randomization on regular networks

In weighted networks, redistribution of link weights can effectively change the properties of networks, even though the corresponding binary topology remains unchanged. In this paper, the effects of weight randomization on synchronization of coupled chaotic maps is investigated on regular weighted networks. The results reveal that synchronizability is enhanced by redistributing of link weights, i.e. coupled maps reach complete synchronization with lower cost. Furthermore, we show numerically that the heterogeneity of link weights could improve the complete synchronization on regular weighted networks.     

Modelling of weighted evolving networks with community structures

Many social and biological networks consist of communities–groups of nodes within which links are dense but among which links are sparse. It turns out that most of these networks are best described by weighted networks, whose properties and dynamics depend not only on their structures but also on the link weights among their nodes. Recently, there are considerable interests in the study of properties as well as modelling of such networks with community structures. To our knowledge, however, no study of any weighted network model with such a community structure has been presented in the literature to date. In this paper, we propose a weighted evolving network model with a community structure. The new network model is based on the inner-community and inter-community preferential attachments and preferential strengthening mechanism. Simulation results indicate that this network model indeed reflect the intrinsic community structure, with various power-law distributions of the node degrees, link weights, and node strengths.     

Dynamical weights and enhanced synchronization in adaptive complex networks

Dynamical organization of connection weights is studied in scale-free networks of chaotic oscillators, where the coupling strength of a node from its neighbors develops adaptively according to the local synchronization property between the node and its neighbors. We find that when complete synchronization is achieved, the coupling strength becomes weighted and correlated with the topology due to a hierarchical transition to synchronization in heterogeneous networks. Importantly, such an adaptive process enhances significantly the synchronizability of the networks, which could have meaningful implications in the manipulation of dynamical networks.     

Synchronization of impulsively coupled complex networks

We investigate the synchronization of complex networks,which are impulsively coupled only at discrete instants.Based on the comparison theory of impulsive differential systems,a distributed impulsive control scheme is proposed for complex dynamical networks to achieve synchronization.The proposed scheme not only takes into account the influence of all nodes to network synchronization,which depends on the weight of each node in the network,but also provides us with a flexible method to select the synchronized state of the network.In addition,it is unnecessary for the impulsive coupling matrix to be symmetrical.Finally,the proposed control scheme is applied to a chaotic Lorenz network and Chua’s circuit network.Numerical simulations are used to illustrate the validity of this control scheme.     

一种能耗均衡的无线传感器网络加权无标度拓扑研究

针对无线传感器网络节点能耗不均衡问题,通过对节点生命期建模,得出节点生命期受节点剩余能量和通信距离的影响,进而将两端节点生命期作为构建拓扑时边权重的影响因子,通过边权重控制节点权重,最终得出了一种能耗均衡的无线传感器网络加权无标度拓扑模型,并理论证明了该模型的点权、边权和节点度均服从幂律分布.实验结果表明,该模型具有无标度拓扑的强容错性,并有效的均衡了网络中的节点能耗,延长了网络的生命期.     

Weighted evolving networks.

Many biological, ecological, and economic systems are best described by weighted networks, as the nodes interact with each other with varying strength. However, most evolving network models studied so far are binary, the link strength being either 0 or 1. In this paper we introduce and investigate the scaling properties of a class of models which assign weights to the links as the network evolves. The combined numerical and analytical approach indicates that asymptotically the total weight distribution converges to the scaling behavior of the connectivity distribution, but this convergence is hampered by strong logarithmic corrections.     

States and transitions in mixed networks

A network is named as mixed network if it is composed of N nodes, the dynamics of some nodes are periodic, while the others are chaotic. The mixed network with all-to-all coupling and its correspond- ing networks after the nonlinearity gap-condition pruning are investigated. Several synchronization states are demonstrated in both systems, and a first-order phase transition is proposed. The mixture of dynamics implies any kind of synchronous dynamics for the whole network, and the inixed networks may be controlled by the nonlinearity gap-condition pruning.     

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

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

Facilitated synchronization of complex networks through a discontinuous coupling strategy

Synchronization stability in complex networks is a topic of theoretical interest and practical importance. Increasing effort has been devoted to the enhancement of synchronizability of networks, or more specifically, the design of synchronizable networks. However, most previous attempts turn the coupling weight/gradient or change the topological interactions, which sometimes is not manageable. In this paper, by adopting a simple kind of discontinuous coupling strategy: the uniform on-off coupling scheme, with on-off period being comparable to the timescale of node dynamics, the problem is solved within the framework of the master stability function. The results show that, this strategy can greatly increase the stable region of synchronization, which means the size of synchronizable networks can be much larger than the traditional case, without any changes of their connections. Furthermore, the synchronization speed can be accelerated considerably, which is even higher than the previous optimal case. The mechanism of the facilitation is revealed and shows that the continuous coupling in fact is one of the worst choices for synchronization in the view of discontinuous coupling strategy. The coupling cost required for synchronization is also examined, which is approximately the same as the continuous coupling.     

权重分布对加权网络效率的影响

加权网络可以对复杂系统的相互作用结构提供更加细致的刻画,而改变边权也成为调整和改善网络性质与功能的新途径.基于已有无权网络的效率概念,文中给出了相似权和相异权网络的网络效率定义,并研究了权重分布对于网络效率的影响.从平权的规则网络出发,通过改变权重的分布形式考察权重分布对网络效率的影响,结果发现,在规则网络上,权重分布随机性的增加提高了网络效率,而在几种常见的权重分布形式中,指数分布对网络效率的改进最为显著.同时,权重随机化之后网络最小生成树的总权重减小,意味着网络的运输成本随着权重异质性的增加而降低.以上结果为深入理解权重对网络结构与功能的影响提供了基础. 关键词： 复杂网络 加权网络 权重 网络效率     

Synchronization in complex delayed dynamical networks with nonsymmetric coupling

A new general complex delayed dynamical network model with nonsymmetric coupling is introduced, and then we investigate its synchronization phenomena. Several synchronization criteria for delay-independent and delay-dependent synchronization are provided which generalize some previous results. The matrix Jordan canonical formalization method is used instead of the matrix diagonalization method, so in our synchronization criteria, the coupling configuration matrix of the network does not required to be diagonalizable and may have complex eigenvalues. Especially, we show clearly that the synchronizability of a delayed dynamical network is not always characterized by the second-largest eigenvalue even though all the eigenvalues of the coupling configuration matrix are real. Furthermore, the effects of time-delay on synchronizability of networks with unidirectional coupling are studied under some typical network structures. The results are illustrated by delayed networks in which each node is a two-dimensional limit cycle oscillator system consisting of a two-cell cellular neural network, numerical simulations show that these networks can realize synchronization with smaller time-delay, and will lose synchronization when the time-delay increase larger than a threshold.     

Synchronization in asymmetrically coupled networks with node balance

We study global stability of synchronization in asymmetrically connected networks of limit-cycle or chaotic oscillators. We extend the connection graph stability method to directed graphs with node balance, the property that all nodes in the network have equal input and output weight sums. We obtain the same upper bound for synchronization in asymmetrically connected networks as in the network with a symmetrized matrix, provided that the condition of node balance is satisfied. In terms of graphs, the symmetrization operation amounts to replacing each directed edge by an undirected edge of half the coupling strength. It should be stressed that without node balance this property in general does not hold.     

Complex network structure of musical compositions: Algorithmic generation of appealing music

In this paper we construct networks for music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes and their co-occurring connections. We analyze classical music from Bach, Mozart, Chopin, as well as other types of music such as Chinese pop music. We observe remarkably similar properties in all networks constructed from the selected compositions. We conjecture that preserving the universal network properties is a necessary step in artificial composition of music. Power-law exponents of node degree, node strength and/or edge weight distributions, mean degrees, clustering coefficients, mean geodesic distances, etc. are reported. With the network constructed, music can be composed artificially using a controlled random walk algorithm, which begins with a randomly chosen note and selects the subsequent notes according to a simple set of rules that compares the weights of the edges, weights of the nodes, and/or the degrees of nodes. By generating a large number of compositions, we find that this algorithm generates music which has the necessary qualities to be subjectively judged as appealing.     

Synchronization of Phase Oscillators in Networks with Certain Frequency Sequence

Synchronization of Kuramoto phase oscillators arranged in real complex neural networks is investigated. It is shown that the synchronization greatly depends on the sets of natural frequencies of the involved oscillators. The influence of network connectivity heterogeneity on synchronization depends particularly on the correlation between natural frequencies and node degrees. This finding implies a potential application that inhibiting the effects caused by the changes of network structure can be bManced out nicely by choosing the correlation parameter appropriately.     

Distinguishing manipulated stocks via trading network analysis

Manipulation is an important issue for both developed and emerging stock markets. For the study of manipulation, it is critical to analyze investor behavior in the stock market. In this paper, an analysis of the full transaction records of over a hundred stocks in a one-year period is conducted. For each stock, a trading network is constructed to characterize the relations among its investors. In trading networks, nodes represent investors and a directed link connects a stock seller to a buyer with the total trade size as the weight of the link, and the node strength is the sum of all edge weights of a node. For all these trading networks, we find that the node degree and node strength both have tails following a power-law distribution. Compared with non-manipulated stocks, manipulated stocks have a high lower bound of the power-law tail, a high average degree of the trading network and a low correlation between the price return and the seller-buyer ratio. These findings may help us to detect manipulated stocks.     

The synchronization transition in correlated oscillator populations

The synchronization transition of correlated ensembles of coupled Kuramoto oscillators on sparse random networks is investigated. Extensive numerical simulations show that correlations between the native frequencies of adjacent oscillators on the network systematically shift the critical point as well as the critical exponents characterizing the transition. Negative correlations imply an onset of synchronization for smaller coupling, whereas positive correlations shift the critical coupling towards larger interaction strengths. For negatively correlated oscillators the transition still exhibits critical behaviour similar to that of the all-to-all coupled Kuramoto system, while positive correlations change the universality class of the transition depending on the correlation strength. Crucially, the paper demonstrates that the synchronization behaviour is not only determined by the coupling architecture, but also strongly influenced by the oscillator placement on the coupling network.     

Concentric circular arrays of Josephson junctions as dressed models of granular superconductors

In this paper networks that optimize a combined measure of local and global synchronizability are evolved. It is shown that for low coupling improvements in the local synchronizability dominate network evolution. This leads to an expressed grouping of elements with similar native frequency into cliques, allowing for an early onset of synchronization, but rendering full synchronization hard to achieve. In contrast, for large coupling the network evolution is governed by improvements towards full synchronization, preventing any expressed community structure. Such networks exhibit strong coupling between dissimilar oscillators. Albeit a rapid transition to full synchronization is achieved, the onset of synchronization is delayed in comparison to the first type of networks. The paper illustrates that an early onset of synchronization (which relates to clustering) and global synchronization are conflicting demands on network topology.     

A decentralised topology control to regulate global properties of complex networks

In the last decade much research effort has been devoted to the investigation of the interplay between properties (i.e. synchronization, clustering, resilience to node fault) and topology of complex networks. Many algorithms have been proposed to construct a network topology with a given properties or to optimize them. These algorithms are static, off-line implemented and may require global network knowledge. In this paper we propose a simple decentralized topology control algorithm that by local actions carried out at the node allows to regulate network global properties. Additionally the algorithm is dynamic coping with both node and link faults and can be on-line implemented.