Change-Point Detection in Dynamic Networks with Missing Links
Farida Enikeeva () and
Olga Klopp ()
Additional contact information
Farida Enikeeva: Laboratoire de Mathématiques et Applications, Unité Mixe de Recherche de Centre National de la Recherche Scientifique 7348, Université de Poitiers, 86073 Poitiers, France
Olga Klopp: Ecole Supérieure de Sciences Economiques et de gestion Business School and Centre de Recherche en Economie et Statistique, Ecole Nationale de la Statistique et l’Administration Economique, 95021 Cergy-Pontoise Cedex, France
Operations Research, 2025, vol. 73, issue 5, 2417-2429
Abstract:
Structural changes occur in dynamic networks quite frequently and their detection is an important question in many situations, such as fraud detection or cybersecurity. Real-life networks are often incompletely observed because of individual nonresponse or network size. In the present paper, we consider the problem of change-point detection at a temporal sequence of partially observed networks. The goal is to test whether there is a change in the network parameters. Our approach is based on the matrix cumulative sum test statistic and allows growing the size of networks. We show that the proposed test is minimax optimal and robust to missing links. We also demonstrate the good behavior of our approach in practice through simulation study and a real-data application.
Keywords: Machine; Learning; and; Data; Science; change point; dynamic networks; missing links; minimax testing; sparsity (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:
Downloads: (external link)
http://dx.doi.org/10.1287/opre.2021.0413 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:73:y:2025:i:5:p:2417-2429
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().