Different Epidemic Models on Complex Networks

Models for diseases spreading are not just limited to SIS or SIR. For instance, for the spreading of AIDS/HIV, the susceptible individuals can be classified into different cases according to their immunity, and similarly, the infected individuals can be sorted into different classes according to their infectivity. Moreover, some diseases may develop through several stages. Many authors have shown that the individuals＇ relation can be viewed as a complex network. So in this paper, in order to better explain the dynamical behavior of epidemics, we consider different epidemic models on complex networks, and obtain the epidemic threshold for each ease. Finally, we present numerical simulations for each case to verify our results.     

Poor rich demarcation of Matthew effect on scale-free systems and its application

In a scale-free network,only a minority of nodes are connected very often,while the majority of nodes are connected rarely. However,what is the ratio of minority nodes to majority nodes resulting from the Matthew effect In this paper,based on a simple preferential random model,the poor-rich demarcation points are found to vary in a limited range,and form a poor-rich demarcation interval that approximates to k/m ∈ [3,4]. As a result,the (cumulative) degree distribution of a scale-free network can be divided into three intervals: the poor interval,the demarcation interval and the rich interval. The inequality of the degree distribution in each interval is measured. Finally,the Matthew effect is applied to the ABC analysis of project management.     

Co-evolution of the brand effect and competitiveness in evolving networks

The principle that ‘the brand effect is attractive’ underlies the preferential attachment. Here we show that the brand effect is just one dimension of attractiveness. Another dimension is competitiveness. We firstly introduce a general framework that allows us to investigate the competitive aspect of real networks, instead of simply preferring popular nodes. Our model accurately describes the evolution of social and technological networks. The phenomenon that more competitive nodes become richer can help us to understand the evolution of many competitive systems in nature and society. In general,the paper provides an explicit analytical expression of degree distributions of the network. In particular, the model yields a nontrivial time evolution of nodes’ properties and the scale-free behavior with exponents depending on the microscopic parameters characterizing the competition rules. Secondly, through theoretical analyses and numerical simulations, we reveal that our model has not only the universality for the homogeneous weighted network, but also the character for the heterogeneous weighted network. Thirdly, we also develop a model based on the profit-driven mechanism. It can better describe the observed phenomenon in enterprise cooperation networks. We show that the standard preferential attachment,the growing random graph, the initial attractiveness model, the fitness model, and weighted networks can all be seen as degenerate cases of our model.     

Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks

In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration.     

Relaxation Dynamics in Condensation on Weighted Scale-Free Networks

Most of the realistic networks are weighted scale-free networks. How this structure influences the condensation on it is a challenging problem. Recently, we make a first step to discuss its condensation [Phys. Rev. E 74 （2006） 036101] and here we focus on its evolutionary process of phase transition. In order to show how the weighted transport influences the dynamical properties, we study the relaxation dynamics in a zero range process on weighted scale-free networks. We find that there is a hierarchical relaxation dynamics in the evolution and there is a scaling relation between the relaxation time and the jumping exponent. The relaxation dynamics can be illustrated by a mean-field equation. The theoretical predictions are confirmed by our numerical simulations.     

Complex Behavior in a Selective Aging Neuron Model Based on Small World Networks

Complex behavior in a selective aging simple neuron model based on small world networks is investigated. The basic elements of the model are endowed with the main features of a neuron function. The structure of the selective aging neuron model is discussed. We also give some properties of the new network and find that the neuron model displays a power-law behavior. If the brain network is small world-like network, the mean avalanche size is almost the same unless the aging parameter is big enough.     

Effects of Vertex Activity and Self-organized Criticality Behavior on a Weighted Evolving Network

Effects of vertex activity have been analyzed on a weighted evolving network. The network is characterized by the probability distribution of vertex strength, each edge weight and evolution of the strength of vertices with different vertex activities. The model exhibits self-organized criticality behavior. The probability distribution of avalanche size for different network sizes is also shown. In addition, there is a power law relation between the size and the duration of an avalanche and the average of avalanche size has been studied for different vertex activities.     

Multi-goal Control of Chaotic Connected Complex Networks

Beam transport network （BTN） with small world （SW） （so-called BTN-SW） and Lorenz chaotic connected network with scale-free （SF） are taken as two typical examples, we proposed a global linear coupling and combined with local error feedback methods in sub-networks to realize multi-goal control method of halo and chaos in two networks above. The simulation results show that the methods above is effective for any chaotic connected networks and has a potential of applications in based-halo-chaos secure communication.     

Self-organized Criticality in Hierarchical Brain Network

It is shown that the cortical brain network of the macaque displays a hierarchically clustered organization and the neuron network shows small-world properties. Now the two factors will be considered in our model and the dynamical behavior of the model will be studied. We study the characters of the model and find that the distribution of avalanche size of the model follows power-law behavior.     

Weighted Evolving Networks with Self-organized Communities

In order to describe the self-organization of communities in the evolution of weighted networks, we propose a new evolving model for weighted community-structured networks with the preferential mechanisms functioned in different levels according to community sizes and node strengths, respectively. Theoretical analyses and numerical simulations show that our model captures power-law distributions of community sizes, node strengths, and link weights, with tunable exponents of v ≥ 1, γ 〉 2, and α 〉 2, respectively, sharing large clustering coefficients and scaling clustering spectra, and covering the range from disassortative networks to assortative networks. Finally, we apply our new model to the scientific co-authorship networks with both their weighted and unweighted datasets to verify its effectiveness.     

Self-organized Critical Model Based on Complex Brain Networks with Hierarchical Organization

The dynamical behavior in the cortical brain network of macaque is studied by modelling each cortical area with a subnetwork of interacting excitable neurons. We find that the avalanche of our model on different levels exhibits power-law. Furthermore the power-law exponent of the distribution and the average avalanche Size are affected by the topology of the network.     

Critical Behaviors in a Stochastic Local Limited One-Dimensional Rice-Pile Model

A stochastic local limited one-dimensional rice-pile model is numerically investigated. The distributions for avalanche sizes have a clear power-law behavior and it displays a simple finite size scaling. We obtain the avalanche exponents Ts= 1.54±0.10,βs = 2.17±0.10 and TT = 1.80±0.10, βT =1.46 ± 0.10. This self-organized critical model belongs to the same universality class with the Oslo rice-pile model studied by K. Christensen et al. [Phys. Rev. Lett. 77 （1996） 107], a rice-pile model studied by L.A.N. Amaral et al. [Phys. Rev. E 54 （1996） 4512], and a simple deterministic self-organized critical model studied by M.S. Vieira [Phys. Rev. E 61 （2000） 6056].     

Influence of Selective Edge Removal and Refractory Period in a Self-Organized Critical Neuron Model

A simple model for a set of integrate-and-fire neurons based on the weighted network is introduced. By considering the neurobiological phenomenon in brain development and the difference of the synaptic strength, we construct weighted networks develop with link additions and followed by selective edge removal. The network exhibits the small-world and scale-free properties with high network efficiency. The model displays an avalanche activity on a power-law distribution. We investigate the effect of selective edge removal and the neuron refractory period on the self-organized criticality of the system.     

Criticality in Two-Variable Earthquake Model on a Random Graph

A two-variable earthquake model on a quenched random graph is established here. It can be seen as a generalization of the OFC models. We numerically study the critical behavior of the model when the system is nonconservative： the result indicates that the model exhibits self-organized criticality deep within the nonconservative regime. The probability distribution for avalanche size obeys finite size scaling. We compare our mode/with the mode/ introduced by Stefano Lise and Maya Paczuski [Phys. Rev. Lett. 88 （2002） 228301], it is proved that they are not in the same universality class.     

Spatial evolution character of multi-objective evolutionary algorithm based on self-organized criticality theory

This paper analyzes the spatial evolution character of multi-objective evolutionary algorithms using self-organized criticality theory. The spatial evolution character is modeled by the statistical property of crowding distance, which displays a scale-free feature and a power-law distribution. We propose that the evolutional rule of multi-objective optimization algorithms is a self-organized state transition from an initial scale-free state to a final scale-free state. The target is to get close to a critical state representing the true Pareto-optimal front. Besides, the anti-Matthew effect is the internal incentive factor of most strategies. The final scale-free state reflects the quality of the final Pareto-optimal front. The speed of the state transition reflects the efficiency of the algorithm. We simulate the spatial evolution characters of three typical multi-objective evolutionary algorithms representing three fields, i.e., Genetic Algorithm, Differential Evolution and the Artificial Immune System algorithm. The results prove that the model and the explanation are effective for analyzing the evolutional rule of multi-objective evolutionary algorithms.     

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.     

基于电力网络的级联故障模型

以电力系统的停电事故为例,提出一种节点具有能量耗散和扩容行为的级联故障模型,并分别在二维规则网络和无标度网络上对该系统的演化过程进行计算机模拟.结果表明,在两种不同结构的网络中系统的演化过程都出现了自组织临界现象,说明网络中节点能量的耗散及容量的扩充是导致电力系统出现自组织临界现象的重要因素.此外,还发现无标度网络中的最大级联故障规模要远大于二维规则网络中的级联故障规模.     

Olami-Feder-Christensen model on different networks

We investigate numerically the Self Organized Criticality (SOC) properties of the dissipative Olami-Feder-Christensen model on small-world and scale-free networks. We find that the small-world OFC model exhibits self-organized criticality. Indeed, in this case we observe power law behavior of earthquakes size distribution with finite size scaling for the cut-off region. In the scale-free OFC model, instead, the strength of disorder hinders synchronization and does not allow to reach a critical state.     

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.     

Self-organized Criticality in a Modified Evolution Model on Generalized Barabási-Albert Scale-Free Networks

A modified evolution model of self-organized criticality on generalized Barabási-Albert (GBA) scale-free networks is investigated. In our model, we find that spatial and temporal correlations exhibit critical behaviors. More importantly, these critical behaviors change with the parameter b, which weights the distance in comparison with the degree in the GBA network evolution.