Multiresolution Analysis and Statistical Thresholding on Dynamic Networks
Raphaël Romero, Tijl De Bie, Nick Heard, Alexander Modell
Abstract
Detecting structural change in dynamic network data has wide-ranging applications. Existing approaches typically divide the data into time bins, extract network features within each bin, and then compare these features over time. This introduces an inherent tradeoff between temporal resolution and statistical stability of the extracted features. Despite this tradeoff, reminiscent of time-frequency tradeoffs in signal processing, most methods rely on a fixed temporal resolution. Choosing an appropriate resolution parameter is typically difficult, and can be especially problematic in domains like cybersecurity, where anomalous behavior may emerge at multiple time scales. We address this challenge by proposing ANIE (Adaptive Network Intensity Estimation), a multi-resolution framework designed to automatically identify the time scales at which network structure evolves, enabling the joint detection of both rapid and gradual changes. Modeling interactions as Poisson processes, our method proceeds in two steps: (1) estimating a low-dimensional subspace of node behavior, and (2) deriving a set of novel empirical affinity coefficients that quantify change in interaction intensity between latent factors and support statistical testing for structural change across time scales. We provide theoretical guarantees for subspace estimation and the asymptotic behavior of the affinity coefficients, enabling model-based change detection. Experiments on synthetic networks show that ANIE adapts to the appropriate time resolution, and is able to capture sharp structural changes while remaining robust to noise. Furthermore, applications to real-world data showcase the practical benefits of ANIE 's multiresolution approach to detecting structural change over fixed resolution methods. An open-source implementation of the method is available at https://github.com/aida-ugent/anie.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on1
Related papers
- Laplacian Change Point Detection for Dynamic GraphsShenyang Huang, Yasmeen Hitti, Guillaume Rabusseau, Reihaneh RabbanyKDD 2020 · 54 citations
- FreqTAD: Multi-scale Frequency Encoding and Time-Frequency Attention for Anomaly Detection in Dynamic GraphsChao Li, Runshuo Liu, Zhongying Zhao, Hui Zhou et al.AAAI 2026
- HLSAD: Hodge Laplacian-based Simplicial Anomaly DetectionFlorian Frantzen, Michael T. SchaubKDD 2025 · 2 citations
- Learning Changes in Graphon Attachment Network ModelsXinyuan Fan, Bufan Li, Chenlei Leng, Weichi WuICML 2025
- Online Change Point Detection for Multivariate Inhomogeneous Poisson Processes Time SeriesXiaokai Luo, Haotian Xu, Carlos Misael Madrid Padilla, OSCAR HERNAN MADRID PADILLAICML 2026
