Weighted-Graph-Based Change Point Detection

by   Lizhen Nie, et al.

We consider the detection and localization of change points in the distribution of an offline sequence of observations. Based on a nonparametric framework that uses a similarity graph among observations, we propose new test statistics when at most one change point occurs and generalize them to multiple change points settings. The proposed statistics leverage edge weight information in the graphs, exhibiting substantial improvements in testing power and localization accuracy in simulations. We derive the null limiting distribution, provide accurate analytic approximations to control type I error, and establish theoretical guarantees on the power consistency under contiguous alternatives for the one change point setting, as well as the minimax localization rate. In the multiple change points setting, the asymptotic correctness of the number and location of change points are also guaranteed. The methods are illustrated on the MIT proximity network data.


page 1

page 2

page 3

page 4


Power of Weighted Test Statistics for Structural Change in Time Series

We investigate the power of some common change-point tests as a function...

Asymptotic distribution-free change-point detection for data with repeated observations

In the regime of change-point detection, a nonparametric framework based...

Graph-based multiple change-point detection

We propose a new multiple change-point detection framework for multivari...

Scan B-Statistic for Kernel Change-Point Detection

Detecting the emergence of an abrupt change-point is a classic problem i...

Fréchet Change Point Detection

We propose a method to infer the presence and location of change-points ...

Non-asymptotic inference for multivariate change point detection

Traditional methods for inference in change point detection often rely o...

Please sign up or login with your details

Forgot password? Click here to reset