Multiresolution Analysis and Statistical Thresholding on Dynamic Networks
Not on the map. Why?
Abstract (arXiv)
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 the 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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 54 references that are in the map. First posted on arXiv 1 Jun 2025.
Builds on
22 of 54 references.
References · 22
- 2020Spectral Methods for Data Science: A Statistical Perspectivecited by 112
- 2017A statistical interpretation of spectral embedding: the generalised random dot product graphcited by 55
- 2017Introduction to Tensor Decompositions and their Applications in Machine Learningcited by 46
- 2019Inference for multiple heterogeneous networks with a common invariant subspacecited by 39
- 2015Multivariate Functional Principal Component Analysis for Data Observed on Different (Dimensional) Domainscited by 32
- 2020The multilayer random dot product graphcited by 19
- 2014Contact patterns among high school studentscited by 18
- 2013Detecting the community structure and activity patterns of temporal networks: a non-negative tensor factorization approachcited by 8
- 2021Mutually exciting point process graphs for modelling dynamic networkscited by 8
- 2021Continuous Latent Position Models for Instantaneous Interactionscited by 8
- 2023Laplacian Change Point Detection for Single and Multi-view Dynamic Graphscited by 7
- 2022A tensor factorization model of multilayer network interdependencecited by 6
10 more
- 2021Optimal network online change point localisationcited by 5
- 2023Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networkscited by 5
- 2018Tensorial and bipartite block models for link prediction in layered networks and temporal networkscited by 4
- 2021Multimodal urban mobility and multilayer transport networkscited by 4
- 2019Link prediction in dynamic networks using random dot product graphscited by 3
- 2024Gaussian Embedding of Temporal Networkscited by 3
- 2018Multiresolution analysis of point processes and statistical thresholding for wavelet-based intensity estimationcited by 2
- 2024PCA for Point Processescited by 2
- 2024Online Bayesian changepoint detection for network Poisson processes with community structurecited by 2
- 2019Wavelet Spectra for Multivariate Point Processescited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Non-Negative Matrix Factorization for Event Datacited by 0
- 2026Non-Negative Matrix Factorization for Event Data4 Jun 2026