复杂网络的时空建模法

交通运输系统工程与信息 ›› 2006, Vol. 6 ›› Issue (3): 53-57 .

复杂网络的时空建模法

赵小梅¹，高自友¹，黄海军²

1.北京交通大学轨道交通控制与安全国家重点实验室，北京100044; 2.北京航空航天大学经济管理学院，北京100083

收稿日期:2006-03-16 修回日期:1900-01-01 出版日期:2006-06-20 发布日期:2006-06-20

A Spatial-Growth Approach for Distinct Complex Networks

ZHAO Xiao-mei¹，GAOZ i-you¹，HUANGH ai-Jun²

1.State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China; 2. Schoolof Management, Beijing University of Aeronautics and Astronautics, Beijing 100083，China

Received:2006-03-16 Revised:1900-01-01 Online:2006-06-20 Published:2006-06-20

摘要/Abstract

摘要： 提出了一种复杂网络模型的新机制，在网络生长的过程中新节点的加入是使其预期的效用最大。其中，效用不仅考虑其连接的利益，同时也考虑建立连接的地理信息。我们深入分析了地理位置信息引入对网络度分布、簇系数和匹配方式的影响。仿真结果表明，该建模机制能够得到各种不同拓扑结构的复杂网络，包括随机网络、小世界网络、无标度网络等。并且地理信息对网络的匹配方式有重要的影响。

关键词: 复杂网络, 时空生长模型, 网络拓扑结构, 度分布

Abstract: Complex networks extensively exist in human society and natural world. We here report a new mechanism that maximizes the expected utility of attaching a new node to the existing network at each growing stage of the network.On the base of this mechanism, the utility that considers both the connection and the geography is formulated. The effects caused by geography on connection distributions, clustering coefficients, and affinity paterns are investigated. Simulation results show that the proposed approach can generate a variety of topological networks, including random graphs, small-world networks, scale-free networks and other new networks. It is shown that the spatial effects may play an important role in the pattern of connection affinity.

Key words: complex networks, spatial-growth model, network topology, degree distribution

赵小梅,高自友,黄海军. 复杂网络的时空建模法[J]. 交通运输系统工程与信息, 2006, 6(3): 53-57 .

ZHAO Xiao-mei,GAOZ i-you,HUANGH ai-Jun. A Spatial-Growth Approach for Distinct Complex Networks[J]. Journal of Transportation Systems Engineering and Information Technology, 2006, 6(3): 53-57 .

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.tseit.org.cn/CN/abstract/abstract17425.shtml

http://www.tseit.org.cn/CN/Y2006/V6/I3/53

参考文献

[1] Amaral L A N, Scala A, Barthelemy M, and Stanley H E. Classes of small-world networks, Proc. Natl. Acad. Sci. USA 2000, 97，11149-11152.
[2] Newman M E J. Scientific colaboration networks: I. Network construct ion and fundamental results, Phys. Rev. E 64, 016131; II. Shortest paths, weighted networks, and cnntrality, Phys. Rev. E 64, 016132. 2001.
[3] Banavar, J R, Maritan A and Rinaldo A. Size and form in ecient transportation networks, Nature 1999，399, 130-132.
[4] Jiang B and Claramunt C. Topological Analysis of Urban Street Networks, Environment and Planning B: Planning and Design, 2004,31:151-162.
[5] Albert R, Jeong H and Barabasi A-L. Diameter of the World Wide Web, Nature, 1999, 401:130-131.
[6] Wiliams R J and Martinez N D. Simple rules yield complex food webs, Nature, 2000,404:180-183.
[7] Gao Z Y, Wu J J, Mao B H and Huang H J. Research on complexity of transportation networks and its related problems[J]. Journal of Transportation Systems Engineering and Information Technology, 2005, 5 : 79-84.
[8] Jeong H, Tombor B，Albert R, Oltvai Z N and Barabasi, A-L.，2000，The large-scale organization of metabolic networks, Nature 407, 651-654.
[9] Wats D J and Strogatz S H. Colective dynamics of smalworld networks, Nature, 1998, 393, 440-442.
[10] Wasserman S and Faust K. Social Networks Analysis (Cambridge University Press, Cambridge, 1994).
[11] BarabasiA .-L and Albert R. Emergence of scaling in random networks, Science, 1999, 286: 509-512.
[12] Latora V and Marchiori M. Economic small-world behavior in weighted networks, Eur. Phys. J. B,2003,32:249-263.
[13] Newman M E J. The structure and function of complex networks, SIAM Rev, 2003, 45: 167-256.
[14] Yook S H, Jeong H, Barabasi A.-Land Tu Y. weighted evolving networks, Phys. Rev. Lett. 2001，86: 5835-5838.
[15] Park K, Lai Y C and Ye N. Characterization of weighted complex networks, Phys. Rev. E 70, 026109, 2004.
[16] Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods(Prentice-Hall, Englewood Cliffs, New Jersey, 1985).
[17] Krapivsky P L, Redner S and Leyvraz F. Connectivity of growing random networks, cond-mat/0005139, 2000.