analiza aiqbench
This paper introduces Multiscale Euclidean Network Trajectories (MENT), a novel mathematical framework for analyzing dynamic networks by focusing on second-moment operators and latent position trajectories over time. The research advances the theoretical understanding of how to quantify structural changes, attribute specific nodes to those changes, and localize change points within evolving network snapshots. By establishing bounds between node attributions and trajectory displacements, this work provides a rigorous geometric approach to interpreting temporal evolution in complex systems.
Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Points
arXiv:2605.04589v3 Announce Type: replace-cross Abstract: Understanding a dynamic network requires more than locating when it changes: we also want to know the magnitude and structural direction of change and which nodes contribute. Unfolded spectral embedding places network snapshots in a joint representation, but the underlying rectangular latent factorization is invariant under general linear transformations. Such transformations preserve edge probabilities while potentially distorting Euclidean second moments. We introduce Multiscale Euclidean Network Trajectories (MENT), whose central estimands are pairwise second-moment operators of the dynamic latent positions. Under an isotropic normalization of the shared anchor latent positions, these operators are identifiable up to simultaneous orthogonal conjugation. They yield a global trace variation distance and, through an aggregated operator, shared orthogonal directions for mode-wise distances. The squared global distance decomposes exactly across these modes. Classical multidimensional scaling turns the distances into global and mode-wise trajectories of time. A modified unfolded spectral estimator consistently recovers the operators and induced trajectories, and we establish bounds connecting node attributions to trajectory displacements and trajectory estimation to change point localization. Synthetic experiments validate geometric recovery and show improved detection of mode-specific changes against baselines. Analyses of two real networks illustrate interpretable mode- and node-level descriptions of temporal evolution.
Abstract:Understanding a dynamic network requires more than locating when it changes: we also want to know the magnitude and structural direction of change and which nodes contribute. Unfolded spectral embedding places network snapshots in a joint representation, but the underlying rectangular latent factorization is invariant under general linear transformations. Such transformations preserve edge probabilities while potentially distorting Euclidean second moments. We introduce Multiscale Euclidean Network Trajectories (MENT), whose central estimands are pairwise second-moment operators of the dynamic latent positions. Under an isotropic normalization of the shared anchor latent positions, these operators are identifiable up to simultaneous orthogonal conjugation. They yield a global trace variation distance and, through an aggregated operator, shared orthogonal directions for mode-wise distances. The squared global distance decomposes exactly across these modes. Classical multidimensional scaling turns the distances into global and mode-wise trajectories of time. A modified unfolded spectral estimator consistently recovers the operators and induced trajectories, and we establish bounds connecting node attributions to trajectory displacements and trajectory estimation to change point localization. Synthetic experiments validate geometric recovery and show improved detection of mode-specific changes against baselines. Analyses of two real networks illustrate interpretable mode- and node-level descriptions of temporal evolution.
Machine Learning (stat.ML); Machine Learning (cs.LG); Statistics Theory (math.ST)
arXiv:2605.04589 [stat.ML]
(or arXiv:2605.04589v3 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2605.04589 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 293 cuvinte
Subiecte conexe
Information-Geometric Forward Policy Training in GFlowNets
arXiv · 5 aug. 2026
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · 8 oct. 2026

PIRAMID: Progress and Plans
LessWrong · 27 iul. 2026

[AINews] Agents disprove Polysemanticity; greatly improve Interpretability & Alignment
Latent Space · 16 oct. 2026