摘要
对Zachary网络采用了重复囚徒困境博弈的方法,提出了两种网络结构的演化算法,即随机算法和伪度优先算法,并对网络的度分布和聚集系数进行了分析,结果表明:经过n轮重复博弈,随机算法对网络拓扑结构的影响不大,伪度优先算法对网络拓扑结构的影响较大;经过演化后,网络的最大度明显增大,聚集系数也高于演化前的网络;随机算法对网络的社团结构影响不明显,而伪度优先算法则对社团结构的影响较大.
Using repeated prisoner＇ s dilemma to analyze the features of Zachary network ,two evolutionary algo- rithms （ random algorithm and pseudo degree preferred algorithm） of network topology were put forward. Then the features of degree distribution and clustering coefficient were studied. The results show that after n rounds, random algorithm has little influence on them. However, pseudo degree preferred algorithm greatly affect the features of the network structure. The max-degree of the network obviously increases and the clustering coeffi- cient is higher than that of the original network. Furthermore, random algorithm has few impacts on community structure of the network, but pseudo degree preferred algorithm greatly affect the community structure of the network.
出处
《鲁东大学学报（自然科学版）》
2013年第1期28-31,F0003,共5页
Journal of Ludong University:Natural Science Edition
关键词
囚徒困境
纳什均衡
复杂网络
拓扑结构
prisoner＇ s dilemma
Nash equilibrium
complex network
topology structure
