一种基于随机行走和策略连接的网络演化模型  

A evolving network model generated by random walk and policy attachment

作　　者：姜志宏[1] 王晖[1] 高超[1] 

机构地区：[1]国防科技大学信息系统与管理学院系统工程系,长沙410073

出　　处：《物理学报》2011年第5期818-826,共9页Acta Physica Sinica

基　　金：国家高技术研究发展计划(863计划)(批准号:2008AA01Z407);国家自然科学基金(批准号:60872053)资助的课题~~

摘　　要：本文提出了一个基于随机行走和策略选择的复杂网络局域演化模型RAPA.新节点加入系统不需要全局知识,而是通过随机行走构造局域世界;然后依据概率采用随机连接,"扶贫"连接或"亲富"连接策略,从局域世界中选择节点增加连接边;最终自组织演化具有幂律特点的复杂网络.初步的解析计算和仿真实验都表明,RAPA模型不仅重现了具有小世界特性、整体上的无标度特性,还可以演化出小变量饱和以及指数截断等现象,同时也具有明显的聚类特性,并能够构造出同配或异配等不同混合模式的网络.Real-world networks always present some complex network properties simultaneously,such as small-world,scale-free,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 itself 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.

关 键 词：复杂网络 模型 随机行走 策略连接 

分 类 号：O157.5[理学—数学]