Random Interval Distillation for Detection of Change-Points in Markov Chain Bernoulli Networks
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913565137436672 |
|---|---|
| author | Fan, Xinyuan Wu, Weichi |
| author_facet | Fan, Xinyuan Wu, Weichi |
| contents | We propose a new and generic approach for detecting multiple change-points in dynamic networks with Markov formation, termed random interval distillation (RID). By collecting random intervals with sufficient strength of signals and reassembling them into a sequence of informative short intervals, together with sparse universal singular value thresholding, our new approach can achieve nearly minimax optimality as their independent counterparts for both detection and localization bounds in low-rank networks without any prior knowledge about minimal spacing, which is unlike many previous methods. In particular, motivated by a recent nonasymptotic bound, our method uses the operator norm of CUSUMs of the adjacency matrices, and achieves the aforementioned optimality without sample splitting as required by the previous method. For practical applications, we introduce a clustering-based and data-driven procedure to determine the optimal threshold for signal strength, utilizing the connection between RID and clustering. We examine the effectiveness and usefulness of our methodology via simulations and a real data example. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_00600 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Random Interval Distillation for Detection of Change-Points in Markov Chain Bernoulli Networks Fan, Xinyuan Wu, Weichi Methodology We propose a new and generic approach for detecting multiple change-points in dynamic networks with Markov formation, termed random interval distillation (RID). By collecting random intervals with sufficient strength of signals and reassembling them into a sequence of informative short intervals, together with sparse universal singular value thresholding, our new approach can achieve nearly minimax optimality as their independent counterparts for both detection and localization bounds in low-rank networks without any prior knowledge about minimal spacing, which is unlike many previous methods. In particular, motivated by a recent nonasymptotic bound, our method uses the operator norm of CUSUMs of the adjacency matrices, and achieves the aforementioned optimality without sample splitting as required by the previous method. For practical applications, we introduce a clustering-based and data-driven procedure to determine the optimal threshold for signal strength, utilizing the connection between RID and clustering. We examine the effectiveness and usefulness of our methodology via simulations and a real data example. |
| title | Random Interval Distillation for Detection of Change-Points in Markov Chain Bernoulli Networks |
| topic | Methodology |
| url | https://arxiv.org/abs/2403.00600 |