Optimal Sequential Tests for Detection of Changes under Finite measure space for Finite Sequences of Networks

Abstract

This paper considers the change-point problem for finite sequences of networks. To avoid the difficulty of computing the normalization coefficient, such as in Exponential random graphical models (ERGMs) and Markov networks, we construct a finite measure space with measure ratio statistics. A new performance measure of detection delay is proposed to detect the changes in distribution of the network. And an optimal sequential test is proposed under the performance measure. The good performance of the optimal sequential test is illustrated numerically on ERGMs and Erdos-Rényi network sequences.

References in corpus (6)

• A Separable Model for Dynamic Networks
• On optimality of the Shiryaev-Roberts procedure for detecting a change in distribution
• Sequential change detection revisited
• Model-based clustering of large networks
• Sequential change-point detection in high-dimensional Gaussian graphical models
• Optimal Sequential Tests for Monitoring Changes in the Distribution of Finite Observation Sequences