Related papers: Network Growth via Preferential Attachment based o…
Our work introduces an approach for estimating the contribution of attachment mechanisms to the formation of growing networks. We present a generic model in which growth is driven by the continuous attachment of new nodes according to…
We present results of the prisoner's dilemma game on complex networks that have population change. We introduce a death process with minimum requirements and show that it induces a highly cooperative society. We also study the effects of…
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…
We focus on the heterogeneity of social networks and its role to the emergence of prevailing cooperation and sustaining cooperators. The social networks are representative of the interaction relationships between players and their…
In this work we have used computer models of social-like networks to show by extensive numerical simulations that cooperation in evolutionary games can emerge and be stable on this class of networks. The amounts of cooperation reached are…
A two-dimensional small-world type network, subject to spatial prisoners' dilemma dynamics and containing an influential node defined as a special node with a finite density of directed random links to the other nodes in the network, is…
Conventional studies of network growth models mainly look at the steady state degree distribution of the graph. Often long time behavior is considered, hence the initial condition is ignored. In this contribution, the time evolution of the…
Preferential attachment is often suggested to be the underlying mechanism of the growth of a network, largely due to that many real networks are, to a certain extent, scale-free. However, such attribution is usually made under debatable…
Evolving network models under a dynamic growth rule which comprises the addition and deletion of nodes are investigated. By adding a node with a probability $P_a$ or deleting a node with the probability $P_d=1-P_a$ at each time step, where…
We study an evolutionary version of the spatial prisoner's dilemma game, where the agents are placed in a random graph. For lattices with fixed connectivity, $\alpha$, we show that for low values of $\alpha$ the final density of cooperating…
In studying network growth, the conventional approach is to devise a growth mechanism, quantify the evolution of a statistic or distribution (such as the degree distribution), and then solve the equations in the steady state (the…
In this paper, the Optional Prisoner's Dilemma game in a spatial environment, with coevolutionary rules for both the strategy and network links between agents, is studied. Using a Monte Carlo simulation approach, a number of experiments are…
We present analytical results for the emerging structure of networks that evolve via a combination of growth (by node addition and random attachment) and contraction (by random node deletion). To this end we consider a network model in…
Traditional evolutionary game theory describes how certain strategy spreads throughout the system where individual player imitates the most successful strategy among its neighborhood. Accordingly, player doesn't have own authority to change…
We address the problem of how the survival of cooperation in a social system depends on the motion of the individuals. Specifically, we study a model in which Prisoner's Dilemma players are allowed to move in a two-dimensional plane. Our…
We consider a group of agents on a graph who repeatedly play the prisoner's dilemma game against their neighbors. The players adapt their actions to the past behavior of their opponents by applying the win-stay lose-shift strategy. On a…
Population diversity is an important aspect of Prisoner's Dilemma Game (PDG) research. However, the studies on dynamic diversity and its associated cost still need further investigation. Based on a framework comprising 2-dimensional spatial…
We study the growth of a directed transportation network, such as a food web, in which links carry resources. We propose a growth process in which new nodes (or species) preferentially attach to existing nodes with high indegree (in…
We propose a simple preferential attachment model of growing network using the complementary probability of Barab\'asi-Albert (BA) model, i.e., $\Pi(k_i) \propto 1-\frac{k_i}{\sum_j k_j}$. In this network, new nodes are preferentially…
Punishment and partner switching are two well-studied mechanisms that support the evolution of cooperation. Observation of human behaviour suggests that the extent to which punishment is adopted depends on the usage of alternative…