Change Point Methods on a Sequence of Graphs
Daniele Zambon, Cesare Alippi, Lorenzo Livi

TL;DR
This paper introduces novel change point detection methods for sequences of attributed graphs, enabling identification of distribution shifts in complex network data with theoretical guarantees and practical validation.
Contribution
It proposes new CPMs that map graphs into vectors, apply statistical tests, and detect change points, extending to multiple change points and validating on real datasets.
Findings
Effective detection of change points in graph sequences.
Validated on epileptic-seizure and graph classification datasets.
Theoretical links between vector inference and graph domain.
Abstract
Given a finite sequence of graphs, e.g., coming from technological, biological, and social networks, the paper proposes a methodology to identify possible changes in stationarity in the stochastic process generating the graphs. In order to cover a large class of applications, we consider the general family of attributed graphs where both topology (number of vertexes and edge configuration) and related attributes are allowed to change also in the stationary case. Novel Change Point Methods (CPMs) are proposed, that (i) map graphs into a vector domain; (ii) apply a suitable statistical test in the vector space; (iii) detect the change --if any-- according to a confidence level and provide an estimate for its time occurrence. Two specific multivariate CPMs have been designed: one that detects shifts in the distribution mean, the other addressing generic changes affecting the distribution.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
