Corpus ID: 231879567

Optimality of Graph Scanning Statistic for Online Community Detection

@inproceedings{Xie2021OptimalityOG,
  title={Optimality of Graph Scanning Statistic for Online Community Detection},
  author={Liyan Xie and Yao Xie},
  year={2021}
}
Sequential change-point detection for graphs is a fundamental problem for streaming network data types and has wide applications in social networks and power systems. Given fixed vertices and a sequence of random graphs, the objective is to detect the change-point where the underlying distribution of the random graph changes. In particular, we focus on the local change that only affects a subgraph. We adopt the classical Erdős-Rényi model and revisit the generalized likelihood ratio (GLR… Expand

Figures from this paper

References

SHOWING 1-10 OF 20 REFERENCES
Sequential Graph Scanning Statistic for Change-point Detection
Sequential Changepoint Approach for Online Community Detection
Fast Change Point Detection on Dynamic Social Networks
Community Detection in Sparse Random Networks
Detecting Changes in Dynamic Events Over Networks
Detecting Anomalous Activity on Networks With the Graph Fourier Scan Statistic
On the evolution of random graphs
Scan Statistics on Enron Graphs
The Dense k -Subgraph Problem
...
1
2
...