Clusters and communities in air traffic delay networks

Abstract

The air transportation system is a network of many interacting, capacity-constrained elements. When the demand for airport and airspace resources exceed the available capacities of these resources, delays occur. The state of the air transportation system at any time can be represented as a weighted directed graph in which the nodes correspond to airports, and the weight on each arc is the delay experienced by departures on that origin-destination pair. Over the course of any day, the state of the system progresses through a time-series, where the state at any time-step is the weighted directed graph described above. This paper presents algorithms for the clustering of air traffic delay network data from the US National Airspace System, in order to identify characteristic delay states (i.e., weighted directed graphs) as well as characteristic types-of-days (i.e., sequences of such weighted directed graphs) that are experienced by the air transportation system. The similarity of delay states during clustering are evaluated on the basis of not only the in- and out-degrees of the nodes (the total inbound and outbound delays), but also network-theoretic properties such as the eigenvector centralities, and the hub and authority scores of different nodes. Finally, the paper looks at community detection, that is, the grouping of nodes (airports) based on their similarities within a system delay state. The type of day is found to have an impact on the observed community structures.