Euclidean mirrors and dynamics in network time series
Not on the map. Why?
Abstract (arXiv)
Analyzing changes in network evolution is central to statistical network inference, as underscored by recent challenges of predicting and distinguishing pandemic-induced transformations in organizational and communication networks. We consider a joint network model in which each node has an associated time-varying low-dimensional latent vector of feature data, and connection probabilities are functions of these vectors. Under mild assumptions, the time-varying evolution of the latent vectors exhibits low-dimensional manifold structure under a suitable notion of distance. This distance can be approximated by a measure of separation between the observed networks themselves, and there exist Euclidean representations for underlying network structure, as characterized by this distance, at any given time. These Euclidean representations, called Euclidean mirrors, permit the visualization of network evolution and transform network inference questions such as change-point and anomaly detection into a classical setting. We illustrate our methodology with real and synthetic data, and identify change points corresponding to massive shifts in pandemic policies in a communication network of a large organization.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 May 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 2; 2025: 0; 2026: 3.
6 papers.
- 2022Concentration inequalities for correlated network-valued processes with applications to community estimation and changepoint analysiscited by 1
- 2024Signed Diverse Multiplex Networks: Clustering and Inferencecited by 1
- 2026Control Charts for Multi-agent Systemscited by 1
- 2024Optimizing the Induced Correlation in Omnibus Joint Graph Embeddingscited by 0
- 2026Random Dot Product Graphs as Dynamical Systems: Limitations and Opportunitiescited by 0
- 2026Nonparametric estimation of time-varying network connections by multi-stage smoothingcited by 0
- 2026Control Charts for Multi-agent Systems11 May 2026
- 2026Nonparametric estimation of time-varying network connections by multi-stage smoothing7 May 2026
- 2026Random Dot Product Graphs as Dynamical Systems: Limitations and Opportunities5 Mar 2026
- 2024Optimizing the Induced Correlation in Omnibus Joint Graph Embeddings26 Sep 2024
- 2024Signed Diverse Multiplex Networks: Clustering and Inference14 Feb 2024
- 2022Concentration inequalities for correlated network-valued processes with applications to community estimation and changepoint analysis2 Aug 2022