基于复杂网络理论的校友网络研究  

Research of Alumni Network Based on Theory of Complex Network

作　　者：赵京胜[1] 孙宇航[1] 

机构地区：[1]青岛理工大学通信与电子工程学院,266033

出　　处：《信息技术与信息化》2014年第2期121-126,共6页Information Technology and Informatization

基　　金：国家自然科学基金(61173056)

摘　　要：在某高校校友会网站的开发建设中,引入复杂网络机制,借鉴城市公共交通网络的space P和space L方法,构建了校友网络,分析了其平均路径长度、聚类系数和度分布等基本网络统计特性,并借用数学期望的思想,对构建的校友网络方法进行了验证。由分析结果可知,校友网络是一个具有指数型度分布的小世界网络;校友网络是由一些关键节点(主席、副主席和班长和团支书等)连接起来的,应该切实保障这类节点的桥梁作用;space P方法构造的校友网络比space L方法构造的校友网络更加合理,更能反映真实的校友关系。during the development of a university alumni site, the complex network mechanisms are introduced, the space P and the space l methods using in urban public transport network are applied. We construct an alumni network and analyze its basic network statistical properties, such as average path length, clustering coefficient and degree distribution, borrowing from the ideas of the mathematical, and verifying for the construction of the alumni network method. As a result, alumni network is a small-world network with exponential degree distribution. Alumni network is linked by some of key nodes, for example, chairman, vice chairman and monitor nodes, etc., such bridge nodes should be effectively protected. space P method for constructing alumni network is more reasonable than space l, more can relfecting the real alumni relations.

关 键 词：校友网络 复杂网络 小世界网络 网络特性 数学期望 

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