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

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

一种可大范围调节聚类系数的加权无标度网络模型

在Barrat, Barthélemy 和 Vespignani (BBV)加权无标度网络模型的基础上，提出了一种可大范围调节聚类系数的加权无标度网络模型——广义BBV模型(GBBV模型).理论分析和仿真实验表明，GBBV模型保留了BBV模型的许多特征，节点度、节点权重和边权值等都服从幂律分布.但是，GBBV模型克服了BBV模型只能小范围调节聚类系数的缺陷，从而可以用于具有大聚类系数网络的建模. 关键词： 无标度网络 加权网络 聚类系数     

Synchronization in Triangled Complex Networks

Using a tunable clustering coefficient model without changing the degree distribution, we investigate the effect of clustering coefficient on synchronization of networks with both unweighted and weighted couplings. For several typical categories of complex networks, the more triangles are in the networks, the worse the synchronizability of the networks is.     

Weighted Networks Model Based on Traffic Dynamics with Local Perturbation

In the study of weighted complex networks, the interplay between traffic and topology have been paid much attention. However, the variation of topology and weight brought by new added vertices or edges should also be considered. In this paper, an evolution model of weighted networks driven by traffic dynamics with local perturbation is proposed. The model gives power-law distribution of degree, weight and strength, as confirmed by empirical measurements. By choosing appropriate parameters W and δ, the exponents of various power law distributions can be adjusted to meet real world networks. Nontrivial clustering coefficient C, degree assortativity coefficient r, and strength-degree correlation are also considered. What should be emphasized is that, with the consideration of local perturbation, one can adjust the exponent of strength-degree correlation more effectively. It makes our model more general than previous ones and may help reproducing real world networks more appropriately. PACS numbers： 87.23.Kg, 89.75.Da, 89.75.Fb, 89.75.Hc.     

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

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

加权网络权重自相似评判函数及其社团结构检测

提出了权重自相似性加权网络社团结构评判函数,并基于该函数提出一种谱分析算法检测社团结构,结果表明算法能将加权网络划分为同一社团内边权值分布均匀,而社团间边权值分布随机的社团结构.通过建立具有社团结构的加权随机网络分析了该算法的准确性,与WEO和WGN算法相比,在评判权重自相似的阈值系数取较小时,该算法具有较高的准确性.对于一个具有n个节点和c个社团的加权网络,社团结构检测的复杂度为O(cn2/2).通过设置评判权重自相似的阈值系数,可检测出能反映节点联系稳定性的层化性社团结构.这与传统意义上只将加权网络划分为社团中边权值较大而社团间边权值较小的标准不同,从另一个角度更好地提取了加权网络的结构信息.     

An Extended Correlation Dimension of Complex Networks

Fractal and self-similarity are important characteristics of complex networks. The correlation dimension is one of the measures implemented to characterize the fractal nature of unweighted structures, but it has not been extended to weighted networks. In this paper, the correlation dimension is extended to the weighted networks. The proposed method uses edge-weights accumulation to obtain scale distances. It can be used not only for weighted networks but also for unweighted networks. We selected six weighted networks, including two synthetic fractal networks and four real-world networks, to validate it. The results show that the proposed method was effective for the fractal scaling analysis of weighted complex networks. Meanwhile, this method was used to analyze the fractal properties of the Newman–Watts (NW) unweighted small-world networks. Compared with other fractal dimensions, the correlation dimension is more suitable for the quantitative analysis of small-world effects.     

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

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

Projective synchronization of spatiotemporal chaos in a weighted complex network

<正>Projective synchronization of a weighted complex network is studied in which nodes are spatiotemporal chaos systems and all nodes are coupled not with the nonlinear terms of the system but through a weighted connection.The range of the linear coefficient matrix of separated configuration,when the synchronization is implemented,is determined according to Lyapunov stability theory.It is found that projective synchronization can be realized for unidirectional star-connection even if the coupling strength between the nodes is a given arbitrary weight value.The Gray-Scott models having spatiotemporal chaos behaviours are taken as nodes in the weighted complex network,and simulation results of spatiotemporal synchronization show the effectiveness of the method.     

交通流驱动的含权网络

文章对含权复杂网络研究的最近进展给予了评述，特别报道了文章作者最近提出的一个交通流驱动的含权技术网络模型。这一模型能够同时给出网络连接度分布的幂函数律、网络强度分布的幂函数律、网络权重分布的幂函数律，以及高聚集性和非相称混合性等五大特征，因此成功地刻画了真实技术网络的无尺度性质和小世界效应     

Weighted Scaling in Non-growth Random Networks

We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in nongrowth random networks.In this model,we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it.The network evolves according to a vertex strength preferential selection mechanism.During the evolution process,the network always holds its total number of vertices and its total number of single-edges constantly.We show analytically and numerically that a network will form steady scale-free distributions with our model.The results show that a weighted non-growth random network can evolve into scale-free state.It is interesting that the network also obtains the character of an exponential edge weight distribution.Namely,coexistence of scale-free distribution and exponential distribution emerges.     

Weighted Scaling in Non-growth Random Networks

We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in non-growth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its total number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scale-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.     

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.     

激光时空混沌模型的加权网络投影同步

提出了一种实现加权网络时空混沌投影同步的方法.通过构造合适的Lyapunov函数,确定了加权网络中连接节点之间耦合函数的结构以及网络节点状态方程中分离配置的线性项的系数矩阵的取值范围.以Bragg声光双稳系统作为局域函数,单向耦合映像格子作为空间扩展系统构成激光时空混沌模型.通过仿真模拟检验了采用激光时空混沌模型作为网络节点的加权网络的投影同步效果.结果显示,对于任意的节点之间耦合强度的权重值,加权网络的投影同步均可以实现. 关键词： 投影同步 加权网络 时空混沌 Bragg声光双稳系统     

Scaling of average receiving time and average weighted shortest path on weighted Koch networks

In this paper we present weighted Koch networks based on classic Koch networks. A new method is used to determine the average receiving time (ART), whose key step is to write the sum of mean first-passage times (MFPTs) for all nodes to absorption at the trap located at a hub node as a recursive relation. We show that the ART exhibits a sublinear or linear dependence on network order. Thus, the weighted Koch networks are more efficient than classic Koch networks in receiving information. Moreover, average weighted shortest path (AWSP) is calculated. In the infinite network order limit, the AWSP depends on the scaling factor. The weighted Koch network grows unbounded but with the logarithm of the network size, while the weighted shortest paths stay bounded.     

Empirical investigation of topological and weighted properties of a bus transport network from China

Many bus transport networks(BTNs) have evolved into directed networks. A new representation model for BTNs is proposed, called directed-space P. The bus transport network of Harbin(BTN-H) is described as a directed and weighted complex network by the proposed representation model and by giving each node weights. The topological and weighted properties are revealed in detail. In-degree and out-degree distributions, in-weight and out-weight distributions are presented as an exponential law, respectively. There is a strong relation between in-weight and in-degree(also between out-weight and out-degree), which can be fitted by a power function. Degree–degree and weight–weight correlations are investigated to reveal that BTN-H has a disassortative behavior as the nodes have relatively high degree(or weight). The disparity distributions of out-degree and in-degree follow an approximate power-law. Besides, the node degree shows a near linear increase with the number of routes that connect to the corresponding station. These properties revealed in this paper can help public transport planners to analyze the status quo of the BTN in nature.     

基于自适应加权窗口的相位质量图提取

加权相位解缠算法的解缠精度取决于所提取的质量图的可靠性。目前提取相位质量图的方法大多采用以各个像素为中心的固定窗口法,但当某些像素被噪声严重干扰时,采用固定窗口法提取质量图往往得不到正确的解缠结果。因此,提出了几种自适应加权窗口方法来提取相位质量图,并给出了具体的实现方法和步骤,同时采用加权小波变换相位解缠算法进行相位解缠。实验结果表明,采用自适应加权窗口方法提取相位质量图来确定初始权重系数能获得比较好的解缠效果。     

Continuous Weight Attack on Complex Network

We introduce a continuous weight attack strategy and numerically investigate the effect of continuous weight attack strategy on the Barabasi-Albert （BA） scale-free network and the Erdos-Rdnyi （ER） random network. We use a weight coefficient ω to define the attack intensity. The weight coefficient ω increases continuously from 1 to infinity, where 1 represents no attack and infinity represents complete destructive attack. Our results show that the continuous weight attack on two selected nodes with small ω （ω≈ 3） could achieve the same damage of complete elimination of a single selected node on both BA and ER networks. It is found that the continuous weight attack on a single selected edge with small ω （ω≈ 2） can reach the same effect of complete elimination of a single edge on BA network, but on ER network the damage of the continuous weight attack on a single edge is c/ose to but always smaller than that of complete elimination of edge even if ω is very large.     

Topology of the Erasmus student mobility network

The collaboration network generated by the Erasmus student mobilities in the year 2003 is analyzed and modeled. Nodes of this bipartite network are European universities and links are the Erasmus mobilities between these universities. This network is a complex directed and weighted graph. The non-directed and non-weighted projection of this network does not exhibit a scale-free nature, but proves to be a small-word type random network with a giant component. The connectivity data indicates an exponential degree distribution, a relatively high clustering coefficient and a small radius. It can be easily modeled by using a simple configuration model and arguing the exponential degree distribution. The weighted and directed version of the network can also be described by means of simple random network models.     

Evolving model of weighted networks inspired by scientific collaboration networks

Inspired by scientific collaboration networks (SCN), especially our empirical analysis of econophysicists network, an evolutionary model for weighted networks is proposed. Besides a new vertex added in at every time step, old vertices can also attempt to build up new links, or to reconnect the existing links. The number of connections repeated between two nodes is converted into the weight of the link. This provides a natural way for the evolution of link weight. The path-dependent preferential attachment mechanism with local information is also introduced. It increases the clustering coefficient of the network significantly. The model shows the scale-free phenomena in degree and vertex weight distribution. It also gives well qualitatively consistent behavior with the empirical results.