Change-Point Detection in Dynamic Networks with Missing Links

Published Online:https://doi.org/10.1287/opre.2021.0413

References

  • Akoglu L, Tong H, Koutra D (2015) Graph based anomaly detection and description: A survey. Data Mining Knowledge Discovery 29(3):626–688.CrossrefGoogle Scholar
  • Ayi N, Pouradier Duteil N (2023) Graph limit for interacting particle systems on weighted random graphs. Preprint, submitted July 24, https://arxiv.org/abs/2307.12801.Google Scholar
  • Bandeira AS, van Handel R (2016) Sharp nonasymptotic bounds on the norm of random matrices with independent entries. Ann. Probab. 44(4):2479–2506.CrossrefGoogle Scholar
  • Bhattacharjee M, Banerjee M, Michailidis G (2020) Change point estimation in a dynamic stochastic block model. J. Machine Learn. Res. 21(107):1–59.Google Scholar
  • Borgs C, Chayes J, Lovász L, Sós V, Vesztergombi K (2008) Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Adv. Math. 219(6):1801–1851.CrossrefGoogle Scholar
  • Catanese SA, De Meo P, Ferrara E, Fiumara G, Provetti A (2011) Crawling Facebook for social network analysis purposes. Proc. Internat. Conf. Web Intelligence Mining Semantics (Association for Computing Machinery, New York), 1–8.Google Scholar
  • Chen H, Zhang N (2015) Graph-based change-point detection. Ann. Statist. 43(1):139–176.CrossrefGoogle Scholar
  • Chen L, Zhou J, Lin L (2021) Hypothesis testing for populations of networks. Comm. Statist. Theory Methods 52:3661–3684.Google Scholar
  • Chu L, Chen H (2019) Asymptotic distribution-free change-point detection for multivariate and non-Euclidean data. Ann. Statist. 47(1):382–414.CrossrefGoogle Scholar
  • Corneli M, Latouche P, Rossi F (2018) Multiple change points detection and clustering in dynamic networks. Statist. Comput. 28:989–1007.CrossrefGoogle Scholar
  • Cortinovis A, Kressner D (2021) On randomized trace estimates for indefinite matrices with an application to determinants. Foundations Comput. Math. 22(3):875–903.CrossrefGoogle Scholar
  • Cribben I, Yu Y (2017) Estimating whole-brain dynamics using spectral clustering. J. Roy. Statist. Soc. Ser. C 66(3):607–627.CrossrefGoogle Scholar
  • Fogel F, Jenatton R, Bach F, D’Aspremont A (2013) Convex relaxations for permutation problems. Burges C, Bottou L, Welling M, Ghahramani Z, Weinberger K, eds. Adv. Neural Inform. Processing Systems, vol. 26 (Curran Associates, Inc., Red Hook, NY).Google Scholar
  • Follain B, Wang T, Samworth RJ (2022) High-dimensional change point estimation with heterogeneous missingness. J. Roy. Statist. Soc. Ser. B Statist. Methodology 84(3):1023–1055.CrossrefGoogle Scholar
  • Frick K, Munk A, Sieling H (2014) Multiscale change point inference. J. Roy. Statist. Soc. Ser. B Statist. Methodology 76(3):495–580.CrossrefGoogle Scholar
  • Fryzlewicz P (2014) Wild binary segmentation for multiple change-point detection. Ann. Statist. 42(6):2243–2281.CrossrefGoogle Scholar
  • Gao S, Caines PE (2020) Graphon control of large-scale networks of linear systems. IEEE Trans. Automatic Control 65(10):4090–4105.CrossrefGoogle Scholar
  • Gao C, Lu Y, Ma Z, Zhou H (2016) Optimal estimation and completion of matrices with biclustering structures. J. Machine Learn. Res. 17(1):5602–5630.Google Scholar
  • Ghoshdastidar D, Gutzeit M, Carpentier A, von Luxburg U (2020) Two-sample hypothesis testing for inhomogeneous random graphs. Ann. Statist. 48(4):2208–2229.CrossrefGoogle Scholar
  • Guimerà R, Sales-Pardo M (2009) Missing and spurious interactions and the reconstruction of complex networks. Proc. Natl. Acad. Sci. USA 106(52):22073–22078.CrossrefGoogle Scholar
  • Handcock MS, Gile KJ (2010) Modeling social networks from sampled data. Ann. Appl. Statist. 4(1):5–25.CrossrefGoogle Scholar
  • Hewapathirana IU, Lee D, Moltchanova E, McLeod J (2020) Change detection in noisy dynamic networks: A spectral embedding approach. Soc. Network Anal. Mining 10(1):14.CrossrefGoogle Scholar
  • Ingster YI, Suslina IA (2003) Nonparametric Goodness-of-Fit Testing Under Gaussian Models (Springer, New York).CrossrefGoogle Scholar
  • Jiang B, Li J, Yao Q (2023) Autoregressive networks. J. Machine Learn. Res. 24(227):1–69.Google Scholar
  • Klopp O, Tsybakov AB, Verzelen N (2017) Oracle inequalities for network models and sparse graphon estimation. Ann. Statist. 45(1):316–354.CrossrefGoogle Scholar
  • Liu H, Gao C, Samworth RJ (2021) Minimax rates in sparse, high-dimensional change point detection. Ann. Statist. 49(2):1081–1112.CrossrefGoogle Scholar
  • Londschien M, Kovács S, Bühlmann P (2021) Change-point detection for graphical models in the presence of missing values. J. Comput. Graphical Statist. 30(3):768–779.CrossrefGoogle Scholar
  • Lovász L (2012) Large Networks and Graph Limits, American Mathematical Society Colloquium Publications, vol. 60 (American Mathematical Society, Providence, RI).CrossrefGoogle Scholar
  • Lovász L, Szegedy B (2006) Limits of dense graph sequences. J. Combin. Theory Ser. B 96(6):933–957.CrossrefGoogle Scholar
  • Navarro M, Segarra S (2022) Joint network topology inference via a shared graphon model. IEEE Trans. Signal Processing 70:5549–5563.CrossrefGoogle Scholar
  • Padilla OHM, Yu Y, Priebe CE (2022) Change point localization in dependent dynamic nonparametric random dot product graphs. J. Machine Learn. Res. 23(234):1–59.Google Scholar
  • Peel L, Clauset A (2015) Detecting change points in the large-scale structure of evolving networks. Proc. AAAI Conf. Artificial Intelligence (AAAI Press, Austin, TX), 2914–2920.Google Scholar
  • Pilliat E, Carpentier A, Verzelen N (2023) Optimal multiple change-point detection for high-dimensional data. Electronic J. Statist. 17(1):1240–1315.CrossrefGoogle Scholar
  • Sulem D, Kenlay H, Cucuringu M, Dong X (2022) Graph similarity learning for change-point detection in dynamic networks. Preprint, submitted March 29, https://arxiv.org/abs/2203.15470.Google Scholar
  • Verzelen N, Fromont M, Lerasle M, Reynaud-Bouret P (2023) Optimal change-point detection and localization. Ann. Statist. 51(4):1586–1610.CrossrefGoogle Scholar
  • Wang T, Samworth RJ (2018) High dimensional change point estimation via sparse projection. J. Roy. Statist. Soc. Ser. B 80(1):57–83.CrossrefGoogle Scholar
  • Wang D, Yu Y, Rinaldo A (2021) Optimal change point detection and localization in sparse dynamic networks. Ann. Statist. 49(1):203–232.CrossrefGoogle Scholar
  • Wang Y, Chakrabarti A, Sivakoff D, Parthasarathy S (2017) Hierarchical change point detection on dynamic networks. Proc. 2017 ACM Web Sci. Conf. (Association for Computing Machinery, New York), 171–179.Google Scholar
  • Wang H, Tang M, Park Y, Priebe CE (2014) Locality statistics for anomaly detection in time series of graphs. IEEE Trans. Signal Processing 62(3):703–717.CrossrefGoogle Scholar
  • Xie Y, Huang J, Willett R (2013) Change-point detection for high-dimensional time series with missing data. IEEE J. Selected Topics Signal Processing 7(1):12–27.CrossrefGoogle Scholar
  • Xu H, Dubey P, Yu Y (2021) Online network change point detection with missing values and temporal dependence. Preprint, submitted October 13, https://arxiv.org/abs/2110.06450.Google Scholar
  • Yu Y, Padilla OHM, Wang D, Rinaldo A (2021) Optimal network online change point localisation. Preprint, submitted January 14, https://arxiv.org/abs/2101.05477.Google Scholar
  • Zhang M, Xie L, Xie Y (2020) Online community detection by spectral CUSUM. 2020 IEEE Internat. Conf. Acoustics Speech Signal Processing (IEEE, Piscataway, NJ), 3402–3406.Google Scholar
  • Zhao Z, Chen L, Lin L (2019) Change-point detection in dynamic networks via graphon estimation. Preprint, submitted August 5, https://arxiv.org/abs/1908.01823.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.