arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.3007physics.soc-phcs.SIq-bio.PE
收藏

连续拓扑变化下无标度网络合作的鲁棒性

Robustness of cooperation on scale-free networks under continuous topological change

Genki Ichinose, Yuto Tenguishi, Toshihiro Tanizawa

摘要:

在本文中,我们数值研究了无标度网络中合作集群在囚徒困境中的鲁棒性,其中网络拓扑结构随着节点的不断移除和添加而变化。每一次删除和添加可以是随机的,也可以是有意的。因此,我们有四种不同的策略来改变网络拓扑:随机移除和随机添加(RR),随机移除和优先添加(RP),有针对性的移除和随机添加(TR),以及有针对性的移除和优先添加(TP)。我们发现,合作集群是最脆弱的TR,而他们是最强大的RP,即使是大值的诱惑系数叛逃。网络的度混合模式的影响是不是在网络拓扑结构的连续变化下的合作的鲁棒性的主要因素,这是在静态网络中观察到的情况下有很大的不同。随着合作者所占据的枢纽链接数量的增加,合作集群变得更加强大。我们的研究结果可能会推断出这样一个事实,即在现实世界中,代表一个个体的每个节点都不断地被删除和添加,因此在社交网络中维持全球合作需要大量不同的个体。

英文摘要:

In this paper, we numerically investigate the robustness of cooperation clusters in prisoner's dilemma played on scale-free networks, where the network topologies change by continuous removal and addition of nodes. Each removal and addition can be either random or intentional. We therefore have four different strategies in changing network topology: random removal and random addition (RR), random removal and preferential addition (RP), targeted removal and random addition (TR), and targeted removal and preferential addition (TP). We find that cooperation clusters are most fragile against TR, while they are most robust against RP, even for large values of the temptation coefficient for defection. The effect of the degree mixing pattern of the network is not the primary factor for the robustness of cooperation under continuous change in network topology, which is quite different from the cases observed in static networks. Cooperation clusters become more robust as the number of links of hubs occupied by cooperators increase. Our results might infer the fact that a huge variety of individuals is needed for maintaining global cooperation in social networks in the real world where each node representing an individual is constantly removed and added.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑