Change Point Localization and Inference in Dynamic Multilayer Networks
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918072544133120 |
|---|---|
| author | Wang, Fan Ritscher, Kyle Kei, Yik Lun Ma, Xin Padilla, Oscar Hernan Madrid |
| author_facet | Wang, Fan Ritscher, Kyle Kei, Yik Lun Ma, Xin Padilla, Oscar Hernan Madrid |
| contents | We study offline change point localization and inference in dynamic multilayer random dot product graphs (D-MRDPGs), where at each time point, a multilayer network is observed with shared node latent positions and time-varying, layer-specific connectivity patterns. We propose a novel two-stage algorithm that combines seeded binary segmentation with low-rank tensor estimation, and establish its consistency in estimating both the number and locations of change points. Furthermore, we derive the limiting distributions of the refined estimators under both vanishing and non-vanishing jump regimes. To the best of our knowledge, this is the first result of its kind in the context of dynamic network data. We also develop a fully data-driven procedure for constructing confidence intervals. Extensive numerical experiments demonstrate the superior performance and practical utility of our methods compared to existing alternatives. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_21878 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Change Point Localization and Inference in Dynamic Multilayer Networks Wang, Fan Ritscher, Kyle Kei, Yik Lun Ma, Xin Padilla, Oscar Hernan Madrid Methodology We study offline change point localization and inference in dynamic multilayer random dot product graphs (D-MRDPGs), where at each time point, a multilayer network is observed with shared node latent positions and time-varying, layer-specific connectivity patterns. We propose a novel two-stage algorithm that combines seeded binary segmentation with low-rank tensor estimation, and establish its consistency in estimating both the number and locations of change points. Furthermore, we derive the limiting distributions of the refined estimators under both vanishing and non-vanishing jump regimes. To the best of our knowledge, this is the first result of its kind in the context of dynamic network data. We also develop a fully data-driven procedure for constructing confidence intervals. Extensive numerical experiments demonstrate the superior performance and practical utility of our methods compared to existing alternatives. |
| title | Change Point Localization and Inference in Dynamic Multilayer Networks |
| topic | Methodology |
| url | https://arxiv.org/abs/2506.21878 |