Cliques and a new measure of clustering: with application to U.S. domestic airlines

Abstract

We propose a higher-order generalization of the well-known overall clustering coefficient for triples $C(3)$ to any number of nodes. We give analytic formulae for the special cases of three, four, and five nodes and show that they have very fast runtime performance for small graphs. We discuss some theoretical properties and limitations of the new measure, and use it to provide insight into dynamic changes in the structure of U.S. airline networks.

arXiv comment35 pages, 17 figures

References in corpus (22)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• The large-scale organization of metabolic networks
• Random graphs with arbitrary degree distributions and their applications
• Characterization of complex networks: A survey of measurements
• Clustering and preferential attachment in growing networks
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• Higher-order organization of complex networks
• Complex network approaches to nonlinear time series analysis
• Random graphs with clustering
• Properties of highly clustered networks
• The Statistical Physics of Real-World Networks
• Modelling the Air Transport with Complex Networks: a short review
• Resilience and rewiring of the passenger airline networks in the United States
• Microdynamics in stationary complex networks
• Higher-order clustering in networks
• Higher order clustering coefficients in Barabasi-Albert networks
• The small-world effect is a modern phenomenon
• Subgraphs and motifs in a dynamic airline network
• Tools for higher-order network analysis
• Counting five-node subgraphs

Cited by in corpus (1)

• Subgraphs and motifs in a dynamic airline network