研究成果：Liangzhu Guo,Xiaodan Lou,Peiteng Shi, Jun Wang, Xiaohan Huang, Jiang Zhang: Open Flow Distances on Open Flow Networks; Physica A, Vol 437, 1, 235–248.

简介：Open flow network is a special weighted directed graph in which weighted links are flows, and the flows are in balance. We define a new set of distance metrics, which measure the average length of particles flow from i to j. Based on the distances, we discuss the calculation of trophic levels of specied on energetic food webs, the centrality of nodes, and the industrial clustering problem on input-ouput networks, etc. We also compare the new distances with old distances on graph.

开放流网络是一种特殊的加权有向网，其中加权连边表示流量，同时节点满足流平衡。在这种网络上，我们定义了一组流距离，即流子沿连边流动从i到j经历的平均路径长度。在此基础上，我们讨论了食物网的营养级计算、投入产出网上的节点中心度、产业聚类等问题，我们还比较了新的距离与其它网络距离。

原文链接：http://www.swarma.org/thesis/detail.asp?id=379