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

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.