| Original Articles |
|
|
|
|
Structural Properties of US Flight Network |
| CHI Li-Ping1;WANG Ru2;SU Hang2;XU Xin-Ping2;ZHAO Jin-Song2;LI Wei1,3;CAI Xu1 |
| 1Institute of Particle Physics, Huazhong Normal University, Wuhan 430079
2Department of Physics, Huazhong Normal University, Wuhan 430079
3Max-Planck Institute for Mathematics in the Sciences, Inselstr. 22, D-04103, Leipzig, Germany |
|
| Cite this article: |
|
CHI Li-Ping, WANG Ru, SU Hang et al 2003 Chin. Phys. Lett. 20 1393-1396 |
|
|
|
Abstract We analyse the directed, weighted and evolutionary US flight network, in which vertices are the airports and the flights connecting two airports represent the edges. It is shown that such a network displays two important features recently found in small-world networks. First, the average shortest-path length is 2.4 s, the clustering coefficient of the entire network, 0.618, is greatly larger than that of the random networks with the same N (system size) and (average degree), 0.065. We study the detailed flight information both in a week and on a whole. In both the cases, using the Pareto distributions, we find the degree distributions follow two-segment power laws. The weight distributions have power-law tails with the exponents of around 2, and the clustering coefficient distributions follow linear distributions.
|
| Keywords:
89.75.Hc
89.75.Da
89.75.-k
|
|
|
Published: 01 August 2003
|
|
|
|
|
|
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
