Boolean networks with variable number of inputs (K)

We studied a random Boolean network model with a variable number of inputs K per element. An interesting feature of this model, compared to the well-known fixed-K networks, is its higher orderliness. It seems that the distribution of connectivity alone contributes to a certain amount of order. In the present research, we tried to disentangle some of the reasons for this unexpected order. We also studied the influence of different numbers of source elements (elements with no inputs) on the network's dynamics. An analysis carried out on the networks with an average value of K=2 revealed a correlation between the number of source elements and the dynamic diversity of the network. As a diversity measure we used the number of attractors, their lengths and similarity. As a quantitative measure of the attractors' similarity, we developed two methods, one taking into account the size and the overlapping of the frozen areas, and the other in which active elements are also taken into account. As the number of source elements increases, the dynamic diversity of the networks does likewise: the number of attractors increases exponentially, while their similarity diminishes linearly. The length of attractors remains approximately the same, which indicates that the orderliness of the networks remains the same. We also determined the level of order that originates from the canalizing properties of Boolean functions and the propagation of this influence through the network. This source of order can account only for one-half of the frozen elements; the other half presumably freezes due to the complex dynamics of the network. Our work also demonstrates that different ways of assigning and redirecting connections between elements may influence the results significantly. Studying such systems can also help with modeling and understanding a complex organization and self-ordering in biological systems, especially the genetic ones.     

Mobile user forecast and power-law acceleration invariance of scale-free networks

This paper studies and predicts the number growth of China's mobile users by using the power-law regression. We find that the number growth of the mobile users follows a power law. Motivated by the data on the evolution of the mobile users, we consider scenarios of self-organization of accelerating growth networks into scale-free structures and propose a directed network model, in which the nodes grow following a power-law acceleration. The expressions for the transient and the stationary average degree distributions are obtained by using the Poisson process. This result shows that the model generates appropriate power-law connectivity distributions. Therefore, we find a power-law acceleration invariance of the scale-free networks. The numerical simulations of the models agree with the analytical results well.     

Order or chaos in Boolean gene networks depends on the mean fraction of canalizing functions

We explore the connection between order/chaos in Boolean networks and the naturally occurring fraction of canalizing functions in such systems. This fraction turns out to give a very clear indication of whether the system possesses ordered or chaotic dynamics, as measured by Derrida plots, and also the degree of order when we compare different networks with the same number of vertices and edges. By studying also a wide distribution of indegrees in a network, we show that the mean probability of canalizing functions is a more reliable indicator of the type of dynamics for a finite network than the classical result on stability relating the bias to the mean indegree. Finally, we compare by direct simulations two biologically derived networks with networks of similar sizes but with power-law and Poisson distributions of indegrees, respectively. The biologically motivated networks are not more ordered than the latter, and in one case the biological network is even chaotic while the others are not.     

Theory of rumour spreading in complex social networks

We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular, those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behaviour and dynamics of the model on several models of such networks: random graphs, uncorrelated scale-free networks and scale-free networks with assortative degree correlations. We show that in both homogeneous networks and random graphs the model exhibits a critical threshold in the rumour spreading rate below which a rumour cannot propagate in the system. In the case of scale-free networks, on the other hand, this threshold becomes vanishingly small in the limit of infinite system size. We find that the initial rate at which a rumour spreads is much higher in scale-free networks than in random graphs, and that the rate at which the spreading proceeds on scale-free networks is further increased when assortative degree correlations are introduced. The impact of degree correlations on the final fraction of nodes that ever hears a rumour, however, depends on the interplay between network topology and the rumour spreading rate. Our results show that scale-free social networks are prone to the spreading of rumours, just as they are to the spreading of infections. They are relevant to the spreading dynamics of chain emails, viral advertising and large-scale information dissemination algorithms on the Internet.     

Number and length of attractors in a critical Kauffman model with connectivity one

The Kauffman model describes a system of randomly connected nodes with dynamics based on Boolean update functions. Though it is a simple model, it exhibits very complex behavior for "critical" parameter values at the boundary between a frozen and a disordered phase, and is therefore used for studies of real network problems. We prove here that the mean number and mean length of attractors in critical random Boolean networks with connectivity one both increase faster than any power law with network size. We derive these results by generating the networks through a growth process and by calculating lower bounds.     

Dynamics of complex systems: scaling laws for the period of boolean networks

Boolean networks serve as models for complex systems, such as social or genetic networks, where each vertex, based on inputs received from selected vertices, makes its own decision about its state. Despite their simplicity, little is known about the dynamical properties of these systems. Here we propose a method to calculate the period of a finite Boolean system, by identifying the mechanisms determining its value. The proposed method can be applied to systems of arbitrary topology, and can serve as a roadmap for understanding the dynamics of large interacting systems in general.     

Scaling in ordered and critical random boolean networks

Random Boolean networks, originally invented as models of genetic regulatory networks, are simple models for a broad class of complex systems that show rich dynamical structures. From a biological perspective, the most interesting networks lie at or near a critical point in parameter space that divides "ordered" from "chaotic" attractor dynamics. We study the scaling of the average number of dynamically relevant nodes and the median number of distinct attractors in such networks. Our calculations indicate that the correct asymptotic scalings emerge only for very large systems.     

蛋白质相互作用网络特征的理论再现

无标度性、小世界性、功能模块结构及度负关联性是大量生物网络共同的特征. 为了理解生物网络无标度性、小世界性和度负关联性的形成机制, 研究者已经提出了各种各样基于复制和变异的网络增长模型. 在本文中,我们从生物学的角度通过引入偏爱小复制原则及变异和非均匀的异源二聚作用构建了一个简单的蛋白质相互作用网络演化模型.数值模拟结果表明,该演化模型几乎可以再现现在实测结果所公认的蛋白质相互作用网络的性质：无标度性、小世界性、度负关联性和功能模块结构. 我们的演化模型对理解蛋白质相互作用网络演化过程中的可能机制提供了一定的帮助. 关键词： 蛋白质相互作用网络 偏爱小 非均匀的异源二聚作用 功能模块结构     

Self-Organized Optimization of Transport on Complex Networks

We propose a self-organized optimization mechanism to improve the transport capacity of complex gradient networks.We find that,regardless of network topology,the congestion pressure can be strongly reduced by the self-organized optimization mechanism.Furthermore,the random scale-free topology is more efficient to reduce congestion compared with the random Poisson topology under the optimization mechanism.The reason is that the optimization mechanism introduces the correlations between the gradient field and the local topology of the substrate network.Due to the correlations,the cutoff degree of the gradient network is strongly reduced and the number of the nodes exerting their maximal transport capacity consumedly increases.Our work presents evidence supporting the idea that scale-free networks can efficiently improve their transport capacity by selforganized mechanism under gradient-driven transport mode.     

Modified DM Models for Aging Networks Based on Neighborhood Connectivity

Two modified Dorogovtsev-Mendes （DM） models of aging networks based on the dynamics of connecting nearest-neighbors are introduced. One edge of the new site is connected to the old site with probability - kt^-α as in the DM＇s model, where the degree and age of the old site are k and t, respectively. We consider two cases, i.e. the other edges of the new site attaching to the nearest-neighbors of the old site with uniform and degree connectivity probability, respectively. The network structure changes with an increase of aging exponent α It is found that the networks can produce scale-free degree distributions with small-world properties. And the different connectivity probabilities lead to the different properties of the networks.     

Excitable elements controlled by noise and network structure

We study collective dynamics of complex networks of stochastic excitable elements, active rotators. In the thermodynamic limit of infinite number of elements, we apply a mean-field theory for the network and then use a Gaussian approximation to obtain a closed set of deterministic differential equations. These equations govern the order parameters of the network. We find that a uniform decrease in the number of connections per element in a homogeneous network merely shifts the bifurcation thresholds without producing qualitative changes in the network dynamics. In contrast, heterogeneity in the number of connections leads to bifurcations in the excitable regime. In particular we show that a critical value of noise intensity for the saddle-node bifurcation decreases with growing connectivity variance. The corresponding critical values for the onset of global oscillations (Hopf bifurcation) show a non-monotone dependency on the structural heterogeneity, displaying a minimum at moderate connectivity variances.     

用户需求行为对互联网动力学整体特性的影响

由Internet构成的复杂网络的动力学特性主要受到用户需求行为的影响,具备时域的统计规律性. 通过对区域群体用户需求行为的时域实验统计分析,发现用户对Web网站的访问频度及其生成的二分网络的入度分布也呈现幂律分布和集聚现象,其幂指数介于1.7到1.8之间. 建立了虚拟资源网络VRN和物理拓扑网络PTN双层模型,分析了双层模型映射机理,并对网络用户需求行为进行建模. 虚拟资源网络VRN对物理拓扑网络PTN映射过程的不同机理,模拟了Internet资源网络到物理网络的不同影响模式. 幂律分布的用户需求特性会 关键词： 复杂网络 无标度拓扑 用户需求 相变     

Velocity and hierarchical spread of epidemic outbreaks in scale-free networks

We study the effect of the connectivity pattern of complex networks on the propagation dynamics of epidemics. The growth time scale of outbreaks is inversely proportional to the network degree fluctuations, signaling that epidemics spread almost instantaneously in networks with scale-free degree distributions. This feature is associated with an epidemic propagation that follows a precise hierarchical dynamics. Once the highly connected hubs are reached, the infection pervades the network in a progressive cascade across smaller degree classes. The present results are relevant for the development of adaptive containment strategies.     

一种强容侵能力的无线传感器网络无标度拓扑模型研究

针对无线传感器网络无标度拓扑容侵能力差的问题,本文借助节点批量到达的Poisson网络模型,提出了一种具有容侵优化特性的无标度拓扑模型,并在构建拓扑时引入剩余能量调节因子和节点度调节因子,得到了一种幂率指数可以在(1,+∞)调节的无标度拓扑结构,并通过网络结构熵优化幂率指数,得出了具有强容侵特性的幂律指数值.实验结果表明:新的拓扑保持了无标度网络的强容错性,增强了无标度网络的容侵性,并具有较好的节能优势.     

Synchronizability of chaotic logistic maps in delayed complex networks

We study a network of coupled logistic maps whose interactions occur with a certain distribution of delay times. The local dynamics is chaotic in the absence of coupling and thus the network is a paradigm of a complex system. There are two regimes of synchronization, depending on the distribution of delays: when the delays are sufficiently heterogeneous the network synchronizes on a steady-state (that is unstable for the uncoupled maps); when the delays are homogeneous, it synchronizes in a time-dependent state (that is either periodic or chaotic). Using two global indicators we quantify the synchronizability on the two regimes, focusing on the roles of the network connectivity and the topology. The connectivity is measured in terms of the average number of links per node, and we consider various topologies (scale-free, small-world, star, and nearest-neighbor with and without a central hub). With weak connectivity and weak coupling strength, the network displays an irregular oscillatory dynamics that is largely independent of the topology and of the delay distribution. With heterogeneous delays, we find a threshold connectivity level below which the network does not synchronize, regardless of the network size. This minimum average number of neighbors seems to be independent of the delay distribution. We also analyze the effect of self-feedback loops and find that they have an impact on the synchronizability of small networks with large coupling strengths. The influence of feedback, enhancing or degrading synchronization, depends on the topology and on the distribution of delays.     

A neighbourhood evolving network model

Many social, technological, biological and economical systems are best described by evolved network models. In this short Letter, we propose and study a new evolving network model. The model is based on the new concept of neighbourhood connectivity, which exists in many physical complex networks. The statistical properties and dynamics of the proposed model is analytically studied and compared with those of Barabási–Albert scale-free model. Numerical simulations indicate that this network model yields a transition between power-law and exponential scaling, while the Barabási–Albert scale-free model is only one of its special (limiting) cases. Particularly, this model can be used to enhance the evolving mechanism of complex networks in the real world, such as some social networks development.     

Coevolution of information processing and topology in hierarchical adaptive random Boolean networks

Random Boolean Networks (RBNs) are frequently used for modeling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive random Boolean Network (HARBN) as a system consisting of distinct adaptive RBNs (ARBNs) – subnetworks – connected by a set of permanent interlinks. We investigate mean node information, mean edge information as well as mean node degree. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. The main natural feature of ARBNs, i.e. their adaptability, is preserved in HARBNs and they evolve towards critical configurations which is documented by power law distributions of network attractor lengths. The mean information processed by a single node or a single link increases with the number of interlinks added to the system. The mean length of network attractors and the mean steady-state connectivity possess minima for certain specific values of the quotient between the density of interlinks and the density of all links in networks. It means that the modular network displays extremal values of its observables when subnetworks are connected with a density a few times lower than a mean density of all links.     

Effects of small world topology on the critical boundary for Boolean networks

Due to their complexity, real dynamic systems are widely regarded as operating on the boundary between order and chaos. Therefore it is of great interest to determine analytical expressions for this boundary. For random Boolean networks model, a well known critical value of bias is established as , where K is the mean connectivity. Recent research shows, however, that this expression may need to be modified. In this paper, we shall focus on the effects of topology deviation from the random network assumption since the topologies of many real networks are neither pure random nor fully regular Boolean networks. A modification of the critical boundary condition is given with parameters of the degree distribution in the setting of more realistic networks modeled with small world features.     

Novel hybrid mitigation strategy for improving the resiliency of hierarchical networks subjected to attacks

This paper studies the resiliency of hierarchical networks when subjected to random errors, static attacks, and cascade attacks. The performance is compared with existing Erdös–Rényi (ER) random networks and Barabasi and Albert (BA) scale-free networks using global efficiency as the common performance metric. The results show that critical infrastructures modeled as hierarchical networks are intrinsically efficient and are resilient to random errors, however they are more vulnerable to targeted attacks than scale-free networks. Based on the response dynamics to different attack models, we propose a novel hybrid mitigation strategy that combines discrete levels of critical node reinforcement with additional edge augmentation. The proposed modified topology takes advantage of the high initial efficiency of the hierarchical network while also making it resilient to attacks. Experimental results show that when the level of damage inflicted on a critical node is low, the node reinforcement strategy is more effective, and as the level of damage increases, the additional edge augmentation is highly effective in maintaining the overall network resiliency.     

Number theoretic example of scale-free topology inducing self-organized criticality

In this Letter we present a general mechanism by which simple dynamics running on networks become self-organized critical for scale-free topologies. We illustrate this mechanism with a simple arithmetic model of division between integers, the division model. This is the simplest self-organized critical model advanced so far, and in this sense it may help to elucidate the mechanism of self-organization to criticality. Its simplicity allows analytical tractability, characterizing several scaling relations. Furthermore, its mathematical nature brings about interesting connections between statistical physics and number theoretical concepts. We show how this model can be understood as a self-organized stochastic process embedded on a network, where the onset of criticality is induced by the topology.