Heterogeneity of Some Cooperation/Competition Properties

We show that the heterogeneity index, which was proposed by Hu and Wang [Physica A 387 （2008） 3769], can be used to describe the disparity of the cooperation sharing or competition gain distributions, which is very important for understanding the dynamics of a cooperation/competition system. An analytical relation between the distribution parameters and the heterogeneity index is derived, which is in good agreement with the empirical results. Our theoretical and empirical analyses also show that the relation between the distribution parameters can be analytically derived from the so-called Zhang-Chang model [Physica A 360 （2006） 599; 383 （2007） 687）. This strongly recommends a possibility to create a general dynamic cooperation/competition model.     

Opinion Spreading with Mobility on Scale-Free Networks

A continuum opinion dynamic model is presented based on two rules. The first one considers the mobilities of the individuals, the second one supposes that the individuals update their opinions independently. The results of the model indicate that the bounded confidence εc, separating consensus and incoherent states, of a scale-free network is much smaller than the one of a lattice. If the system can reach the consensus state, the sum of all individuals＇ opinion change Oc（t） quickly decreases in an exponential form, while if it reaches the incoherent state finally, Oc（t） decreases slowly and has the punctuated equilibrium characteristic.     

Continuous growth models in terms of generalized logarithm and exponential functions

Consider the one-parameter generalizations of the logarithmic and exponential functions which are obtained from the integration of non-symmetrical hyperboles. These generalizations coincide to the one obtained in the context of non-extensive thermostatistics. We show that these functions are suitable to describe and unify the great majority of continuous growth models, which we briefly review. Physical interpretation to the generalization function parameter is given for the Richards’ model, which has an underlying microscopic model to justify it.     

Pareto and Boltzmann-Gibbs behaviors in a deterministic multi-agent system

A deterministic system of interacting agents is considered as a model for economic dynamics. The dynamics of the system is described by a coupled map lattice with nearest neighbor interactions. The evolution of each agent results from the competition between two factors: the agent’s own tendency to grow and the environmental influence that moderates this growth. Depending on the values of the parameters that control these factors, the system can display Pareto or Boltzmann-Gibbs statistical behaviors in its asymptotic dynamical regime. The regions where these behaviors appear are calculated on the space of parameters of the system. Other statistical properties, such as the mean wealth, the standard deviation, and the Gini coefficient characterizing the degree of equity in the wealth distribution are also calculated.     

Effects of epidemic threshold definition on disease spread statistics

We study the statistical properties of SIR epidemics in random networks, when an epidemic is defined as only those SIR propagations that reach or exceed a minimum size s_c. Using percolation theory to calculate the average fractional size of an epidemic, we find that the strength of the spanning link percolation cluster P_∞ is an upper bound to . For small values of s_c, P_∞ is no longer a good approximation, and the average fractional size has to be computed directly. We find that the choice of s_c is generally (but not always) guided by the network structure and the value of T of the disease in question. If the goal is to always obtain P_∞ as the average epidemic size, one should choose s_c to be the typical size of the largest percolation cluster at the critical percolation threshold for the transmissibility. We also study Q, the probability that an SIR propagation reaches the epidemic mass s_c, and find that it is well characterized by percolation theory. We apply our results to real networks (DIMES and Tracerouter) to measure the consequences of the choice s_c on predictions of average outcome sizes of computer failure epidemics.     

Comparison of immunization strategies in geographical networks

The epidemic spread and immunizations in geographically embedded scale-free (SF) and Watts-Strogatz (WS) networks are numerically investigated. We make a realistic assumption that it takes time which we call the detection time, for a vertex to be identified as infected, and implement two different immunization strategies: one is based on connection neighbors (CN) of the infected vertex with the exact information of the network structure utilized and the other is based on spatial neighbors (SN) with only geographical distances taken into account. We find that the decrease of the detection time is crucial for a successful immunization in general. Simulation results show that for both SF networks and WS networks, the SN strategy always performs better than the CN strategy, especially for more heterogeneous SF networks at long detection time. The observation is verified by checking the number of the infected nodes being immunized. We found that in geographical space, the distance preferences in the network construction process and the geographically decaying infection rate are key factors that make the SN immunization strategy outperforms the CN strategy. It indicates that even in the absence of the full knowledge of network connectivity we can still stop the epidemic spread efficiently only by using geographical information as in the SN strategy, which may have potential applications for preventing the real epidemic spread.     

Generalized exponential function and discrete growth models

Here we show that a particular one-parameter generalization of the exponential function is suitable to unify most of the popular one-species discrete population dynamic models into a simple formula. A physical interpretation is given to this new introduced parameter in the context of the continuous Richards model, which remains valid for the discrete case. From the discretization of the continuous Richards’ model (generalization of the Gompertz and Verhulst models), one obtains a generalized logistic map and we briefly study its properties. Notice, however that the physical interpretation for the introduced parameter persists valid for the discrete case. Next, we generalize the (scramble competition) θ-Ricker discrete model and analytically calculate the fixed points as well as their stabilities. In contrast to previous generalizations, from the generalized θ-Ricker model one is able to retrieve either scramble or contest models.     

A class of improved algorithms for detecting communities in complex networks

Detecting communities in complex networks is of considerable importance for understanding both the structure and function of the networks. Here, we propose a class of improved algorithms for community detection, by combining the betweenness algorithm of Girvan and Newman with the edge weight defined by the edge-clustering coefficient. The improved algorithms are tested on some artificial and real-world networks, and the results show that they can detect communities of networks more effectively in both unweighted and weighted cases. In addition, the technique for improving the betweenness algorithm in this paper, thanks to its compatibility, can directly be applied to various detection algorithms.     

Network effects in a human capital based economic growth model

We revisit a recently introduced agent model [ACS, 11, 99 (2008)], where economic growth is a consequence of education (human capital formation) and innovation, and investigate the influence of the agents’ social network, both on an agent’s decision to pursue education and on the output of new ideas. Regular and random networks are considered. The results are compared with the predictions of a mean field (representative agent) model.     

Transition from Pareto to Boltzmann-Gibbs behavior in a deterministic economic model

The one-dimensional deterministic economic model recently studied by González-Estévez et al. [J. González-Estévez, M.G. Cosenza, R. López-Ruiz, J.R. Sanchez, Physica A 387 (2008) 4637] is considered on a two-dimensional square lattice with periodic boundary conditions. In this model, the evolution of each agent is described by a map coupled with its nearest neighbors. The map has two factors: a linear term that accounts for the agent’s own tendency to grow and an exponential term that saturates this growth through the control effect of the environment. The regions in the parameter space where the system displays Pareto and Boltzmann-Gibbs statistics are calculated for the cases of the von Neumann and the Moore neighborhood. It is found that, even when the parameters in the system are kept fixed, a transition from Pareto to Boltzmann-Gibbs behavior can occur when the number of neighbors of each agent increases.     

An evolutionary model of social networks

Social networks in communities, markets, and societies self-organise through the interactions of many individuals. In this paper we use a well-known mechanism of social interactions — the balance of sentiment in triadic relations — to describe the development of social networks. Our model contrasts with many existing network models, in that people not only establish but also break up relations whilst the network evolves. The procedure generates several interesting network features such as a variety of degree distributions and degree correlations. The resulting network converges under certain conditions to a steady critical state where temporal disruptions in triangles follow a power-law distribution.     

Limited ability driven phase transitions in the coevolution process in Axelrod's model

We study the coevolution process in Axelrod's model by taking into account of agents' abilities to access information, which is described by a parameter α to control the geographical range of communication. We observe two kinds of phase transitions in both cultural domains and network fragments, which depend on the parameter α. By simulation, we find that not all rewiring processes pervade the dissemination of culture, that is, a very limited ability to access information constrains the cultural dissemination, while an exceptional ability to access information aids the dissemination of culture. Furthermore, by analyzing the network characteristics at the frozen states, we find that there exists a stage at which the network develops to be a small-world network with community structures.     

On the topological properties of the world trade web: A weighted network analysis

This paper studies the topological properties of the World Trade Web (WTW) and its evolution over time by employing a weighted-network analysis. We show that the WTW, viewed as a weighted network, displays statistical features that are very different from those obtained by using a traditional binary-network approach. In particular, we find that: (i) the majority of existing links are associated to weak trade relationships; (ii) the weighted WTW is only weakly disassortative; (iii) countries holding more intense trade relationships are more clustered.     

Evolution of the linguistic diversity on correlated landscapes

We have recently investigated the evolution of linguistic diversity by means of a simple spatial model that considers selective geographic colonization, linguistic anomalous diffusion and mutation. In the model, regions of the lattice are characterized by the amount of resources available to populations which are going to colonize the region. In that approach, the resources were ascribed in a randomly and uncorrelated way. Here, we extend the previous model and introduce a degree of correlation for the resource landscape. A change of the qualitative scenario is observed for high correlation, where the increase of the linguistic diversity on area is faster than for low correlated landscapes. For low correlated landscapes, the dependence of diversity on area shows two scaling regimes, while we observe the rising of another scaling region for high correlated landscapes.     

A decision theoretical approach for diffusion promotion

In order to maximize cost efficiency from scarce marketing resources, marketers are facing the problem of which group of consumers to target for promotions. We propose to use a decision theoretical approach to model this strategic situation. According to one promotion model that we develop, marketers balance between probabilities of successful persuasion and the expected profits on a diffusion scale, before making their decisions. In the other promotion model, the cost for identifying influence information is considered, and marketers are allowed to ignore individual heterogeneity. We apply the proposed approach to two threshold influence models, evaluate the utility of each promotion action, and provide discussions about the best strategy. Our results show that efforts for targeting influentials or easily influenced people might be redundant under some conditions.     

Message Spreading and Forget--Remember Mechanism on a Scale-Free Network

We study message spreading on a scale-free network, by introducing a novel forget-remember mechanism. Message, a general term which can refer to email, news, rumor or disease, etc, can be forgotten and remembered by its holder. The way the message is forgotten and remembered is governed by the forget and remember function, F and R, respectively. Both F and R are functions of history time t concerning individual's previous states, namely being active (with message) or inactive (without message). Our systematicsimulations show at the low transmission rate whether or not the spreading can be efficient is primarily determined by the corresponding parameters for F and R.     

Periodic Wave of Epidemic Spreading in Community Networks

It was reported by Cummings ef al. [Nature 427 （2004） 344] that there are periodic waves in the spatiotemporal data of epidemics. For understanding the mechanism, we study the epidemic spreading on community networks by both the SIS model and the SIRS model. We find that with the increase of infection rate, the number of total infected nodes may be stabilized at a fixed point, oscillatory waves, and periodic cycles. Moreover, the epidemic spreading in the SIS model can be explained by an analytic map.     

Spatial price dynamics: From complex network perspective

The spatial price problem means that if the supply price plus the transportation cost is less than the demand price, there exists a trade. Thus, after an amount of exchange, the demand price will decrease. This process is continuous until an equilibrium state is obtained. However, how the trade network structure affects this process has received little attention. In this paper, we give a evolving model to describe the levels of spatial price on different complex network structures. The simulation results show that the network with shorter path length is sensitive to the variation of prices.     

Modelling Moran Process with Network Dynamics for the Evolution of Cooperation

We introduce a simple model based on the Moran process with network dynamics. Using pair approximation, the cooperation frequencies at equilibrium states are deduced for general interactions. Three usual social dilemmas are discussed in the framework of our model. It is found that they all have a phase transition at the same value of cost-to-benefit ratio. For the prisoner＇s dilemma game, notably it is exactly the simple rule reported in the literature [Nature 441 （2006） 502]. In our model, the simple rule results from the parent-offspring link. Thus the basic mechanism for cooperation enhancement in network reciprocity is in line with the Hamilton rule of kin selection. Our simulations verify the analysis obtained from pair approximation.     

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.