Topology of the Italian airport network: A scale-free small-world network with a fractal structure?

Abstract In this paper, for the first time we analyze the structure of the Italian Airport Network (IAN) looking at it as a mathematical graph and investigate its topological properties. We find that it has very remarkable features, being like a scale-free network, since both the degree and the “betweenness centrality” distributions follow a typical power-law known in literature as a Double Pareto Law. From a careful analysis of the data, the Italian Airport Network turns out to have a self-similar structure. In short, it is characterized by a fractal nature, whose typical dimensions can be easily determined from the values of the power-law scaling exponents. Moreover, we show that, according to the period examined, these distributions exhibit a number of interesting features, such as the existence of some “hubs”, i.e. in the graph theory’s jargon, nodes with a very large number of links, and others most probably associated with geographical constraints. Also, we find that the IAN can be classified as a small-world network because the average distance between reachable pairs of airports grows at most as the logarithm of the number of airports. The IAN does not show evidence of “communities” and this result could be the underlying reason behind the smallness of the value of the clustering coefficient, which is related to the probability that two nearest neighbors of a randomly chosen airport are connected.

[1]  M. E. Naschie,et al.  A review of E infinity theory and the mass spectrum of high energy particle physics , 2004 .

[2]  R. Guimerà,et al.  The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[3]  M. S. El Naschie,et al.  Small world network, ε(∞) topology and the mass spectrum of high energy particles physics , 2004 .

[4]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[5]  Ettore Laserra,et al.  Stochastic self-similar and fractal universe , 2004 .

[6]  G. Iovane.  Cantorian spacetime and Hilbert space: Part I—Foundations , 2006 .

[7]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Ganesh Bagler,et al.  Analysis of the airport network of India as a complex weighted network , 2004, cond-mat/0409773.

[9]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[10]  W. Li,et al.  Statistical analysis of airport network of China. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[12]  M. Weigt,et al.  On the properties of small-world network models , 1999, cond-mat/9903411.

[13]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Béla Bollobás,et al.  Random Graphs , 1985 .

[15]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[16]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Shlomo Havlin,et al.  Fractal growth of complex networks: repulsion between hubs , 2005 .