广义合作网络及其相关研究
|
摘要
描述复杂自适应系统中的作用者行为的动力学法则必须容纳类似生命系统特有的预测、选择、学习、进化等特征。作用者和它们的行为各不相同,作用者构成的系统绝不等同于它们的简单组合,不能用还原论的思路来处理,也不能用服务于确定论、还原论的传统数学来描述,必须探讨全新的描述工具。复杂网络研究的发展为我们提供了进行这种探讨的某种可能性。
复杂网络可以描述广泛多样的实际系统。我们进行了相当数量的实际系统的实证研究,希望能够根据实证研究所得到的统计结果把实际系统分类,找出每一类系统的实证统计性质共性,进而试图建立模型,理解它们的共同动力学特征和机制。这样一步一步地达到对复杂系统的更普遍一点的理解。在当前复杂网络研究的广阔范围中,我们的兴趣集中在所谓的“广义合作网络”上。这里网络的节点(参与者)在参与许多合作项目。在研究中只考虑参与者在项目中的合作关系,不讨论它们之间的竞争、对抗或其他类型的关系,而且定义参与者在项目中的合作关系为它们之间的边。这样,一个项目就可以用一个它包含的参与者两两连边所构成的完全图来表示。这样的网络不一定是社会网络,也可以包含其他许多类网络,但是由于拓扑结构具有共同特征,它们的统计性质和动力学特性也具有共同特征。在我们实证地研究过的实际网络中,我们发现好莱坞演员合作网、中国旅游线路网、城市公交线路网、中药方剂网、以及淮扬菜肴网都可以用广义合作网络来描述。我们对这些实证数据分析之后,得到了一些共同的统计特征:首先,项目是这类网络中的主导因素,项目如何组成是网络演化的关键问题。参与者项目度分布(即参与者参与的项目数目的分布)很可能是这类网络最主要的统计性质,在很大程度上左右顶点的点强度分布和度分布。其次,参与者的同类性系数也随着这样的分布规律的变化而呈现单调依赖关系的变化。我们建议了一个简明的、体现上述思想的网络演化模型,来说明这两项共同统计特征的动力学机理,由此模型的解析分析和数值模拟产生的统计结果与实证结果很好地符合。最后,根据这类被称为广义合作网络的共同拓扑特征,我们建议群落和层次的一种定量定义和相应的划分群落和层次的方法。由此所建议的一个新的统计参量——网络交连度可能富有实际意义。
由于实际的重要性,城市公交系统一直是研究的热点之一。我们从复杂网络的角度,研究旨在说明城市公交系统演化和性质的网络操纵者博弈模型。从这个角度出发,我们陆续提出三个模型,模型越来越简化,意思越来越集中,本论文中重点介绍最后一个最简网络操纵者博弈模型。我们建议最大简化地把公交公司和乘客看作网络的两个主要操纵者,他们的利益在某种意义上说是互相矛盾的,于是,城市公交网络系统的演化被最简化地看作网络的两个操纵者之间博弈的过程,博弈的均衡解决定网络最后的演化走势。对这样的模型进行了极端情况和均衡情况的解析,以及一般情况下的数值模拟研究,所得到的网络统计性质与我们对北京、上海、南京、杭州的实证统计结果相当好的符合,说明这个模型很可能
抓住了最根本的特征。这种思想很可能推广到许多其它系统。广义合作网络忽略了竞争因素。当在网络中加入竞争的因素时,网络会有什么样的特性呢?鉴于此,我们介绍了三个考虑到竞争因素的系统,这个工作是浅陋的。但期望这几个系统能够作为一个引子,能够激起研究者们对合作竞争网络作更深入的研究。
The dynamics principles, which describe the actors’behaviors in complex self-adaptive systems, should include some characters similar to what are shown by the living systems, such as forecasting, choice, learning, and evolution. Each actor and his behavior are different. Also, a system consisting of actors is not a simple combination of them. It cannot be treated by reduction theory, and cannot be described by the conventional mathematics, which serve for determinism and reductionism. We must develop some new methods and tools to describe self-adaptive systems. The latest development in the complex network gives us a possible way for searching the possibility.
The complex network can describe variety different practical systems. We have carried out empirical studies on quite some practical systems; wish to classify the systems based on the results and find out the common statistical properties of every kind of them. The next step could be setting up suitable models so that we could understand their common dynamical characteristics and mechanism. In this way we can reach, step by step, to a more universal understanding on complex systems. Among the very wide scope of complex network studying, our interests are concentrated on the so-called“generalized collaboration networks”. In such networks the nodes (actors) are participating a lot of collaborative acts. In the study we shall only consider actor's cooperation, and ignore the competition, confrontation or other type of relations between them. We propose define actor's cooperation in the acts as edges. In this way, one act can be described by a complete graph composed by the actors where every pair of them are connected with edges. Such a network may not be a social network, it can belong to many other kinds of networks too, but because the topological structure has common characteristics, their statistics properties have common characteristics. Among the practical networks we empirically studied, we found that the Chinese tourist line network, the urban public traffic network, the traditional Chinese medicine prescription network, and Huai-Yang recipe network can be described by the generalized collaboration networks. After the analysis on the empirical data, we have obtained some common statistical properties: First of all, the act is a leading factor in this kind of networks. The act degree distribution (the distribution of the number of the acts, in which the actors are participating) should be, very possibly, the most important property in such kinds of networks. It, in a great extent, determines the node strength degree and degree distribution. Secondly, the assortativity of the actors shows a monotonic change with the change of such distribution law. We propose a simplified model based on these ideas so as to show the common dynamical mechanisms of the two common properties. The analytic and numerical investigation results of the model show very good agreement with the empirical results. Finally, according to the common topological characteristics of the so-called generalized collaboration networks, we propose a quantitative definition and corresponding division method for community and hierarchy. A new network statistical property, the degree of interweavement, has been proposed by this consideration that may have practical importance.
Since urban public traffic systems are practically important, they have been extensively and intensively studied. We have studied urban public traffic networks from the viewpoint of complex networks and game theory. From that, we have suggested three manipulator game models of urban public traffic networks continuously. We try to construct a simplest model with the idea that hits the nail on the head. In this paper, we mainly present the last model of the three. We suggest a very simplified viewpoint in which the evolution of urban public traffic network can be considered as a game process between the two network manipulators, and the equilibrium solution of the game determines the last evolution tendency of the network. We have performed analytical discussion on some extreme and the equilibrium situations and numerical discussion on the general evolution, the obtained statistical properties are in a good agreement with the empirical ones obtained by the investigations on the urban public traffic systems in Beijing, Shanghai, Nanjing and Hangzhou. This shows that the model grasps the most fundamental characteristic of the system. The idea, very possibly, can be extended and used in many other systems.
Generalized collaboration networks ignore the factor of competition. If competition joins in network, what characteristic may appear? As for it, we introduce three systems which take competition into account. The research is rough. However, we expect as a beginning, the work could inspire people to research the collaboration and competition network deeply.
复杂网络可以描述广泛多样的实际系统。我们进行了相当数量的实际系统的实证研究,希望能够根据实证研究所得到的统计结果把实际系统分类,找出每一类系统的实证统计性质共性,进而试图建立模型,理解它们的共同动力学特征和机制。这样一步一步地达到对复杂系统的更普遍一点的理解。在当前复杂网络研究的广阔范围中,我们的兴趣集中在所谓的“广义合作网络”上。这里网络的节点(参与者)在参与许多合作项目。在研究中只考虑参与者在项目中的合作关系,不讨论它们之间的竞争、对抗或其他类型的关系,而且定义参与者在项目中的合作关系为它们之间的边。这样,一个项目就可以用一个它包含的参与者两两连边所构成的完全图来表示。这样的网络不一定是社会网络,也可以包含其他许多类网络,但是由于拓扑结构具有共同特征,它们的统计性质和动力学特性也具有共同特征。在我们实证地研究过的实际网络中,我们发现好莱坞演员合作网、中国旅游线路网、城市公交线路网、中药方剂网、以及淮扬菜肴网都可以用广义合作网络来描述。我们对这些实证数据分析之后,得到了一些共同的统计特征:首先,项目是这类网络中的主导因素,项目如何组成是网络演化的关键问题。参与者项目度分布(即参与者参与的项目数目的分布)很可能是这类网络最主要的统计性质,在很大程度上左右顶点的点强度分布和度分布。其次,参与者的同类性系数也随着这样的分布规律的变化而呈现单调依赖关系的变化。我们建议了一个简明的、体现上述思想的网络演化模型,来说明这两项共同统计特征的动力学机理,由此模型的解析分析和数值模拟产生的统计结果与实证结果很好地符合。最后,根据这类被称为广义合作网络的共同拓扑特征,我们建议群落和层次的一种定量定义和相应的划分群落和层次的方法。由此所建议的一个新的统计参量——网络交连度可能富有实际意义。
由于实际的重要性,城市公交系统一直是研究的热点之一。我们从复杂网络的角度,研究旨在说明城市公交系统演化和性质的网络操纵者博弈模型。从这个角度出发,我们陆续提出三个模型,模型越来越简化,意思越来越集中,本论文中重点介绍最后一个最简网络操纵者博弈模型。我们建议最大简化地把公交公司和乘客看作网络的两个主要操纵者,他们的利益在某种意义上说是互相矛盾的,于是,城市公交网络系统的演化被最简化地看作网络的两个操纵者之间博弈的过程,博弈的均衡解决定网络最后的演化走势。对这样的模型进行了极端情况和均衡情况的解析,以及一般情况下的数值模拟研究,所得到的网络统计性质与我们对北京、上海、南京、杭州的实证统计结果相当好的符合,说明这个模型很可能
抓住了最根本的特征。这种思想很可能推广到许多其它系统。广义合作网络忽略了竞争因素。当在网络中加入竞争的因素时,网络会有什么样的特性呢?鉴于此,我们介绍了三个考虑到竞争因素的系统,这个工作是浅陋的。但期望这几个系统能够作为一个引子,能够激起研究者们对合作竞争网络作更深入的研究。
The dynamics principles, which describe the actors’behaviors in complex self-adaptive systems, should include some characters similar to what are shown by the living systems, such as forecasting, choice, learning, and evolution. Each actor and his behavior are different. Also, a system consisting of actors is not a simple combination of them. It cannot be treated by reduction theory, and cannot be described by the conventional mathematics, which serve for determinism and reductionism. We must develop some new methods and tools to describe self-adaptive systems. The latest development in the complex network gives us a possible way for searching the possibility.
The complex network can describe variety different practical systems. We have carried out empirical studies on quite some practical systems; wish to classify the systems based on the results and find out the common statistical properties of every kind of them. The next step could be setting up suitable models so that we could understand their common dynamical characteristics and mechanism. In this way we can reach, step by step, to a more universal understanding on complex systems. Among the very wide scope of complex network studying, our interests are concentrated on the so-called“generalized collaboration networks”. In such networks the nodes (actors) are participating a lot of collaborative acts. In the study we shall only consider actor's cooperation, and ignore the competition, confrontation or other type of relations between them. We propose define actor's cooperation in the acts as edges. In this way, one act can be described by a complete graph composed by the actors where every pair of them are connected with edges. Such a network may not be a social network, it can belong to many other kinds of networks too, but because the topological structure has common characteristics, their statistics properties have common characteristics. Among the practical networks we empirically studied, we found that the Chinese tourist line network, the urban public traffic network, the traditional Chinese medicine prescription network, and Huai-Yang recipe network can be described by the generalized collaboration networks. After the analysis on the empirical data, we have obtained some common statistical properties: First of all, the act is a leading factor in this kind of networks. The act degree distribution (the distribution of the number of the acts, in which the actors are participating) should be, very possibly, the most important property in such kinds of networks. It, in a great extent, determines the node strength degree and degree distribution. Secondly, the assortativity of the actors shows a monotonic change with the change of such distribution law. We propose a simplified model based on these ideas so as to show the common dynamical mechanisms of the two common properties. The analytic and numerical investigation results of the model show very good agreement with the empirical results. Finally, according to the common topological characteristics of the so-called generalized collaboration networks, we propose a quantitative definition and corresponding division method for community and hierarchy. A new network statistical property, the degree of interweavement, has been proposed by this consideration that may have practical importance.
Since urban public traffic systems are practically important, they have been extensively and intensively studied. We have studied urban public traffic networks from the viewpoint of complex networks and game theory. From that, we have suggested three manipulator game models of urban public traffic networks continuously. We try to construct a simplest model with the idea that hits the nail on the head. In this paper, we mainly present the last model of the three. We suggest a very simplified viewpoint in which the evolution of urban public traffic network can be considered as a game process between the two network manipulators, and the equilibrium solution of the game determines the last evolution tendency of the network. We have performed analytical discussion on some extreme and the equilibrium situations and numerical discussion on the general evolution, the obtained statistical properties are in a good agreement with the empirical ones obtained by the investigations on the urban public traffic systems in Beijing, Shanghai, Nanjing and Hangzhou. This shows that the model grasps the most fundamental characteristic of the system. The idea, very possibly, can be extended and used in many other systems.
Generalized collaboration networks ignore the factor of competition. If competition joins in network, what characteristic may appear? As for it, we introduce three systems which take competition into account. The research is rough. However, we expect as a beginning, the work could inspire people to research the collaboration and competition network deeply.
引文
[1] Erdes P, Rényi A. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 1960,5:17~60
[2] Barabási A L. Linked: The New Science of Networks. Massachusetts: Persus Publishing, 2002
[3] Watts D J. The ‘new’ science of network. Annual Review of Sociology, 2004, 30:243~270
[4] Watts D J, Strogatz S H. Collective dynamics of ‘small-world’ networks. Nature, 1998, 393(6684): 440~442
[5] Barabási A L, Albert R. Emergence of scaling in random networks. Science, 1999, 286(5439): 509~512
[6] Wasserman S. and Faust K., Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge 1994
[7] 罗家德,社会网分析讲义, 社会科学文献出版社,北京 2005
[8] 刘军,社会网分析导论, 社会科学文献出版社,北京 2004
[9] Newman M. E. J., Scientific collaboration networks. I. Network construction and fundamental results, Phys. Rev. E 64, 2001, 016131; Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Phys. Rev. E 64, 2001, 016132
[10] Barabási A. L., Jeong H., Neda Z. et al., Evolution of the social network of scientific collaboration, Physica A 311, 2002, 590
[11] Bilke S. and Peterson C., Topological properties of citation and metabolic networks, Phys. Rev. E 64, 2001, 036106
[12] Battiston S. and Catanzaro M., Statistical properties of corporate board and director networks, Eur. Phys. J. B 38, 2004, 345; Caldarellia G. and Catanzaro M.,The corporate boards networks, Physica A 338, 2004, 98
[13] Kou Z. and Zhang C., Reply networks on a bulletin board system, Phys. Rev. E 67, 2003, 036117
[14] Newman M. E. J., Forrest S. and Balthrop J., Email networks and the spread of computer viruses, Phys. Rev. E 66, 2002, 035101(R); Ebel H., Mielsch L-I. and Bornholdt S., Scale-free topology of e-mail networks, Phys. Rev. E 66, 2002, 035103(R)
[15] Fan Y., Li M., Chen J., Gao L., Di Z., Wu J., NETWORK OF ECONOPHYSICISTS: A WEIGHTED NETWORK TO INVESTIGATE THE DEVELOPMENT OF ECONOPHYSICS, Int. J. Mod. Phys. B 18 17–19, 2004, 2505; Li M., Fan Y., Chen J., Gao L., Di Z., Wu J., Weighted networks of scientific communication: the measurement and topological role of weight, Physica A 350, 2005, 643; Li M., Wu J., Wang D., Zhou T., Di Z. and Fan Y., Evolving Model of Weighted Networks Inspired by Scientific Collaboration Networks, arXiv: cond-mat/0501655
[16] Han D-D., Liu J-G., Ma Y-G., Cai X-Z. and Shen W-Q., Scale-free download network for publication, Chin. Phys. Lett. 21, 2004, 1855
[17] Xu T., Chen J., He Y. and He D.-R., Complex network properties of Chinese power grid, Inter. J. Modern Physics B, 18, 17-19, 2004, 2599;陈洁,许田,何大韧,中国电力网的复杂网络共性, 科技导报,4, 2004, 11-14
[18] He Y., Zhu X., He D.-R., STATISTICS AND DEVELOPING MODEL OF CHINESE SKYWAY NETWORK, Int. J. Mod. Phys. B 18, 17–19, 2004, 2595
[19] Zhu X., He Y., He D.-R., An investigation on Chinese skyway network, Bulletin of APS, 49, 1, 2004, 1007; He Y., Zhang P., Su B., He D., Search for function coefficient distribution in traditional Chinese medicine network, Bulletin of APS, 49, 1, 2004, 1006; Zhang Y., He Y., He D.-R., A network description on touristy in China Bulletin of APS, 49, 1, 2004, 1007; Sun A., Zhang P., He Y., Su B., He D., A complex network description on traditional Chinese medicine system, Bulletin of APS, 49, 1, 2004, 1006-1007; Hu J., Zhang P., Qiu R., Tang J., He D., Railway network in China, Bulletin of APS, 49, 1, 2004, 1008; Chen J., Xu T., He Y., HeD.-R., Network description on Chinese power grid, Bulletin of APS, 49, 1, 2004, 1008; Wang B., Xu T., He D., A network description on geometry and economics of Yangtze drainage area, Bulletin of APS, 49, 1, 2004, 1007.
[20] 许田,张培培,姜玉梅,苏蓓蓓,何大韧,流行病传播模型与 SARS, 自然杂志, 26, 2004, 20-25
[21] 张培培,侯威,何阅,何大韧, 淮扬菜系的网络描述, 复杂系统与复杂性科学, 2, 2005, 49; 何阅,张培培,唐继英,韩雪芳,邱荣,陈其娟,周月平,常慧,何大韧,中药方剂的合作网络描述, 科技导报,23, 2005, 36
[22] Zhang P., Chen K., He Y., Zhou T., Su B., Jin Y., Chang H., Zhou Y.-P., Sun L.-C., Wang B.-H., He D.-R., Model and empirical study on some collaboration networks, Physica A 360, 2006, 599–616
[23] Jiang Y., Xu T. and He D.-R., A self-adaptive model of actor-collaboration network, Inter. J. Modern Physics B, 18, 17-19, 2004, 2604;何阅,张培培,许田,姜玉梅,何大韧,一个科研合作网的双粒子图自适应演化模型, 物理学报,53, 2004, 1710-1715
[24] 张培培, 何阅, 周涛, 苏蓓蓓, 常慧, 周月平, 汪秉宏, 何大韧, 一个描述合作网络顶点度分布的模型, 物理学报,55, 2006, 60-67
[25] 何大韧,关于合作网络研究进展与前景的浅见, 中国高等科学技术中心,CCAST——WL workshop series: Vol. 170 (I), Second National Forum on Complex Dynamical Networks, 205-212
[26] 汪小帆,李翔,陈关荣.复杂网络理论及其应用.北京:清华大学出版社,2006
[27] 朱玉祥, 中医处方指南, 金盾出版社(第二版), 北京, 1996
[28] 刘东亮等, 中医常用方剂手册, 人民军医出版社, 北京, 1996
[29] 北京民族饭店菜谱编写组,淮扬菜谱,中国旅游出版社
[30] J. Laherrere and D. Sornette, Eur. Phys. J. B, 1998, 2: 525.
[31] Liu Z., Lai Y.-C. et al., Connectivity distribution and attack tolerance of general networks with both preferential and random attachments, Phys. Lett. A 303, 2002, 337-344
[32] Li X. and Chen G., A local-world evolving network model, Physica A 328, 2003, 274-286
[33] Ramasco J. J., Dorogavtsev S. N. and Pastor-Satorras R., Self-organization of collaboration networks, Phys. Rev. E 70, 2004, 036106
[34] 张培培, 何阅, 周涛, 苏蓓蓓, 常慧, 周月平, 汪秉宏, 何大韧, 一个描述合作网络顶点度分布的模型, 物理学报,55, 2006, 60-67
[35] Newman M. E. J., Assortative mixing in networks, Phys. Rev. Lett. 89, 2002, 208701; Mixing patterns in networks, Phys. Rev. E 67, 2003, 0261126
[36] Kurant M. and Thiran P., Extracting the traffic flows and the physical graphs from time tables. Arxiv. org. preprint physicst/0510151.2005a
[37] Kurant M. and Thiran P., Layered complex networks. arxiv. org preprint physicst/0510194. 2006b
[38] Sienkiewicz J. and Holyst J.A., Public transport systems in Poland: from Bialystok to Zielona Gora by bus and ream using universal statistics of complex networks. physics/0503099, 2005a
[39] Sienkiewicz J. and Holyst J.A., Statistical analysis of 22 public transport networks in Poland. arxiv. org preprint physicst/0506074.2005b
[40]C.V.Ferber, T. Holovatch, Yu. Holovatch and V.Palchykov. arXiv: physics/0608125
[41] X.Xu, J. Hu, F. Liu and L. Liu, Physica A 374(2007)441
[42] Y-Z. Chen, N.Li and D-R. He, Physica A 376(2007)747
[43]B-B.Su,HChang,Y-Z.Chen and D-R.He,Physica A(2007)doi:10.1016/j.physa.2006. 12.049
[44] W.Li and X.Cai, Phy. Rev. E. 69(2004)046106
[45] M. E. J. Newman, Phys. Rev. E. 70(2004)056131
[46] Z.Pan, X.Li and X. Wang, Phys.Rev. E. 73(2006)056109
[47]M.Bathélemy,A.Barrat,R.Pastor-Satorras,andA.Vespignani,Physica A 346(2005)34
[48] M.Li, Y.Fan, J.Chen, L.Gan, Z.Di and J. Wu, Physica A 350(2005)643
[49]W-X.Wang, B-H. Wang, B.Hu, G. Yan and Q.Ou, Phys. Rev. Lett. 94(2005)188702
[50]A.DeMontis,M Barthélemy, A. Chessa. And A. Vespignani, arXiv:physics/0507106
[51] C.C.Leung and H.F.Chau, arXiv:physics/0607134
[52] J.Laherrere and D.Sornette, Eur. Phys. J. B2(1998)525
[53]Hangzhou:http://www.hzbus.com.cn/;Nanjing:http://www.njkgc.cn/;Beijing:http://www.bjbus.com/;Shanghai:http://www.jt.sh.cn/.Yangzhou:http://www.yzren.com/life-bussetation.asp
[54] Z.Liu, Y-C Lai et al., Phys.Lett. A 303(2002)337
[55] X.Li and G.Chen,Physica A328(2003)274
[56] Newman M. E. J. and Park J., Why social networks are different from other types of networks, Phys. Rev. E 68, 2003, 036122
[57] Egu?′luz V. M., Chialvo D. R., Cecchi G. A., Baliki M. and Apkarian A. V., Scale-free brain functional networks, Phys. Rev. Lett. 94, 2005, 018102
[58] Park J. and Newman M. E. J., Origin of degree correlation in the Internet and other networks, Phys. Rev. E 68, 2003, 026112
[59] 解绉,汪小帆,复杂网络中的社团结构,复杂系统与复杂性科学,2, 2005, 1-12
[60] Newman M. E. J., Girvan M.. Finding and evaluating community structure in networks, Phys. Rev. E, 69, 2004, 026113
[61] Newman M. E. J., Fast algorithm for detecting community structure in networks, Phys. Rev. E, 69, 2004, 066133
[62] Clauset A., Newman M. E. J., Moore C., Finding community structure in very large networks, Phys. Rev. E, 70, 2004, 066111
[63] Palla G., Derényi I., Farkas I., Vicsek T., Uncovering the overlapping community structure of complex networks in nature and society, Nature, 435, 2005, 814-818
[64] Radicchi F., Castellano C., Cecconi F., Loreto V., and Parisi D., Defining and identifying communities in networks, PNAS, 101, 2004, 2658–2663
[65] Ravasz E. and Baraba′si A-L, Hierarchical organization in complex networks, Phys. Rev. E, 67, 2003, 026112
[66] Holme P., Huss M. and Jeong H., Subnetwork hierarchies of biochemical pathways, Bioinformatics, 19, 2003, 532-538
[67] Costa L. F., The hierarchical backbone of complex networks, Phys. Rev. Lett., 93, 2004, 098702
[68] Trusina A., Maslov S., Minnhagen P. and Sneppen K., Hierarchy measures in complex networks, Phys. Rev. Lett., 92, 2004, 178702
[69] Guimera R., Uzzi B., Spiro J., Amaral L. A. N., Team assembly mechanisms determine collaboration network structure and team performance, SCIENCE, 308, 2005, 697
[70] 郭雷等,复杂网络,上海科技教育出版社,上海 2006
[71] S-Y. Huang, X-W. Zou, Z-J. Tan and Z-Z. Jin, Network-induced non-equilibrium phase transition in the “game of life”, Phys. Rev. E 67, 026107 (2003)
[72] M. Anghel, Z. Torozkai, K. E. Bassler and G. Korniss, Competition-driven network dynamics: emergence of a scale-free leadership structure and collective efficiency, Phys. Rev. Lett. 92, 058701 (2004)
[73] H. Fort and N. Perez, Economic demography in fuzzy spatial dilemmas and power laws, Eur. Phys. J. B 44, 109-113 (2005)
[74] M. G. Zimmermann and V. M. Eguiluz, Cooperation, social networks, and the emergence of leadership in a prisoner’s dilemma with adaptive local interactions, Phys. Rev. E 72, 056118 (2005)
[75] K. Gao, W-X. Wang and B-H. Wang, Self-questioning games and ping-pong effect in the BA network, to appear in Physica A.
[76] W-X. Wang, J. Ren, G-R. Chen and B-H. Wang, Memory-based snowdrift game on networks, to appear in Phys. Rev. E
[77] C-L Tan, W-X. Wang, X. Wu and B-H. Wang, Effects of average degree oncooperation in networked evolution games, to appear in Eur. Phys. J. B
[78] L. Zubieta, A network equilibrium model for oligopolistic competition in city bus services, Transpn. Res. –B 32, 413-422 (1998)
[79] J. S. Chang and R. L. Mackett, A bi-level model of the relationship between transport and residential location, Transpn. Res. –B (2005)
[80] Y. Kidokoro, Benefit estimation of transport projects—a representative consumer approach, Transpn. Res. –B 40, 521-542 (2006)
[81] M. Rosvall, A. Trusina, P. Minnhagen, K. Sneppen. Networks and Cities: An Information Perspective. Phys. Rev. Lett. 94, 028701 (2005)
[82] C. von Ferber, Yu. Holovatch, V. Palchykov, Scaling in public transport networks, arXiv:cond-mat/0501296 v1 12 Jan 2005
[83] J. Sienkiewicz, J. A. Hoyst, Statistical analysis of 22 public transport networks in Poland, Phys. Rev. E 72, 046127 (2005)
[84] P. P. Zhang, K. Chen. Y. He et al. Model and empirical study on some collaboration networks. Physica A 360, 599-616 (2006)
[85] Y. Chen, N. Li and D-R. He, A study on some urban bus transport networks. Physica A 376(2007)747
[86] B.B. Su, H. Chang, Y-Z. Chen, D.R. He, A game theory model of urban public traffic networks. Physica A 379(2007)291-297
[87] 中国旅游年鉴 1996,1997,1999,2000,2002,中国旅游年鉴编辑委员会主编;中国旅游统计年鉴 1998,2001,2003,国家旅游局;中国旅游出版社
[88] 奥林匹克百科全书网 http://olympicnets.db66.com/list/jay.asp
[89] 中国图书馆分类法,《中国图书馆分类法》编委会,北京图书馆出版社,1999
[90] 《中图法》4 版的多重列类及分类方法,姚红,图书馆学刊,2002(1)
[2] Barabási A L. Linked: The New Science of Networks. Massachusetts: Persus Publishing, 2002
[3] Watts D J. The ‘new’ science of network. Annual Review of Sociology, 2004, 30:243~270
[4] Watts D J, Strogatz S H. Collective dynamics of ‘small-world’ networks. Nature, 1998, 393(6684): 440~442
[5] Barabási A L, Albert R. Emergence of scaling in random networks. Science, 1999, 286(5439): 509~512
[6] Wasserman S. and Faust K., Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge 1994
[7] 罗家德,社会网分析讲义, 社会科学文献出版社,北京 2005
[8] 刘军,社会网分析导论, 社会科学文献出版社,北京 2004
[9] Newman M. E. J., Scientific collaboration networks. I. Network construction and fundamental results, Phys. Rev. E 64, 2001, 016131; Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Phys. Rev. E 64, 2001, 016132
[10] Barabási A. L., Jeong H., Neda Z. et al., Evolution of the social network of scientific collaboration, Physica A 311, 2002, 590
[11] Bilke S. and Peterson C., Topological properties of citation and metabolic networks, Phys. Rev. E 64, 2001, 036106
[12] Battiston S. and Catanzaro M., Statistical properties of corporate board and director networks, Eur. Phys. J. B 38, 2004, 345; Caldarellia G. and Catanzaro M.,The corporate boards networks, Physica A 338, 2004, 98
[13] Kou Z. and Zhang C., Reply networks on a bulletin board system, Phys. Rev. E 67, 2003, 036117
[14] Newman M. E. J., Forrest S. and Balthrop J., Email networks and the spread of computer viruses, Phys. Rev. E 66, 2002, 035101(R); Ebel H., Mielsch L-I. and Bornholdt S., Scale-free topology of e-mail networks, Phys. Rev. E 66, 2002, 035103(R)
[15] Fan Y., Li M., Chen J., Gao L., Di Z., Wu J., NETWORK OF ECONOPHYSICISTS: A WEIGHTED NETWORK TO INVESTIGATE THE DEVELOPMENT OF ECONOPHYSICS, Int. J. Mod. Phys. B 18 17–19, 2004, 2505; Li M., Fan Y., Chen J., Gao L., Di Z., Wu J., Weighted networks of scientific communication: the measurement and topological role of weight, Physica A 350, 2005, 643; Li M., Wu J., Wang D., Zhou T., Di Z. and Fan Y., Evolving Model of Weighted Networks Inspired by Scientific Collaboration Networks, arXiv: cond-mat/0501655
[16] Han D-D., Liu J-G., Ma Y-G., Cai X-Z. and Shen W-Q., Scale-free download network for publication, Chin. Phys. Lett. 21, 2004, 1855
[17] Xu T., Chen J., He Y. and He D.-R., Complex network properties of Chinese power grid, Inter. J. Modern Physics B, 18, 17-19, 2004, 2599;陈洁,许田,何大韧,中国电力网的复杂网络共性, 科技导报,4, 2004, 11-14
[18] He Y., Zhu X., He D.-R., STATISTICS AND DEVELOPING MODEL OF CHINESE SKYWAY NETWORK, Int. J. Mod. Phys. B 18, 17–19, 2004, 2595
[19] Zhu X., He Y., He D.-R., An investigation on Chinese skyway network, Bulletin of APS, 49, 1, 2004, 1007; He Y., Zhang P., Su B., He D., Search for function coefficient distribution in traditional Chinese medicine network, Bulletin of APS, 49, 1, 2004, 1006; Zhang Y., He Y., He D.-R., A network description on touristy in China Bulletin of APS, 49, 1, 2004, 1007; Sun A., Zhang P., He Y., Su B., He D., A complex network description on traditional Chinese medicine system, Bulletin of APS, 49, 1, 2004, 1006-1007; Hu J., Zhang P., Qiu R., Tang J., He D., Railway network in China, Bulletin of APS, 49, 1, 2004, 1008; Chen J., Xu T., He Y., HeD.-R., Network description on Chinese power grid, Bulletin of APS, 49, 1, 2004, 1008; Wang B., Xu T., He D., A network description on geometry and economics of Yangtze drainage area, Bulletin of APS, 49, 1, 2004, 1007.
[20] 许田,张培培,姜玉梅,苏蓓蓓,何大韧,流行病传播模型与 SARS, 自然杂志, 26, 2004, 20-25
[21] 张培培,侯威,何阅,何大韧, 淮扬菜系的网络描述, 复杂系统与复杂性科学, 2, 2005, 49; 何阅,张培培,唐继英,韩雪芳,邱荣,陈其娟,周月平,常慧,何大韧,中药方剂的合作网络描述, 科技导报,23, 2005, 36
[22] Zhang P., Chen K., He Y., Zhou T., Su B., Jin Y., Chang H., Zhou Y.-P., Sun L.-C., Wang B.-H., He D.-R., Model and empirical study on some collaboration networks, Physica A 360, 2006, 599–616
[23] Jiang Y., Xu T. and He D.-R., A self-adaptive model of actor-collaboration network, Inter. J. Modern Physics B, 18, 17-19, 2004, 2604;何阅,张培培,许田,姜玉梅,何大韧,一个科研合作网的双粒子图自适应演化模型, 物理学报,53, 2004, 1710-1715
[24] 张培培, 何阅, 周涛, 苏蓓蓓, 常慧, 周月平, 汪秉宏, 何大韧, 一个描述合作网络顶点度分布的模型, 物理学报,55, 2006, 60-67
[25] 何大韧,关于合作网络研究进展与前景的浅见, 中国高等科学技术中心,CCAST——WL workshop series: Vol. 170 (I), Second National Forum on Complex Dynamical Networks, 205-212
[26] 汪小帆,李翔,陈关荣.复杂网络理论及其应用.北京:清华大学出版社,2006
[27] 朱玉祥, 中医处方指南, 金盾出版社(第二版), 北京, 1996
[28] 刘东亮等, 中医常用方剂手册, 人民军医出版社, 北京, 1996
[29] 北京民族饭店菜谱编写组,淮扬菜谱,中国旅游出版社
[30] J. Laherrere and D. Sornette, Eur. Phys. J. B, 1998, 2: 525.
[31] Liu Z., Lai Y.-C. et al., Connectivity distribution and attack tolerance of general networks with both preferential and random attachments, Phys. Lett. A 303, 2002, 337-344
[32] Li X. and Chen G., A local-world evolving network model, Physica A 328, 2003, 274-286
[33] Ramasco J. J., Dorogavtsev S. N. and Pastor-Satorras R., Self-organization of collaboration networks, Phys. Rev. E 70, 2004, 036106
[34] 张培培, 何阅, 周涛, 苏蓓蓓, 常慧, 周月平, 汪秉宏, 何大韧, 一个描述合作网络顶点度分布的模型, 物理学报,55, 2006, 60-67
[35] Newman M. E. J., Assortative mixing in networks, Phys. Rev. Lett. 89, 2002, 208701; Mixing patterns in networks, Phys. Rev. E 67, 2003, 0261126
[36] Kurant M. and Thiran P., Extracting the traffic flows and the physical graphs from time tables. Arxiv. org. preprint physicst/0510151.2005a
[37] Kurant M. and Thiran P., Layered complex networks. arxiv. org preprint physicst/0510194. 2006b
[38] Sienkiewicz J. and Holyst J.A., Public transport systems in Poland: from Bialystok to Zielona Gora by bus and ream using universal statistics of complex networks. physics/0503099, 2005a
[39] Sienkiewicz J. and Holyst J.A., Statistical analysis of 22 public transport networks in Poland. arxiv. org preprint physicst/0506074.2005b
[40]C.V.Ferber, T. Holovatch, Yu. Holovatch and V.Palchykov. arXiv: physics/0608125
[41] X.Xu, J. Hu, F. Liu and L. Liu, Physica A 374(2007)441
[42] Y-Z. Chen, N.Li and D-R. He, Physica A 376(2007)747
[43]B-B.Su,HChang,Y-Z.Chen and D-R.He,Physica A(2007)doi:10.1016/j.physa.2006. 12.049
[44] W.Li and X.Cai, Phy. Rev. E. 69(2004)046106
[45] M. E. J. Newman, Phys. Rev. E. 70(2004)056131
[46] Z.Pan, X.Li and X. Wang, Phys.Rev. E. 73(2006)056109
[47]M.Bathélemy,A.Barrat,R.Pastor-Satorras,andA.Vespignani,Physica A 346(2005)34
[48] M.Li, Y.Fan, J.Chen, L.Gan, Z.Di and J. Wu, Physica A 350(2005)643
[49]W-X.Wang, B-H. Wang, B.Hu, G. Yan and Q.Ou, Phys. Rev. Lett. 94(2005)188702
[50]A.DeMontis,M Barthélemy, A. Chessa. And A. Vespignani, arXiv:physics/0507106
[51] C.C.Leung and H.F.Chau, arXiv:physics/0607134
[52] J.Laherrere and D.Sornette, Eur. Phys. J. B2(1998)525
[53]Hangzhou:http://www.hzbus.com.cn/;Nanjing:http://www.njkgc.cn/;Beijing:http://www.bjbus.com/;Shanghai:http://www.jt.sh.cn/.Yangzhou:http://www.yzren.com/life-bussetation.asp
[54] Z.Liu, Y-C Lai et al., Phys.Lett. A 303(2002)337
[55] X.Li and G.Chen,Physica A328(2003)274
[56] Newman M. E. J. and Park J., Why social networks are different from other types of networks, Phys. Rev. E 68, 2003, 036122
[57] Egu?′luz V. M., Chialvo D. R., Cecchi G. A., Baliki M. and Apkarian A. V., Scale-free brain functional networks, Phys. Rev. Lett. 94, 2005, 018102
[58] Park J. and Newman M. E. J., Origin of degree correlation in the Internet and other networks, Phys. Rev. E 68, 2003, 026112
[59] 解绉,汪小帆,复杂网络中的社团结构,复杂系统与复杂性科学,2, 2005, 1-12
[60] Newman M. E. J., Girvan M.. Finding and evaluating community structure in networks, Phys. Rev. E, 69, 2004, 026113
[61] Newman M. E. J., Fast algorithm for detecting community structure in networks, Phys. Rev. E, 69, 2004, 066133
[62] Clauset A., Newman M. E. J., Moore C., Finding community structure in very large networks, Phys. Rev. E, 70, 2004, 066111
[63] Palla G., Derényi I., Farkas I., Vicsek T., Uncovering the overlapping community structure of complex networks in nature and society, Nature, 435, 2005, 814-818
[64] Radicchi F., Castellano C., Cecconi F., Loreto V., and Parisi D., Defining and identifying communities in networks, PNAS, 101, 2004, 2658–2663
[65] Ravasz E. and Baraba′si A-L, Hierarchical organization in complex networks, Phys. Rev. E, 67, 2003, 026112
[66] Holme P., Huss M. and Jeong H., Subnetwork hierarchies of biochemical pathways, Bioinformatics, 19, 2003, 532-538
[67] Costa L. F., The hierarchical backbone of complex networks, Phys. Rev. Lett., 93, 2004, 098702
[68] Trusina A., Maslov S., Minnhagen P. and Sneppen K., Hierarchy measures in complex networks, Phys. Rev. Lett., 92, 2004, 178702
[69] Guimera R., Uzzi B., Spiro J., Amaral L. A. N., Team assembly mechanisms determine collaboration network structure and team performance, SCIENCE, 308, 2005, 697
[70] 郭雷等,复杂网络,上海科技教育出版社,上海 2006
[71] S-Y. Huang, X-W. Zou, Z-J. Tan and Z-Z. Jin, Network-induced non-equilibrium phase transition in the “game of life”, Phys. Rev. E 67, 026107 (2003)
[72] M. Anghel, Z. Torozkai, K. E. Bassler and G. Korniss, Competition-driven network dynamics: emergence of a scale-free leadership structure and collective efficiency, Phys. Rev. Lett. 92, 058701 (2004)
[73] H. Fort and N. Perez, Economic demography in fuzzy spatial dilemmas and power laws, Eur. Phys. J. B 44, 109-113 (2005)
[74] M. G. Zimmermann and V. M. Eguiluz, Cooperation, social networks, and the emergence of leadership in a prisoner’s dilemma with adaptive local interactions, Phys. Rev. E 72, 056118 (2005)
[75] K. Gao, W-X. Wang and B-H. Wang, Self-questioning games and ping-pong effect in the BA network, to appear in Physica A.
[76] W-X. Wang, J. Ren, G-R. Chen and B-H. Wang, Memory-based snowdrift game on networks, to appear in Phys. Rev. E
[77] C-L Tan, W-X. Wang, X. Wu and B-H. Wang, Effects of average degree oncooperation in networked evolution games, to appear in Eur. Phys. J. B
[78] L. Zubieta, A network equilibrium model for oligopolistic competition in city bus services, Transpn. Res. –B 32, 413-422 (1998)
[79] J. S. Chang and R. L. Mackett, A bi-level model of the relationship between transport and residential location, Transpn. Res. –B (2005)
[80] Y. Kidokoro, Benefit estimation of transport projects—a representative consumer approach, Transpn. Res. –B 40, 521-542 (2006)
[81] M. Rosvall, A. Trusina, P. Minnhagen, K. Sneppen. Networks and Cities: An Information Perspective. Phys. Rev. Lett. 94, 028701 (2005)
[82] C. von Ferber, Yu. Holovatch, V. Palchykov, Scaling in public transport networks, arXiv:cond-mat/0501296 v1 12 Jan 2005
[83] J. Sienkiewicz, J. A. Hoyst, Statistical analysis of 22 public transport networks in Poland, Phys. Rev. E 72, 046127 (2005)
[84] P. P. Zhang, K. Chen. Y. He et al. Model and empirical study on some collaboration networks. Physica A 360, 599-616 (2006)
[85] Y. Chen, N. Li and D-R. He, A study on some urban bus transport networks. Physica A 376(2007)747
[86] B.B. Su, H. Chang, Y-Z. Chen, D.R. He, A game theory model of urban public traffic networks. Physica A 379(2007)291-297
[87] 中国旅游年鉴 1996,1997,1999,2000,2002,中国旅游年鉴编辑委员会主编;中国旅游统计年鉴 1998,2001,2003,国家旅游局;中国旅游出版社
[88] 奥林匹克百科全书网 http://olympicnets.db66.com/list/jay.asp
[89] 中国图书馆分类法,《中国图书馆分类法》编委会,北京图书馆出版社,1999
[90] 《中图法》4 版的多重列类及分类方法,姚红,图书馆学刊,2002(1)