Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition

Abstract

We introduce a new network statistic that measures diverse structural properties at the micro-, meso-, and macroscopic scales, while still being easy to compute and easy to interpret at a glance. Our statistic, the onion spectrum, is based on the onion decomposition, which refines the k-core decomposition, a standard network fingerprinting method. The onion spectrum is exactly as easy to compute as the k-cores: It is based on the stages at which each vertex gets removed from a graph in the standard algorithm for computing the k-cores. But the onion spectrum reveals much more information about a network, and at multiple scales; for example, it can be used to quantify node heterogeneity, degree correlations, centrality, and tree- or lattice-likeness of the whole network as well as of each k-core. Furthermore, unlike the k-core decomposition, the combined degree-onion spectrum immediately gives a clear local picture of the network around each node which allows the detection of interesting subgraphs whose topological structure differs from the global network organization. This local description can also be leveraged to easily generate samples from the ensemble of networks with a given joint degree-onion distribution. We demonstrate the utility of the onion spectrum for understanding both static and dynamic properties on several standard graph models and on many real-world networks.

8 pages manuscript, 6 figures

References in corpus (3)

• Modularity and community structure in networks
• A k-shell decomposition method for weighted networks
• Percolation on random networks with arbitrary k-core structure

Cited by in corpus (18)

• A Clarified Typology of Core-Periphery Structure in Networks
• Cost-efficient vaccination protocols for network epidemiology
• T-ReX: a graph-based filament detection method
• Hyper-cores promote localization and efficient seeding in higher-order processes
• Phase transition in the recoverability of network history
• Smeared phase transitions in percolation on real complex networks
• Interplay between $k$-core and community structure in complex networks
• Percolation and the effective structure of complex networks
• Reconstructing dynamical networks via feature ranking
• Course-Prerequisite Networks for Analyzing and Understanding Academic Curricula
• Random Graphs with Prescribed $K$-Core Sequences: A New Null Model for Network Analysis
• Inference for growing trees
• Convexity in complex networks
• Decoupling approximation robustly reconstructs directed dynamical networks
• A sampling-guided unsupervised learning method to capture percolation in complex networks
• Tracing gaseous filaments connected to galaxy clusters: the case study of Abell 2744
• The Census-Stub Graph Invariant Descriptor
• Network compression with configuration models and the minimum description length