物理学报2011，Vol.60Issue(5)：818-826,9.
一种基于随机行走和策略连接的网络演化模型
A evolving network model generated by random walk and policy attachment
摘要
Abstract
Real-world networks always present some complex network properties .simultaneously, such as small-world, scalefree, high clustering and assortative/disassortative mixing, etc. , but only part of these properties can be reproduced in most of complex network models. In this paper, a new complex network model generated by random walk and policy attachment(RAPA) is proposed. A new peer constructs a local world by random walking, and attaches itseff to peers in the local world following the policy of "random selection", "poverty alleviation" or "favoring the rich". The results of analysis computing and simulation demonstrate that RAPA model can reproduce not only small-world and scale-free features, but some non-power-law features such as exponential cutoff and saturation for small variables. In addition to these, RAPA model also constructs some networks with evident clustering structure and assortative/disassortative mixing pattern.关键词
复杂网络/模型/随机行走/策略连接Key words
complex network/ model/ random walk/ policy attachment引用本文复制引用
姜志宏,王晖,高超..一种基于随机行走和策略连接的网络演化模型[J].物理学报,2011,60(5):818-826,9.基金项目
国家高技术研究发展计划(863计划)(批准号:2008AA01Z407)和国家自然科学基金(批准号:60872053)资助的课题. （863计划）
