贵阳公共交通网络复杂性分析  

An Analysis of Complexity of Public Transportation Network in Guiyang

作　　者：马景富[1] 王红蕾[1] 

机构地区：[1]贵州大学

出　　处：《微计算机信息》2009年第21期89-90,194,共3页Control & Automation

摘　　要：城市公共交通系统可以抽象为由公交线路和停靠站点构成的网络,公交网络构成了一个典型的复杂网络。本文以贵阳市的公共汽车交通系统中的停靠站点网络为研究对象,对其进行了复杂性分析,计算了网络的度分布、平均路径长度、聚集系数等指标。结果表明,贵阳市公共交通网络的度分布符合幂率分布,并且具有较小的平均路径长度和较高的聚集系数。从而证实贵阳市公交网络的小世界特性和无标度特性。Urban public transportation system can be abstracted as a complex network composed of stops and public transportation lines,and urban public traffic network is a typical complex networks.In this paper,based on the computation of the degree distribution, average path length,and clustering coefficient,complex characteristics of a public transportation system of Guiyang are studied. The re- sult indicates that the degree distribution of the network follows a power law distribution,and the public transportation network of the city is a network with short average path length and high clustering coefficient.h is proved that the public traffic network of Guiyang city has the small-world and scale-free properties.

关 键 词：复杂网络 公交网络 无标度网络 小世界网络 

分 类 号：N94-0[自然科学总论—系统科学] U121[交通运输工程]