Online Community Detection by Spectral CUSUM

10/20/2019
by   Minghe Zhang, et al.
0

We present an online community change detection algorithm called spectral CUSUM to detect the emergence of a community using a subspace projection procedure based on a Gaussian model setting. Theoretical analysis is provided to characterize the average run length (ARL) and expected detection delay (EDD), as well as the asymptotic optimality. Simulation and real data examples demonstrate the good performance of the proposed method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2020

Sequential Change Detection by Optimal Weighted ℓ_2 Divergence

We present a new non-parametric statistics, called the weighted ℓ_2 dive...
research
07/22/2014

Sequential Changepoint Approach for Online Community Detection

We present new algorithms for detecting the emergence of a community in ...
research
04/19/2022

Understanding Toxicity Triggers on Reddit in the Context of Singapore

While the contagious nature of online toxicity sparked increasing intere...
research
05/25/2015

Sketching for Sequential Change-Point Detection

We study sequential change-point detection using sketches (linear projec...
research
01/24/2019

Asynchronous Multi-Sensor Change-Point Detection for Seismic Tremors

We consider the sequential change-point detection for asynchronous multi...
research
09/03/2020

Online Community Detection for Event Streams on Networks

A common goal in network modeling is to uncover the latent community str...
research
06/19/2019

Bump detection in the presence of dependency: Does it ease or does it load?

We provide the asymptotic minimax detection boundary for a bump, i.e. an...

Please sign up or login with your details

Forgot password? Click here to reset