Networking effects on evolutionary snowdrift game in networks with fixed degrees
Networking effects on evolutionary snowdrift game in networks with fixed degrees
复制标题
DOI：
10.1016/j.physa.2007.07.038
复制
发表时间：
2007-11
影响因子：
3.3
通讯作者：
Chen Xu;P. Hui;D. Zheng
中科院分区：
文献类型：
--
作者：
Chen Xu;P. Hui;D. Zheng
在一个演化的雪堆博弈中，我们研究了度分布以外的空间结构对合作出现程度的影响。通过交换三种不同类型的固定次数k的规则格中的链环，我们研究了合作算子fC的频率如何变化，作为表示顶点的最近邻点如何连接的聚类系数(CC)和表示顶点的次近邻如何被最近邻居共享的共享系数(SC)。对于小k，非零CC倾向于抑制FC。对于所研究的网络，非零SC也会导致抑制FC。随度的增加，fC对网络性质的敏感性变得越来越弱。在k变化时平均收益的排序模式的背景下讨论了结果。基于有限全连通网络的思想，在大k的极限下，给出了一种与数值结果相一致的FC近似。
We study the effects of spatial structures other than the degree distribution on the extent of the emergence of cooperation in an evolutionary snowdrift game. By swapping the links in three different types of regular lattices with a fixed degree k, we study how the frequency of cooperator fCchanges as the clustering coefficient (CC), which signifies how the nearest neighbors of a vertex are connected, and the sharing coefficient (SC), which signifies how the next-nearest neighbors of a vertex are shared by the nearest neighbors, are varied. For small k, a non-vanishing CC tends to suppress fC. A non-vanishing SC also leads to a suppressed fCfor the networks studied. As the degree increases, the sensitivity of fCto the network properties is found to become increasingly weak. The result is discussed within the context of the ranking patterns of average payoffs as k changes. An approximation for fC, which is based on the idea of a finite fully connected network and gives results in good agreement with numerical results, is derived in the limit of large k.