Decentralised control of material or traffic flows in networks using phase-synchronisation

We present a self-organising, decentralised control method for material flows in networks. The concept applies to networks where time sharing mechanisms between conflicting flows in nodes are required and where a coordination of these local switches on a system-wide level can improve the performance. We show that, under certain assumptions, the control of nodes can be mapped to a network of phase-oscillators.By synchronising these oscillators, the desired global coordination is achieved. We illustrate the method in the example of traffic signal control for road networks. The proposed concept is flexible, adaptive, robust and decentralised. It can be transferred to other queuing networks such as production systems. Our control approach makes use of simple synchronisation principles found in various biological systems in order to obtain collective behaviour from local interactions.     

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.     

梯度耦合下神经元网络中靶波和螺旋波的诱发研究

神经系统内数量众多的神经元电活动的群体行为呈现一定的节律性和自组织性. 当网络局部区域存在异质性或者受到持续周期性刺激, 则在网络内诱发靶波, 且这些靶波如'节拍器'可调制介质中行波的诱发和传播. 基于Hindmarsh-Rose 神经元模型构造了最近邻连接下的二维神经元网络, 研究在非均匀耦合下神经元网络内有序波的诱发问题. 在研究中, 选定网络中心区域的耦合强度最大, 从中心向边界的神经元之间的耦合强度则按照阶梯式下降. 研究结果表明, 在恰当的耦合梯度下, 神经元网络内诱发的靶波或螺旋波可以占据整个网络, 并有效调制神经元网络的群体电活动, 使得整个网络呈现有序性. 特别地, 当初始值为随机值时, 梯度耦合也可以诱发稳定的有序态. 这种梯度耦合对网络群体行为调制的研究结果有助于理解神经元网络的自组织行为.     

相依网络上基于相连边的择优恢复算法

如何有效地应对和控制故障在相依网络上的级联扩散避免系统发生结构性破碎,对于相依网络抗毁性研究具有十分重要的理论价值和现实意义.最新的研究提出一种基于相依网络的恢复模型,该模型的基本思想是通过定义共同边界节点,在每轮恢复阶段找出符合条件的共同边界节点并以一定比例实施恢复.当前的做法是按照随机概率进行选择.这种方法虽然简单直观,却没有考虑现实世界中资源成本的有限性和择优恢复的必然性.为此,针对相依网络的恢复模型,本文利用共同边界节点在极大连通网络内外的连接边数计算边界节点的重要性,提出一种基于相连边的择优恢复算法(preferential recovery based on connectivity link,PRCL)算法.利用渗流理论的随机故障模型,通过ER随机网络和无标度网络构建的不同结构相依网络上的级联仿真结果表明,相比随机方法和度数优先以及局域影响力优先的恢复算法,PRCL算法具备恢复能力强、起效时间早且迭代步数少的优势,能够更有效、更及时地遏制故障在网络间的级联扩散,极大地提高了相依网络遭受随机故障时的恢复能力.     

Urban road network evolution mechanism based on the ‘direction preferred connection’ and ‘degree constraint’

The urban road network is a complex system that exhibits the properties of self-organization and emergence. Recent theoretical and empirical studies have mainly focused on the structural properties of the urban road networks. This research concentrates on some important parameters such as degree, average degree, meshedness coefficient, betweeness, etc. These parameters of the real road network exhibit specific statistical properties. Some studies show that perhaps these specific statistical properties are caused by a compromise mechanism of the formation of a minimum spanning tree and the greedy triangulation. Inspired by these results, we propose a principle to construct the network (we call it a MG network in this paper) whose structure is located between the minimum spanning tree and the greedy triangulation at first. The structural properties of the MG network are analyzed. We find the formation mechanism of the MG network cannot explain the urban road network evolution well. Then, based on the formation mechanism of the MG network, we add the ‘direction preferred connection’ and ‘degree constraint’ principles to the urban road network evolution simulation process. The result of the simulation network turns out to be a planar network that is in accordance with reality. Compared with the real road network’s structural properties, we find the simulation results are so consistent with it. It indicates the validation of the model and also demonstrates perhaps the ‘direction preferred connection’ and ‘degree constraint’ principle can explain the urban road network evolution better.     

A Resiliency-Connectivity metric in wireless sensor networks with key predistribution schemes and node compromise attacks

Applications for wireless sensor networks require widespread, highly reliable communications even in the face of adversarial influences. Maintaining connectivity and secure communications between entities are vital networking properties towards ensuring the successful and accurate completion of desired sensing tasks. We examine the required communication range for nodes in a wireless sensor network with respect to several parameters. Network properties such as key predistribution schemes and node compromise attacks are modelled with several network parameters and studied in terms of how they influence global network connectivity. These networks are physically vulnerable to malicious behavior by way of node compromise attacks that may affect global connectivity. We introduce a metric that determines the resilience of a network employing a key predistribution scheme with respect to node compromise attacks. In this work,we provide the first study of global network connectivity and its relationship to node compromise attacks. Existing work considers the relationship between the probability of node compromise and the probability of link compromise and the relationship of the probability of secure link establishment and overall network connectivity for the Erdős network model. Here, we present novel work which combines these two relationships to study the relationship between node compromise attacks and global network connectivity. Our analysis is performed with regard to large-scale networks; however, we provide simulation results for both large-scale and small-scale networks. First, we derive a single expression to determine the required communication radius for wireless sensor networks to include the effects of key predistribution schemes. From this, we derive an expression for determining required communication range after an adversary has compromised a fraction of the nodes in the network. The required communication range represents the resource usage of nodes in a network to cope with key distribution schemes and node compromise attacks. We introduce the Resiliency-Connectivity metric, which measures the resilience of a network in expending its resources to provide global connectivity in adverse situations.     

Measuring asymmetric temporal interdependencies in simulated and biological networks

We use a newly developed metric to characterize asymmetric temporal interdependencies in networks of coupled dynamical elements. We studied the formation of temporal ordering in a system of coupled Rossler oscillators for different connectivity ratios and network topologies and also applied the metric to investigate the functional structure of a biological network (cerebral ganglia of Helix snail). In the former example we show how the local ordering evolves to the global one as a function of structural parameters of the network, while in the latter we show spontaneous emergence of functional interdependence between two groups of electrodes.     

Synchronization on coupled dynamical networks

In this paper, partial synchronization (PaS) in networks of coupled chaotic oscillator systems and synchronization in sparsely coupled spatiotemporal systems are explored. For the PaS, we reveal that the existence of PaS patterns depends on the symmetry property of the network topology, while the emergence of the PaS pattern depends crucially on the stability of the corresponding solution. An analytical criterion in judging the stability of PaS state on a given network are proposed in terms of a comparison between the Lyapunov exponent spectrum of the PaS manifold and that of the transversal manifold. The competition and selections of the PaS patterns induced by the presence of multiple topological symmetries of the network are studied in terms of the criterion. The phase diagram in distinguishing the synchronous and the asynchronous states is given. The criterion in judging PaS is further applied to the study of synchronization of two sparsely coupled spatiotemporal chaotic systems. Different synchronization regimes are distinguished. The present study reveals the intrinsic collective bifurcation of coupled dynamical systems prior to the emergence of global synchronization.     

耦合含时滞的相互依存网络的局部自适应异质同步

针对由两个子网络构成的耦合含时滞的相互依存网络,研究其局部自适应异质同步问题.时滞同时存在于两个子网络的内部耦合项和子网络间的一对一相互依赖耦合项中,且网络的耦合关系满足非线性特性和光滑性.基于李雅普诺夫稳定性理论、线性矩阵不等式方法和自适应控制技术,通过对子网络设置合适的控制器,提出了使得相互依存网络的子网络分别同步到异质孤立系统的充分条件.针对小世界网络和无标度网络构成的相互依存网络进行数值模拟,验证了提出理论的正确性和有效性.     

Bootstrapping Topological Properties and Systemic Risk of Complex Networks Using the Fitness Model

In this paper we present a novel method to reconstruct global topological properties of a complex network starting from limited information. We assume to know for all the nodes a non-topological quantity that we interpret as fitness. In contrast, we assume to know the degree, i.e. the number of connections, only for a subset of the nodes in the network. We then use a fitness model, calibrated on the subset of nodes for which degrees are known, in order to generate ensembles of networks. Here, we focus on topological properties that are relevant for processes of contagion and distress propagation in networks, i.e. network density and k-core structure, and we study how well these properties can be estimated as a function of the size of the subset of nodes utilized for the calibration. Finally, we also study how well the resilience to distress propagation in the network can be estimated using our method. We perform a first test on ensembles of synthetic networks generated with the Exponential Random Graph model, which allows to apply common tools from statistical mechanics. We then perform a second test on empirical networks taken from economic and financial contexts. In both cases, we find that a subset as small as 10 % of nodes can be enough to estimate the properties of the network along with its resilience with an error of 5 %.     

Motif structure and cooperation in real-world complex networks

Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs’ cooperation properties and their abundance in a number of real-world networks including yeast protein-protein interaction, human brain, protein structure, email communication, dolphins’ social interaction, Zachary karate club and Net-science coauthorship networks. First, the amount of cooperativity for all possible undirected subgraphs with three to six nodes is calculated. To this end, the evolutionary dynamics of the Prisoner’s Dilemma game is considered and the cooperativity of each subgraph is calculated as the percentage of cooperating agents at the end of the simulation time. Then, the three- to six-node motifs are extracted for each network. The significance of the abundance of a motif, represented by a Z-value, is obtained by comparing them with some properly randomized versions of the original network. We found that there is always a group of motifs showing a significant inverse correlation between their cooperativity amount and Z-value, i.e. the more the Z-value the less the amount of cooperativity. This suggests that networks composed of well-structured units do not have good cooperativity properties.     

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.     

Complexity in human transportation networks: a comparative analysis of worldwide air transportation and global cargo-ship movements

We present a comparative network-theoretic analysis of the two largest global transportation networks: the worldwide air-transportation network (WAN) and the global cargo-ship network (GCSN). We show that both networks exhibit surprising statistical similarities despite significant differences in topology and connectivity. Both networks exhibit a discontinuity in node and link betweenness distributions which implies that these networks naturally segregate into two different classes of nodes and links. We introduce a technique based on effective distances, shortest paths and shortest path trees for strongly weighted symmetric networks and show that in a shortest path tree representation the most significant features of both networks can be readily seen. We show that effective shortest path distance, unlike conventional geographic distance measures, strongly correlates with node centrality measures. Using the new technique we show that network resilience can be investigated more precisely than with contemporary techniques that are based on percolation theory. We extract a functional relationship between node characteristics and resilience to network disruption. Finally we discuss the results, their implications and conclude that dynamic processes that evolve on both networks are expected to share universal dynamic characteristics.     

Elimination mechanism promotes cooperation in coevolutionary prisoner’s dilemma games

We propose an elimination mechanism in the study of the evolutionary prisoner’s dilemma games on evolving networks. It assumes that after each round of playing, players whose payoffs are below a certain threshold will be eliminated from the game and the same number of new nodes will be added to the network to maintain the size of the network constant. Numerical results show that moderate values of elimination threshold can result in a maximum cooperation level in the evolutionary prisoner’s dilemma game. Moreover, the elimination mechanism can make the network structure evolve into a high heterogeneity in degree distribution, which is considered to be helpful in promoting cooperation in evolutionary games. The present study may provide new insight for understanding the evolution of cooperation in light of the law ‘survival of the fittest’ in nature.     

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

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

Other-regarding preference and the evolutionary prisoner’s dilemma on complex networks

Prevailing models of the evolutionary prisoner’s game on networks always assume that agents are pursuing their own profit maximization. But the results from experimental games show that many agents have other-regarding preference. In this paper, we study the emergence of cooperation from the prisoner’s dilemma game on complex networks while some agents exhibit other-regarding preference such as inequality aversion, envious and guilty emotions. Contrary to common ideas, the simulation results show that the existence of inequality aversion agents does not promote cooperation emergence on a BA (Barabási and Albert) scale-free network in most situations. If the defection attraction is big and agents exhibit strong preference for inequality aversion, the frequency of cooperators will be lower than in situations where no inequality aversion agents exist. In some cases, the existence of the inequality agents will even induce the frequency of cooperators to zero, a feature which is not observed in previous research on the prisoner’s dilemma game when the underlying interaction topology is a BA scale-free network. This means that if an agent cares about equality too much, it will be difficult for cooperation to emerge and the frequency of cooperators will be low on BA networks. The research on the effect of envy or guilty emotions on the emergence of cooperation in the prisoner’s dilemma game on BA networks obtains similar results, though some differences exist. However, simulation results on a WS (Watts and Strogatz) small-world network display another scenario. If agents care about the inequality of agents very much, the WS network favors cooperation emergence in the prisoners’ dilemma game when other-regarding agents exist. If the agent weight on other-regarding is lowered, the cooperation frequencies emerging on a WS network are not much different from those in situations without other-regarding agents, although the frequency of cooperators is lower than those of the situation without other-regarding preference agents sometimes. All the simulation results imply that inequality aversion and its variations can have important effects on cooperation emergence in the prisoner’s dilemma game, and different network topologies have different effects on cooperation emergence in the prisoner’s dilemma game played on complex networks.     

Networks that optimize a trade-off between efficiency and dynamical resilience

In this Letter we study networks that have been optimized to realize a trade-off between communication efficiency and dynamical resilience. While the first is related to the average shortest pathlength, we argue that the second can be measured by the largest eigenvalue of the adjacency matrix of the network. Best efficiency is realized in star-like configurations, while enhanced resilience is related to the avoidance of short loops and degree homogeneity. Thus crucially, very efficient networks are not resilient while very resilient networks lack in efficiency. Networks that realize a trade-off between both limiting cases exhibit core-periphery structures, where the average degree of core nodes decreases but core size increases as the weight is gradually shifted from a strong requirement for efficiency and limited resilience towards a smaller requirement for efficiency and a strong demand for resilience. We argue that both, efficiency and resilience are important requirements for network design and highlight how networks can be constructed that allow for both.     

Adaptive synchronization of weighted complex dynamical networks through pinning

This paper considers the problem of controlling weighted complex dynamical networks by applying adaptive control to a fraction of network nodes. We investigate the local and global synchronization of the controlled dynamical network through the construction of a master stability function and a Lyapunov function. Analytical results show that a certain number of nodes can be controlled by using adaptive pinning to ensure the synchronization of the entire network. We present numerical simulations to verify the effectiveness of the proposed scheme. In comparison with feedback pinning, the proposed pinning control scheme is robust when tested by noise, different weighting and coupling structures, and time delays.