There is much interest in studying evolutionary games in structured populations, in order to understand how cooperation emerges in communities of egoistic agents. In this paper, we consider a new mechanism for cooperation to survive on networks. Agents are designed to reproduce offspring in...

We study effects of average degree on cooperation in the networked prisoner's dilemma game. Typical structures are considered, including random networks, small-world networks and scale-free networks. Simulation results show that the average degree plays a universal role in cooperation occurring...

We focus on the heterogeneity of social networks and its role to the emergence of prevailing cooperators and sustainable cooperation. The social networks are representative of the interaction relationships between players and their encounters in each round of games. We study an evolutionary...

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...

Many networks extent in space, may it be metric (e.g. geographic) or non-metric (ordinal). Spatial network growth, which depends on the distance between nodes, can generate a wide range of topologies from small-world to linear scale-free networks. However, networks often lacked multiple clusters...

In this paper we examine a number of methods for probing and understanding the large-scale structure of networks that evolve over time. We focus in particular on citation networks, networks of references between documents such as papers, patents, or court cases. We describe three different...

In this paper, we introduce a non-uniform tolerance parameter (TP) strategy (the tolerance parameter is characterized by the proportion between the unused capacity and the capacity of a vertex) and study how the non-uniform TP strategy influences the response of scale-free (SF) networks to...

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...