Adjacency Spectral Embeddings of Correlation Networks

• URL: http://arxiv.org/abs/2602.21055v1
• Date: Tue, 24 Feb 2026 16:13:33 GMT
• Title: Adjacency Spectral Embeddings of Correlation Networks
• Abstract summary: In many applications, weighted networks are constructed based on time series data.<n>We show that when time series are expressible in terms of a small number of Fourier basis elements, correlation networks correspond to latent space networks with dependent edge noise.
• Score: 2.538209532048867
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In many applications, weighted networks are constructed based on time series data: each time series is associated to a vertex and edge weights are given by pairwise correlations. The result is a network whose edge dependency structure violates the assumptions of most common network models. Nonetheless, it is common to analyze these "correlation networks" using embedding methods derived from edge-independent network models, based on a belief that the edges are approximately independent. In this work, we put this modeling choice on firm theoretical ground. We show that when the time series are expressible in terms of a small number of Fourier basis elements (or in some other suitably-chosen basis), correlation networks correspond to latent space networks with dependent edge noise in which the vertex-level latent variables encode the basis coefficients. Further, we show that when time series are observed subject to noise, spectral embedding of the resulting noisy correlation network still recovers these true vertex-level latent representations under suitable assumptions. This characterization of embeddings as learning Fourier coefficients appears to be folklore in the signal processing community in the context of principal component analysis, but is, to the best of our knowledge, new to the statistical network analysis literature.

Related papers

• Algorithmic Separation between Constant-Depth and Logarithmic-Depth Neural Networks [64.7580803923092]
  We prove the first algorithmic separation between constant-depth and logarithmic-depth networks.<n>Specifically, we identify a class of Boolean functions with hierarchically structured spectra that logarithmic-depth networks can learn efficiently.
  arXiv  Detail & Related papers  (2026-07-28T02:13:30Z)
• T-GINEE: A Tensor-Based Multilayer Graph Representation Learning [50.294562905744215]
  T-GINEE is a statistical regularization framework combining tensor-based generalized estimating equations with task-specific loss to model cross-network correlations explicitly.<n>Our theoretical analysis establishes consistency and normality under mild conditions.<n>Extensive experiments on synthetic and real-world datasets validate T-GINEE's effectiveness for multilayer network analysis.
  arXiv  Detail & Related papers  (2026-05-27T10:51:29Z)
• Variational Bayesian Flow Network for Graph Generation [54.94088904387278]
  We propose Variational Bayesian Flow Network (VBFN) for graph generation.<n>VBFN performs variational lifting to a tractable joint Gaussian variational belief family governed by structured precisions.<n>On synthetic and molecular graph datasets, VBFN improves fidelity and diversity, and surpasses baseline methods.
  arXiv  Detail & Related papers  (2026-01-30T03:59:38Z)
• Latent Structural Similarity Networks for Unsupervised Discovery in Multivariate Time Series [0.0]
  Method learns window-level sequence representations using an unsupervised sequence-to-sequence autoencoder.<n>It induces a sparse similarity network by thresholding a latent-space similarity measure.<n>This network is intended as an analyzable abstraction that compresses the pairwise search space.
  arXiv  Detail & Related papers  (2026-01-15T03:05:17Z)
• Hierarchical Representations for Evolving Acyclic Vector Autoregressions (HEAVe) [0.04096453902709291]
  Causal networks offer an intuitive framework to understand influence structures within time series systems.<n>The presence of cycles can obscure dynamic relationships and hinder hierarchical analysis.<n>We propose an evolutionary approach to fitting acyclic vector autoregressive processes and introduce a novel hierarchical representation.
  arXiv  Detail & Related papers  (2025-05-19T07:33:01Z)
• MFRS: A Multi-Frequency Reference Series Approach to Scalable and Accurate Time-Series Forecasting [51.94256702463408]
  Time series predictability is derived from periodic characteristics at different frequencies.<n>We propose a novel time series forecasting method based on multi-frequency reference series correlation analysis.<n> Experiments on major open and synthetic datasets show state-of-the-art performance.
  arXiv  Detail & Related papers  (2025-03-11T11:40:14Z)
• Inferring Dynamic Networks from Marginals with Iterative Proportional Fitting [57.487936697747024]
  A common network inference problem, arising from real-world data constraints, is how to infer a dynamic network from its time-aggregated adjacency matrix. We introduce a principled algorithm that guarantees IPF converges under minimal changes to the network structure.
  arXiv  Detail & Related papers  (2024-02-28T20:24:56Z)
• Recovering the Graph Underlying Networked Dynamical Systems under Partial Observability: A Deep Learning Approach [7.209528581296429]
  We study the problem of graph structure identification, i.e., of recovering the graph of dependencies among time series. We devise a new feature vector computed from the observed time series and prove that these features are linearly separable. We use these features to train Convolutional Neural Networks (CNNs)
  arXiv  Detail & Related papers  (2022-08-08T20:32:28Z)
• Entangled Residual Mappings [59.02488598557491]
  We introduce entangled residual mappings to generalize the structure of the residual connections. An entangled residual mapping replaces the identity skip connections with specialized entangled mappings. We show that while entangled mappings can preserve the iterative refinement of features across various deep models, they influence the representation learning process in convolutional networks.
  arXiv  Detail & Related papers  (2022-06-02T19:36:03Z)
• A Coupled CP Decomposition for Principal Components Analysis of Symmetric Networks [11.988825533369686]
  We propose a principal components analysis (PCA) framework for sequence network data. We derive efficient algorithms for computing our proposed "Coupled CP" decomposition. We demonstrate the effectiveness of our proposal on simulated data and on examples from political science and financial economics.
  arXiv  Detail & Related papers  (2022-02-09T20:52:19Z)
• NOTMAD: Estimating Bayesian Networks with Sample-Specific Structures and Parameters [70.55488722439239]
  We present NOTMAD, which learns to mix archetypal networks according to sample context. We demonstrate the utility of NOTMAD and sample-specific network inference through analysis and experiments, including patient-specific gene expression networks.
  arXiv  Detail & Related papers  (2021-11-01T17:17:34Z)
• Novel Features for Time Series Analysis: A Complex Networks Approach [62.997667081978825]
  Time series data are ubiquitous in several domains as climate, economics and health care. Recent conceptual approach relies on time series mapping to complex networks. Network analysis can be used to characterize different types of time series.
  arXiv  Detail & Related papers  (2021-10-11T13:46:28Z)
• Clustered Federated Learning via Generalized Total Variation Minimization [83.26141667853057]
  We study optimization methods to train local (or personalized) models for local datasets with a decentralized network structure. Our main conceptual contribution is to formulate federated learning as total variation minimization (GTV) Our main algorithmic contribution is a fully decentralized federated learning algorithm.
  arXiv  Detail & Related papers  (2021-05-26T18:07:19Z)
• The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks [4.238478445823]
  Spectral inference on multiple networks is a rapidly-developing subfield of graph statistics. Recent work has demonstrated that joint, or simultaneous, spectral embedding of multiple independent networks can deliver more accurate estimation. We present a generalized omnibus embedding methodology and provide a detailed analysis of this embedding across both independent and correlated networks.
  arXiv  Detail & Related papers  (2020-08-01T03:43:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.