Fitness of others' evaluation effect promotes cooperation in spatial public goods game

Payoff-driven strategy updating rule has always been adopted as a classic mechanism, but up to now, there have been a great many of researches on considering other forms of strategy updating rules, among which pursuing high fitness is one of the most direct and conventional motivations in the decision-making using game theory. But there are few or no researches on fitness from the perspective of others' evaluation. In view of this, we propose a new model in which the evaluation effect with fitness-driven strategy updating rule is taken into consideration, and introduce an evaluation coefficient to present the degree of others' evaluation on individual's behavior. The cooperative individuals can get positive evaluation, otherwise defective individuals get negative evaluation, and the degree of evaluation is related to the number of neighbors who have the same strategy of individual. Through numerical simulation, we find that the evaluation effect of others can enhance the network reciprocity, thus promoting the cooperation. For a strong dilemma, the higher evaluation coefficient can greatly weaken the cooperation dilemma; for a weak one, the higher evaluation coefficient can make cooperator clusters spread faster, however, there is no significant difference in the level of cooperation in the final stable state among different evaluation coefficients. The cooperation becomes more flourish as the number of fitness-driven individuals increases, when all individuals adopt fitness-driven strategy updating rule, the cooperators can quickly occupy the whole population. Besides, we demonstrate the robustness of the results on the WS small-world network, ER random network, and BA scale-free network.     

Ising model on evolution networks and its application on opinion formation

Many phenomena show that in a favorable circumstance an agent still has an updating possibility, and in an unfavor- able circumstance an agent also has a possibility of holding its own state and reselecting its neighbors. To describe this kind of phenomena an Ising model on evolution networks was presented and used for consensus formation and separation of opinion groups in human population. In this model the state-holding probability p and selection-rewiring probability q were introduced. The influence of this mixed dynamics of spin flips and network rewiring on the ordering behavior of the model was investigated, p hinders ordering of opinion networks and q accelerates the dynamical process of networks. Influence of q on the ordering and separating stems from its effect on average path length of networks.     

Response of boolean networks to perturbations

We evaluate the probability that a Boolean network returns to an attractor after perturbing h nodes. We find that the return probability as function of h can display a variety of different behaviours, which yields insights into the state-space structure. In addition to performing computer simulations, we derive analytical results for several types of Boolean networks, in particular for Random Boolean Networks. We also apply our method to networks that have been evolved for robustness to small perturbations, and to a biological example.     

Cooperative Dynamics in Lattice-Embedded Scale-Free Networks

We investigate cooperative behaviors of lattice-embeddedscale-free networking agents in the prisoner's dilemma game model byemploying two initial strategy distribution mechanisms, which are specificdistribution to the most connected sites (hubs) and random distribution. Ourstudy indicates that the game dynamics crucially depends on the underlyingspatial network structure with different strategy distribution mechanism.The cooperators' specific distribution contributes to an enhanced level ofcooperation in the system compared with random one, and cooperation isrobust to cooperators' specific distribution but fragile to defectors' specific distribution. Especially, unlike the specific case, increasing heterogeneity of network does not always favor the emergence of cooperation under random mechanism. Furthermore, we study the geographical effects and find that the graphically constrained network structure tends to improve the evolution of cooperation in random case and in specific one for a large temptation to defect.     

Network dynamics and its relationships to topology and coupling structure in excitable complex networks

All dynamic complex networks have two important aspects, pattern dynamics and network topology. Discovering different types of pattern dynamics and exploring how these dynamics depend or/network topologies are tasks of both great theoretical importance and broad practical significance. In this paper we study the oscillatory behaviors of excitable complex networks （ECNs） and find some interesting dynamic behaviors of ECNs in oscillatory probability, the multiplicity of oscillatory attractors, period distribution, and different types of oscillatory patterns （e.g., periodic, quasiperiodic, and chaotic）. In these aspects, we further explore strikingly sharp differences among network dynamics induced by different topologies （random or scale-free topologies） and different interaction structures （symmetric or asymmetric couplings）. The mechanisms behind these differences are explained physically.     

Evolution of cooperation among interacting individuals through molecular dynamics simulations

Using molecular dynamics (MD) simulation and evolutionary game theory, we incorporate the spacial structure of individuals into the study of the behaviors of cooperation, by adopting the prisoner's dilemma and snowdrift game as metaphors of cooperation between unrelated individuals. The results show that the introduction of spacial structure enhances cooperation using the strategy of prisoner's dilemma while does not make much changes to the cooperation if the strategy of snowdrift game is used. It is also found that our model is a meta-phase between regular ring graph model and complex network model. And the “activity of players” T^* we introduced makes our simulation much more closer to real world problems.     

Self-organization in the spatial battle of the sexes with probabilistic updating

The dynamics of a spatial formulation of the iterated battle of the sexes with probabilistic updating is assessed in this work. The game is played in the cellular automata manner, i.e., with local and synchronous interaction. The effect of memory of past encounters is also taken into account. It is concluded that the spatial structure enables the emergence of clusters of coincident choices, leading to the mean payoff per encounter to values that are accessible only in the cooperative two-person game scenario, which constitutes a notable case of self-organization. With probabilistic updating of choices, both kinds of players reach mean payoffs per encounter that are notably higher than those reached with a deterministic updating mechanism, albeit the evolutionary dynamics does not stabilize, and one of the two possible choices tends to prevail for both kinds of players. Memory of past iterations induces an inertial effect that moderates this tendency, so that intermediate levels of the memory charge tend to favor fairly stable high egalitarian payoffs, without impeding the necessary recovering from their initial plummeting.     

Survival Probability of the Néel State in Clean and Disordered Systems: An Overview

In this work we provide an overview of our recent results about the quench dynamics of one-dimensional many-body quantum systems described by spin-1/2 models. To illustrate those general results, here we employ a particular and experimentally accessible initial state, namely the Néel state. Both cases are considered: clean chains without any disorder and disordered systems with static random on-site magnetic fields. The quantity used for the analysis is the probability for finding the initial state later in time, the so-called survival probability. At short times, the survival probability may decay faster than exponentially, Gaussian behaviors and even the limit established by the energy-time uncertainty relation are displayed. The dynamics at long times slows down significantly and shows a powerlaw behavior. For both scenarios, we provide analytical expressions that agree very well with our numerical results.     

Voter model on adaptive networks

Voter model is an important basic model in statistical physics. In recent years, it has been more and more used to describe the process of opinion formation in sociophysics. In real complex systems, the interactive network of individuals is dynamically adjusted, and the evolving network topology and individual behaviors affect each other. Therefore, we propose a linking dynamics to describe the coevolution of network topology and individual behaviors in this paper, and study the voter model on the adaptive network. We theoretically analyze the properties of the voter model, including consensus probability and time. The evolution of opinions on dynamic networks is further analyzed from the perspective of evolutionary game. Finally, a case study of real data is shown to verify the effectiveness of the theory.     

Adaptive local routing strategy on a scale-free network

Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.     

Evolution of functional subnetworks in complex systems

Links in a realistic network may have different functions, which makes the network virtually a combination of some small-size functional subnetworks. Here, by a model of coupled phase oscillators, we investigate how such functional subnetworks are evolved and developed according to the network structure and dynamics. In particular, we study the case of evolutionary clustered networks in which the function type of each link (attractive or repulsive coupling) is adaptively updated according to the local network dynamics. It is found that during the process of system evolution, the network is gradually stabilized into a particular form in which the attractive (repulsive) subnetwork consists only of the intralinks (interlinks). Based on the observed properties of subnetwork evolution, we also propose a new algorithm for network partition which, compared with the conventional algorithms, is distinguished by its convenient operation and fast computing speed.     

Spatial Games Based on Pursuing the Highest Average Payoff

We propose a strategy updating mechanism based on pursuing the highest average payoff to investigate the prisoner＇s dilemma game and the snowdrift game. We apply the new rule to investigate cooperative behaviours on regular, small-world, scale-free networks, and find spatial structure can maintain cooperation for the prisoner＇s dilemma game. fn the snowdrift game, spatial structure can inhibit or promote cooperative behaviour which depends on payoff parameter. We further study cooperative behaviour on scale-free network in detail. Interestingly, non-monotonous behaviours observed on scale-free network with middle-degree individuals have the lowest cooperation level. We also find that large-degree individuals change their strategies more frequently for both games.     

空间关联白噪声影响下小世界神经元网络系统的同步动力学

以电耦合的Terman-Wang小世界神经元网络系统为研究对象, 研究了空间关联白噪声影响下神经元网络系统的同步动力学. 首先将动力学平均场近似理论扩展到受空间关联白噪声影响下的小世界网络系统中, 将描述网络系统动力学演化的2N维随机微分方程简化为11个确定性的矩微分方程. 其次, 基于动力学平均场近似理论所推导的矩方程, 讨论了空间关联噪声、网络结构参数对神经元网络系统同步动力学的关键影响, 发现较大的噪声空间关联系数、耦合强度及节点平均度均对神经元网络系统同步放电具有积极作用. 进一步地, 利用计算机仿真数值模拟原神经元网络系统的同步动力学, 并与基于动力学平均场近似理论所得到的结果进行比较, 发现二者具有较好的一致性.     

Synaptic Plasticity and Spike Synchronisation in Neuronal Networks

Brain plasticity, also known as neuroplasticity, is a fundamental mechanism of neuronal adaptation in response to changes in the environment or due to brain injury. In this review, we show our results about the effects of synaptic plasticity on neuronal networks composed by Hodgkin-Huxley neurons. We show that the final topology of the evolved network depends crucially on the ratio between the strengths of the inhibitory and excitatory synapses. Excitation of the same order of inhibition revels an evolved network that presents the rich-club phenomenon, well known to exist in the brain. For initial networks with considerably larger inhibitory strengths, we observe the emergence of a complex evolved topology, where neurons sparsely connected to other neurons, also a typical topology of the brain. The presence of noise enhances the strength of both types of synapses, but if the initial network has synapses of both natures with similar strengths. Finally, we show how the synchronous behaviour of the evolved network will reflect its evolved topology.     

Dynamics of opinion formation in hierarchical social networks: Network structure and initial bias

The dynamics of opinion formation based on a majority rule model is studied in a network with the social hierarchical structure as one of its limits. The exit probability is found to change sensitively with the number of nodes in the system, but not with the parameter of homophyly characterizing the network structure. The consensus time is found to be a result of non-trivial interplay between the network structure characterized by the parameter of homophyly and the initial bias in opinion. For unbiased initial opinion, a common consensus is easier to be reached in a random network than a highly structured hierarchical network and it follows the behavior of the length of shortest paths. For biased initial opinion, a common consensus is easier to be reached in a hierarchical network, as the local majority opinion of the groups may take on the biased opinions and hence be the same.     

Influence of a network structure on the network effect in the communication service market

In this study, we analyze the network effect in a model of a personal communication market, by using a multi-agent based simulation approach. We introduce into the simulation model complex network structures as the interaction patterns of agents. With complex network models, we investigate the dynamics of a market in which two providers are competing. We also examine the structure of networks that affect the complex behavior of the market. By a series of simulations, we show that the structural properties of complex networks, such as the clustering coefficient and degree correlation, have a major influence on the dynamics of the market. We find that the network effect is increased if the interaction pattern of agents is characterized by a high clustering coefficient, or a positive degree correlation. We also discuss a suitable model of the interaction pattern for reproducing market dynamics in the real world, by performing simulations using real data of a social network.     

Networks, dynamics, and modularity

The identification of general principles relating structure to dynamics has been a major goal in the study of complex networks. We propose that the special case of linear network dynamics provides a natural framework within which a number of interesting yet tractable problems can be defined. We report the emergence of modularity and hierarchical organization in evolved networks supporting asymptotically stable linear dynamics. Numerical experiments demonstrate that linear stability benefits from the presence of a hierarchy of modules and that this architecture improves the robustness of network stability to random perturbations in network structure. This work illustrates an approach to network science which is simultaneously structural and dynamical in nature.     

Fuzzy modularity and fuzzy community structure in networks

To find the fuzzy community structure in a complex network, in which each node has a certain probability of belonging to a certain community, is a hard problem and not yet satisfactorily solved over the past years. In this paper, an extension of modularity, the fuzzy modularity is proposed, which can provide a measure of goodness for the fuzzy community structure in networks. The simulated annealing strategy is used to maximize the fuzzy modularity function, associating with an alternating iteration based on our previous work. The proposed algorithm can efficiently identify the probabilities of each node belonging to different communities with random initial fuzzy partition during the cooling process. An appropriate number of communities can be automatically determined without any prior knowledge about the community structure. The computational results on several artificial and real-world networks confirm the capability of the algorithm.     

Magnetic order in spin-1 and spin-$$\frac{3} {2}$$ interpolating square-triangle Heisenberg antiferromagnets

We consider coevolution of site state and network structures from different initial substrates: a one dimensional Ising chain, a scale free network and network with non-linear degree dependence. The dynamics is governed by a preassigned stability parameter S, and a rewiring factor φ, that determines whether the Ising spin at the chosen site flips or whether the site gets rewired to another site in the system. We have observed the steady state average stability and magnetisation for both kinds of systems to have an idea about the effect of initial network topology. Although the average stability shows almost similar behaviour, the magnetisation depends on the initial condition we start from. Apart from the local dynamics, the global effect on the dynamics has also been studied. These studies show interesting variations in the steady state values of average stability and magnetisation for different values of S and φ, which helps in indicating the gradual change of existing social networks.     

Topology and dynamics of attractor neural networks: The role of loopiness

We derive an exact representation of the topological effect on the dynamics of sequence processing neural networks within signal-to-noise analysis. A new network structure parameter, loopiness coefficient, is introduced to quantitatively study the loop effect on network dynamics. A large loopiness coefficient means a high probability of finding loops in the networks. We develop recursive equations for the overlap parameters of neural networks in terms of their loopiness. It was found that a large loopiness increases the correlation among the network states at different times and eventually reduces the performance of neural networks. The theory is applied to several network topological structures, including fully-connected, densely-connected random, densely-connected regular and densely-connected small-world, where encouraging results are obtained.