摘要
从图与网络的视角来看,产业系统可看作以产业为顶点、以关联关系为边(弧)形成的产业网络,网络上的许多信息能够揭示产业关联的特征。生成树是图与网络的一类重要子图,必然也能反映产业关联的特征。本文在投入产出模型和产业网络模型的基础上,构建了产业赋权网络模型,并将最大生成树称为产业基础关联树。进一步地,以Kruskal算法为基础设计了确定产业基础关联树的算法。应用实例表明,产业基础关联树以最少的关联关系,最大程度地反映了产业关联结构的特征,并能提取出中心与形心、圈基等重要指标,描述产业网络的结构特征。
From the perspective of graph and network, the economy system can be regarded as an industry network. In the network, the industries can be identified as vertexes, and the linkages as edges （or arcs）. The information on the network can reveal the features of the industry linkages. As an important subnet of graph and network, spanning tree can also describe the characteristics of industry linkage. Based on input-output analysis and industry network, this paper constructs the weighted industry network model and finds the maximum spanning tree of it as foundational industry linkage tree. The algorithm of foundational industry linkage tree is confirmed based on Kruskal algorithm. Application examples show that the foundational industry linkage tree can reflect the characteristics of industrial structure profoundly with the least linkages. Some important indicators of the tree such as center, centroid and circle basis can be extracted from it describing the structural characteristics of the industrial network.
出处
《管理评论》
CSSCI
北大核心
2013年第2期35-42,共8页
Management Review
基金
国家软科学研究计划项目(2012GXS4B065)
关键词
产业网络
产业基础关联树
产业关联
industry network, foundational industry linkage tree, industry linkage
