Papers › Graph-based Change Point Detection for Functional Data
Graph-based Change Point Detection for Functional Data
Jeremy VanderDoes, Shojaeddin Chenouri
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Modeling functions that are sequentially observed as functional time series is becoming increasingly common. In such models, it is often crucial to ensure data homogeneity. We investigate the sensitivity of graph-based change point detection for changes in the distribution of functional data that demarcate homogeneous regions. Related test statistics and thresholds for detection are given. A key factor in the efficacy of such tests is the graph construction. Practical considerations for constructing a graph on arbitrary data are explored. Simulation experiments investigate tuning parameters for graph construction and evaluate the graph-based methods in comparison to existing functional methods. In addition to sensitivity of lower and higher order changes, robustness to the tuning parameter choices, and practical recommendations, are shown. Applications to multi-year pedestrian counts, high-frequency asset returns, and continuous electricity prices corroborate the simulation results.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections