Exploring evolutionary features of directed weighted hazard network in the subway construction

A better understanding of previous accidents is an effective way to reduce the occurrence of similar accidents in the future. In this paper, a complex network approach is adopted to construct a directed weighted hazard network(DWHN) to analyze topological features and evolution of accidents in the subway construction. The nodes are hazards and accidents, the edges are multiple relationships of these nodes and the weight of edges are occurrence times of repetitive relationships. The results indicate that the DWHN possesses the property of small-world with small average path length and large clustering coefficient, indicating that hazards have better connectivity and will spread widely and quickly in the network. Moreover,the DWHN has the property of scale-free network for the cumulative degree distribution follows a power-law distribution.It makes DWHN more vulnerable to target attacks. Controlling key nodes with higher degree, strength and betweenness centrality will destroy the connectivity of DWHN and mitigate the spreading of accidents in the network. This study is helpful for discovering inner relationships and evolutionary features of hazards and accidents in the subway construction.     

Do topological parameters of amino acids within protein contact networks depend on their physico-chemical properties?

The three dimensional structure of a protein is determined by the interactions of its constituent amino acids. Considering the amino acids as nodes and the non-bonded interactions among them in 3D space as edges, researchers have constructed protein contact networks and analyzed the values of several topological parameters to uncover different important aspects of proteins. Here, we have analyzed some of the topological parameters such as degree, strength, clustering coefficients, betweenness and closeness centrality of each of the twenty amino acids in a set of non-redundant proteins covering all classes and folds. The results show that the values of these topological parameters vary widely with different amino acids. Also, these values differ significantly with different length scales of proteins. Most of the hydrophobic residues along with Cys, Arg and His have larger contributions to the long range connectivities than short range. We have also studied whether the values of topological parameters have any significant dependency on the physico-chemical properties of the amino acids. While the clustering coefficients show a strong negative correlation with residual volumes, surface areas and number of atoms in the side chains of amino acids; the degrees, strengths and betweenness show positive correlations with the mentioned properties. All the topological parameters show high dependency on bulkiness and average area buried of the amino acid residues in all-range residue networks. The average degree shows higher dependency on hydrophobicity, while the average strength is more able to capture the essences of surface area, residual volume and number of atoms of amino acids. The hydrophobicities of the amino acids and their corresponding degrees show a higher positive correlation in long range networks (LRNs) than short range networks (SRNs). The closeness centrality shows high correlation with two hydrophobic scales and no correlation with surface area, residual volume or number of atoms in LRNs. We have further explored the relationship in hydrophobic, hydrophilic and charged residues separately. Interestingly, charged residues show a higher dependency on the number of atoms than their residual volumes and surface areas. Finally, we present a linear regression model relating the network parameters with physico-chemical properties of amino acids.     

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.     

Characteristics of the network of scientific journals pertaining to Chinese patents

We present the network of scientific journals pertaining to Chinese patent data in the period of 1995-2002, in which two journals are considered linked if they have been cited by a common patent. We study a variety of statistical properties of the network of scientific journals of China (NSJC), including degree distribution, local clustering and average degree of the nearest neighbors in the one-mode projected network. Besides this, we generate a weighted network for the NSJC in which the number of common patents citing two particular journals is mapped to line weights. For such a weighted network, distributions of weight, vertex strength, weight per degree, and the relationship between the vertex strength and degree have been analyzed. The above findings show that for the NSJC, small-world behavior is not distinct, while properties of random networks are observed.     

基于复杂网络理论的北京公交网络拓扑性质分析

为分析公交复杂网络的拓扑性质, 本文以北京市为例, 选取截止到2010年7月的北京全市(14区、2县)的1165条公交线路和9618个公交站点为样本数据, 运用复杂网络理论构建起基于邻接站点的有向加权复杂网络模型. 该方法以公交站点作为节点, 相邻站点之间的公交线路作为边, 使得网络既具有复杂网络的拓扑性质同时节点(站点)又具有明确的地理坐标. 对网络中节点度、点强度、强度分布、平均最短路径、聚类系数等性质的分析显示, 公交复杂网络的度和点强度分布极为不均, 网络中前5%和前10%节点的累计强度分布分别达到22.43%和43.02%; 点强度与排列序数、累积强度分布都服从幂律分布, 具有无标度和小世界的网络特点, 少数关键节点在网络中发挥着重要的连接作用. 为分析复杂网络中的关键节点, 本文通过承载压力分析和基于"掠夺" 的区域中心节点提取两种方法, 得到了公交复杂网络中两类不同表现的关键节点. 这些规律也为优化城市公交网络及交通规划发展提供了新的参考建议.     

Empirical analysis of the worldwide maritime transportation network

In this paper we present an empirical study of the worldwide maritime transportation network (WMN) in which the nodes are ports and links are container liners connecting the ports. Using the different representations of network topology — the spaces L and P, we study the statistical properties of WMN including degree distribution, degree correlations, weight distribution, strength distribution, average shortest path length, line length distribution and centrality measures. We find that WMN is a small-world network with power law behavior. Important nodes are identified based on different centrality measures. Through analyzing weighted clustering coefficient and weighted average nearest neighbors degree, we reveal the hierarchy structure and rich-club phenomenon in the network.     

Connectivity correlations in three topological spaces of urban bus-transport networks in China

In this paper, an empirical investigation is presented, which focuses on unveiling the universality of connectivity correlations in three spaces （the route space, the stop geographical space and bus-transferring space） of urban bustransport networks （BTNs） in four major cities of China. The underlying features of the connectivity correlations are shown in two statistical ways. One is the correlation between the （weighted） average degree of all the nearest neighbouring vertices with degree k, （Knn^w,（k）） Knn（k）, and k, and the other is the correlations between the assortativity coefficient r and, respectively, the network size N, the network diameter D, the averaged clustering coefficient C, and the averaged distance （l）. The obtained results show qualitatively the same connectivity correlations of all the considered cities under all the three spaces.     

Age-based model for weighted network with general assortative mixing

In this paper, we propose an evolutionary model for weighted networks by introducing an age-based mutual selection mechanism. Our model generates power-law distributions of degree, weight, and strength, which are confirmed by analytical predictions and are consistent with real observations. The investigation of the relationship between clustering and the connectivity of nodes suggests hierarchical organization in the weighted networks. Furthermore, both assortative and disassortative properties can be naturally obtained by tuning a parameter α, which controls the strength of age-based preferential attachments. Since the age information of nodes is easier to acquire than the degree and strength of nodes, and almost all empirically observed structural and weighted properties can be reproduced by the simple evolutionary regulation, our model may reveal some underlying mechanisms that are key for the evolution of weighted complex networks.     

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

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

Entropy-Based Graph Clustering of PPI Networks for Predicting Overlapping Functional Modules of Proteins

Functional modules can be predicted using genome-wide protein–protein interactions (PPIs) from a systematic perspective. Various graph clustering algorithms have been applied to PPI networks for this task. In particular, the detection of overlapping clusters is necessary because a protein is involved in multiple functions under different conditions. graph entropy (GE) is a novel metric to assess the quality of clusters in a large, complex network. In this study, the unweighted and weighted GE algorithm is evaluated to prove the validity of predicting function modules. To measure clustering accuracy, the clustering results are compared to protein complexes and Gene Ontology (GO) annotations as references. We demonstrate that the GE algorithm is more accurate in overlapping clusters than the other competitive methods. Moreover, we confirm the biological feasibility of the proteins that occur most frequently in the set of identified clusters. Finally, novel proteins for the additional annotation of GO terms are revealed.     

A highly clustered scale-free network evolved by random walking

In present paper, we propose a highly clustered weighted network model that incorporates the addition of a new node with some links, new links between existing nodes and the edge's weight dynamical evolution based on weight-dependent walks at each time step. The analytical approach and numerical simulation show that the system grows into a weighted network with the power-law distributions of strength, weight and degree. The weight-dependent walk length l will not influence the strength distribution, but the clustering coefficient of the network is sensitive to l. Particularly, the clustering coefficient is especially high and almost independent of the network size when l=2.     

A weighted network evolution with traffic flow

In this paper, we propose a simple weighted network model that generalizes the complex network model evolution with traffic flow previously presented to investigate the relationship between traffic flow and network structure. In the model, the nodes in the network are represented by the traffic flow states, the links in the network are represented by the transform of the traffic flow states, and the traffic flow transported when performing the transform of the traffic flow states is considered as the weight of the link. Several topological features of this generalized weighted model, such as the degree distribution and strength distribution, have been numerically studied. A scaling behavior between the strength and degree s∼klogk is obtained. By introducing some constraints to the generalized weighted model, we study its subnetworks and find that the scaling behavior between the strength and degree is conserved, though the topology properties are quite sensitive to the constraints.     

Competition and adaptation in an Internet evolution model

We model the evolution of the Internet at the autonomous system level as a process of competition for users and adaptation of bandwidth capability. From a weighted network formalism, where both nodes and links are weighted, we find the exponent of the degree distribution as a simple function of the growth rates of the number of autonomous systems and connections in the Internet, both empirically measurable quantities. Our approach also accounts for a high level of clustering as well as degree-degree correlations, both with the same hierarchical structure present in the real Internet. Further, it also highlights the interplay between bandwidth, connectivity, and traffic of the network.     

基于Web 2.0的边与节点同时增长网络模型

模拟了Web2.0网络的发展过程并研究其拓扑结构,分析某门户网站实际博客数据的度分布、节点度时间变化,发现与先前的无标度网络模型有所差别.根据真实网络的生长特点,提出了边与节点同时增长的网络模型,包括随机连接及近邻互联的网络构造规则.仿真研究表明,模拟的网络更接近实际,在没有优先连接过程时,模型能得到幂率的度分布;并且网络有更大的聚类系数以及正的度相关性。     

中国铁路客运网网络性质的研究

中国铁路客运系统可以采用两种不同的网络构建方式来描述. 一种是以铁路的站点作为“节点”，并以轨道作为“边”，这样生成的网络称为铁路地理网. 统计显示该网络的平均群聚系数〈C〉近似为零，故该网络为树状网络. 另一种是以站点作为“节点”，任意两个站点间只要有同一列车在这两个站点停靠，就可以认为这两个站点间有连线，这样生成的网络称为车流网. 统计显示该网络有较大的平均群聚系数和较小的平均网络距离〈d〉，而且该网络节点的度分布基本上服从无标度幂律分布，故车流网为具有无标度性质的小世界网络. 关键词： 铁路地理网 车流网 小世界 无标度分布     

Empirical analysis of a scale-free railway network in China

We present a detailed, empirical analysis of the statistical properties of the China Railway Network (CRN) consisting of 3915 nodes (train stations) and 22 259 edges (railways). Based on this, CRN displays two explicit features already observed in numerous real-world and artificial networks. One feature, the small-world property, has the fingerprint of a small characteristic shortest-path length, 3.5, accompanied by a high degree of clustering, 0.835. Another feature is characterized by the scale-free distributions of both degrees and weighted degrees, namely strengths. Correlations between strength and degree, degree and degree, and clustering coefficient and degree have been studied and the forms of such behaviors have been identified. In addition, we investigate distributions of clustering coefficients, topological distances, and spatial distances.     

A Mixed Mechanism of Weighted-Driven and Inner Selection in Networks

For most networks, the weight of connection is changing with their attachment and inner affinity. By introducing a mixed mechanism of weighted-driven and inner selection, the model exhibits wide range power-law distributions of node strength and edge weight, and the exponent can be adjusted by not only the parameter δ but also the probability q. Furthermore, we investigate the weighted average shortest distance, clustering coefficient, and the correlation of our network. In addition, the weighted assortativity coefficient which characterizes important information of weighted topological networks has been discussed, but the variation of coefficients is much smaller than the former researches.     

多种形式的加权广义Farey组织网络金字塔的复杂性

构建了三类确定性加权广义Farey组织的网络金字塔.理论推导并数值计算了网络金字塔的拓扑性质(度分布、平均最短路径、平均聚类系数和相称性系数等),进而将Farey序列作为网络节点的确定、随机和混合的三种权重值,以此为基础计算并拟合了三类网络金字塔的点的强度分布和边的权重分布.计算结果初步揭示了加权广义Farey组织的网络金字塔的复杂性特征,有助于了解一些实际网络的复杂性和多样性.     

Optimization of network structure to random failures

Network's resilience to the malfunction of its components has been of great concern. The goal of this work is to determine the network design guidelines, which maximizes the network efficiency while keeping the cost of the network (that is the average connectivity) constant. With a global optimization method, memory tabu search (MTS), we get the optimal network structure with the approximately best efficiency. We analyze the statistical characters of the network and find that a network with a small quantity of hub nodes, high degree of clustering may be much more resilient to perturbations than a random network and the optimal network is one kind of highly heterogeneous networks. The results strongly suggest that networks with higher efficiency are more robust to random failures. In addition, we propose a simple model to describe the statistical properties of the optimal network and investigate the synchronizability of this model.     

Choosing effective controlled nodes for scale-free network synchronization

Previous studies concerning pinning control of complex-network synchronization have very often demonstrated that in an unweighted symmetrical scale-free network, controlling the high-degree nodes is more efficient than controlling randomly chosen ones; due to the heterogeneity of the node-degree or edge-connection distribution of the scale-free network, small-degree nodes have relatively high probabilities of being chosen at random but their control has less influence on the other nodes through the network. This raises the question of whether or not controlling the high-degree nodes is always better than controlling the small ones in scale-free networks. Our answer to this is yes and no. In this study, we carry out extensive numerical simulations to show that in an unweighted symmetrical Barabasi-Albert scale-free network, when the portion of controlled nodes is relatively large, controlling the small nodes becomes better than controlling the big nodes and controlling randomly chosen nodes has approximately the same effect as controlling the big ones. However, we also show that for normalized weighted scale-free networks, controlling the big nodes is in fact always better than controlling the small ones.