• Corpus ID: 231603213

Optimal network online change point localisation

  title={Optimal network online change point localisation},
  author={Yi Yu and Oscar Hernan Madrid Padilla and Daren Wang and Alessandro Rinaldo},
We study the problem of online network change point detection. In this setting, a collection of independent Bernoulli networks is collected sequentially, and the underlying distributions change when a change point occurs. The goal is to detect the change point as quickly as possible, if it exists, subject to a constraint on the number or probability of false alarms. In this paper, on the detection delay, we establish a minimax lower bound and two upper bounds based on NP-hard algorithms and… 

Figures and Tables from this paper

Locally private online change point detection

This work provides algorithms which respect the LDP constraint, which control the false alarm probability, and which detect changes with a minimal (minimax rate-optimal) delay, and presents the optimal rate in the benchmark, non-private setting.

Change-Point Detection in Dynamic Networks with Missing Links

The proposed test for change-point detection at a temporal sequence of partially observed networks is based on the Matrix CUSUM test statistic and allows growing size of networks and is minimax optimal and robust to missing links.

Graph similarity learning for change-point detection in dynamic networks

This work designs a method to perform online network change-point detection that can adapt to the network domain and localise changes with no delay and requires a shorter data history to detect changes than most existing state-of-the-art baselines.

Online Change Point Detection for Random Dot Product Graphs

This paper considers the cumulative sum of a judicious monitoring function, which quantifies the discrepancy between the streaming graph observations and the nominal model, and develops a lightweight online CPD algorithm, with a proven capability to flag distribution shifts in the arriving graphs.

Online Change Point Detection for Weighted and Directed Random Dot Product Graphs

This work offers an open-source implementation of the novel online CPD algorithm for weighted and direct graphs, whose effectiveness and efficiency are demonstrated via (reproducible) synthetic and real network data experiments.

Inference in high-dimensional online changepoint detection

An online algorithm is proposed that produces an interval with guaranteed nominal coverage, and whose length is, with high probability, of the same order as the average detection delay, up to a logarithmic factor.

Algorithmic Advances for the Adjacency Spectral Embedding

This paper brings to bear recent non-convex optimization advances and demonstrates their impact to RDPG inference, and develops first-order gradient descent methods to better solve the original optimization problem and to accommodate broader network embedding applications in an organic way.



Optimal change point detection and localization in sparse dynamic networks

This work proposes a computationally simple novel algorithm for network change point localization, called Network Binary Segmentation, which relies on weighted averages of the adjacency matrices, and devise a more sophisticated algorithm based on singular value thresholding, called Local Refinement, that delivers more accurate estimates of the change point locations.

A Note on Online Change Point Detection

Online change point detection is originated in sequential analysis, which has been thoroughly studied for more than half century. A variety of methods and optimality results have been established

Optimal Change-Point Detection and Localization

This work establishes the energy detection threshold and shows similarly that the optimal localization error of a specific change-point becomes purely parametric, and tightly characterize optimal rates for both problems.

Sequential change-point detection based on nearest neighbors

  • Hao Chen
  • Computer Science
    The Annals of Statistics
  • 2019
We propose a new framework for the detection of change-points in online, sequential data analysis. The approach utilizes nearest neighbor information and can be applied to sequences of multivariate

Sequential change-point detection in high-dimensional Gaussian graphical models

This work introduces a novel scalable online algorithm for detecting an unknown number of abrupt changes in the inverse covariance matrix of sparse Gaussian graphical models with small delay and can be extended to a large class of continuous and discrete graphical models.

Information Bounds and Quick Detection of Parameter Changes in Stochastic Systems

  • T. Lai
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1998
By using information-theoretic bounds and sequential hypothesis testing theory, this paper provides a new approach to optimal detection of abrupt changes in stochastic systems which leads to detection rules which have manageable computational complexity for on-line implementation and yet are nearly optimal under the different performance criteria considered.

Algorithms and Models for the Web Graph

It is argued that the network is robust if τ < 2+ 1 δ , but fails to be robust ifτ > 2 + 1 ε−1 .

Rate-optimal graphon estimation

This paper establishes optimal rate of convergence for graphon estimation in a H\"{o}lder class with smoothness $\alpha$, which is, to the surprise, identical to the classical nonparametric rate.

Communication-efficient algorithms for statistical optimization

A sharp analysis of this average mixture algorithm is provided, showing that under a reasonable set of conditions, the combined parameter achieves mean-squared error that decays as O(N-1 + (N/m)-2).

Delay time in sequential detection of change