Euclidean mirrors and first-order changepoints in network time series
Not on the map. Why?
Abstract (arXiv)
We describe a model for a network time series whose evolution is governed by an underlying stochastic process, known as the latent position process, in which network evolution can be represented in Euclidean space by a curve, called the Euclidean mirror. We define the notion of a first-order changepoint for a time series of networks, and construct a family of latent position process networks with underlying first-order changepoints. We prove that a spectral estimate of the associated Euclidean mirror localizes these changepoints, even when the graph distribution evolves continuously, but at a rate that changes. Simulated and real data examples on organoid networks show that this localization captures empirically significant shifts in network evolution.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 17 May 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 3.
4 papers.
- 2026Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Pointscited by 1
- 2026Control Charts for Multi-agent Systemscited by 1
- 2024Optimizing the Induced Correlation in Omnibus Joint Graph Embeddingscited by 0
- 2026Geodesics of Dynamic Graphs for Regime Change Detectioncited by 0
- 2026Geodesics of Dynamic Graphs for Regime Change Detection5 Jun 2026
- 2026Control Charts for Multi-agent Systems11 May 2026
- 2026Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Points6 May 2026
- 2024Optimizing the Induced Correlation in Omnibus Joint Graph Embeddings26 Sep 2024