基于边迭代的复杂网络平均路径长度分析研究  

Research on Analysis of Average Path Length of Complex Networks Based on Edge Iteration

作　　者：施艳昭 SHI Yan-zhao(Department of Economic Management, Anhui Vocational College of Electronics and Information Technology, Bengbu Anhui 233000, China)

机构地区：[1]安徽电子信息职业技术学院经济管理系,安徽蚌埠233000

出　　处：《佳木斯大学学报（自然科学版）》2020年第2期58-61,共4页Journal of Jiamusi University：Natural Science Edition

基　　金：2019安徽省高等学校质量工程项目(2019kfkc264)。

摘　　要：复杂网络可以用来描述现实世界中许多复杂系统,而平均路径长度则是其中一个研究重点。针对基于边迭代的复杂网络,以Farey网络这一类网络族为实例,分析和研究其平均路径长度。研究方法将加深对这些确定性网络模型的研究,并为随机复杂网络提供新的思路。Complex networks can be used to describe many complex systems in the real world,the average path length is one of the research focuses.In this paper,we analyze and study the average path length of complex networks based on edge iterations,taking the family of networks such as the Farey network as examples.The research methods in this paper will deepen the research on these deterministic network models and provide new ideas for random complex networks.

关 键 词：复杂网络 平均路径长度 边迭代 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]