Complexity Analysis of Public Transportation Network in Zhangjiagang City Using Complex Network Theory

Article Preview

Abstract:

Public transportation network has been proven that it can be simulated as a complex network. In this paper, a bus transport system of Zhangjiagang city is considered. Network degree distribution, average path length, and clustering coefficient are utilized as criteria to analyze as the complexity of the network. Experimental results show that the network which is in line with power-law distribution has a smaller average path length and a large clustering coefficient. It also indicates that, the networks of Zhangjiagang public bus system are not a small-world network with scale-free property.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 546-547)

Pages:

1211-1216

Citation:

Online since:

July 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Amaral L A N, Scala A, Barthelemy M. et al. Classes of behavior of small-world networks [J]. Proceedings of the National Academy ofSciences of the United Station of America, 1997(21): 11149-11152.

Google Scholar

[2] Vito Latora, Massimo Marchiori. Is the Boston subway a small worldnetworks [J]. Physical A, 2002, 314: 109-113.

Google Scholar

[3] Sienkiewicz J, Holyst J A. Public transport systems in Poland: fromBialystok to Zielona Gora. By bus and tramusing universal statisticsof complex networks [J]. Physics, 2005, 99(3): 1771-1778.

Google Scholar

[4] Gaozhiyou, zaoxiaomei, HuangHaiJun. Complex network theory and the complexity of urban transport issues related to research [J]. Transport system and information 2006,6(3): 41-47.

Google Scholar

[5] Zhangcheng, Zhengning. Properties of Shanghai bus network topology [J]. Shanghai University of Technology2006, 28(5): 489-494.

Google Scholar

[6] HeiDaRen. Complex systems and complex networks. Higher Education Press . (2009).

Google Scholar

[7] MaJinFu, WangHongLei. Guiyang bus transportation network complexity analysis[J]. Networking and Communications 2009, 28(4): 89-90, 194.

Google Scholar

[8] Newman M E J, Watts D J. Renormalization group analysis of the small- world network model Phys. Lett. A, 1999, 263; 341~346.

DOI: 10.1016/s0375-9601(99)00757-4

Google Scholar

[9] AlbertR, BarabasiA L. Statisticalmechanics of complex networks[J]. Reviews ofModern Physics, 2002, 74: 47-97.

Google Scholar

[10] NewmanM E J. The structure and function of complex networks[J]. SIAM Rev, 2003, 45: 167-225.

Google Scholar

[11] BarabasiA L, AlbertR. Emergence of scaling in random networks[J]. Science, 1999, 286: 509-512.

Google Scholar

[12] Ramasco J J, Dorogovtsev S N, Pastot-Satorras R. Self-organization of collaboration networks[ J]. Phys Rev E, 2004, 70: 036106.

DOI: 10.1103/physreve.70.036106

Google Scholar

[13] Zhang P P, Chen K, He Y, et a. l Model and empirical study on some collaboration networks[J]. Physica A, 2006, 360: 599-616.

Google Scholar

[14] ChangH, Su B B, Zhou Y P, et a. l Assortativity and act degree distribution of some collaboration networks[J]. Physica A, 2007, 383(2): 687-702.

DOI: 10.1016/j.physa.2007.04.045

Google Scholar

[15] Watts D J, Strogatz S H. Collective dynamics of small- world, networks. Nature, 1998, 393 (6684): 440~442.

DOI: 10.1038/30918

Google Scholar

[16] ZHAO Ming, ZHOU Tao, WANG Bing-hong, et al. Enhance synchronizability by structural perturbations[J]. PhysRev E, 2005, 72(5): 057102.

Google Scholar

[17] M. Kurant, P. Thiran, Phys. Rev. Lett. 96 (2006) 138701.

Google Scholar