Persistent Homology of Time Series through Complex Networks

• URL: http://arxiv.org/abs/2605.01624v1
• Date: Sat, 02 May 2026 22:28:42 GMT
• Title: Persistent Homology of Time Series through Complex Networks
• Abstract summary: A time series is mapped to a graph through one of five constructions across three families.<n>The graph is converted to a dissimilarity matrix from which a Vietoris-Rips filtration yields persistence diagrams.<n>These diagrams are vectorized into fixed-length features through persistence landscapes and topological summary statistics.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a unified pipeline for univariate time series classification via complex networks and persistent homology. A time series is mapped to a graph through one of five constructions across three families (visibility (natural and horizontal visibility graphs), transition, and proximity) and the graph is converted to a dissimilarity matrix from which a Vietoris-Rips filtration yields persistence diagrams. These diagrams are vectorized into fixed-length features through persistence landscapes and topological summary statistics. By standardizing the downstream processing, differences in classification performance are attributable to the network construction and distance metric alone. Experiments on twelve UCR benchmarks show that (i) no single construction dominates: the optimal graph type depends on the signal's discriminative structure; (ii) the graph distance metric is a first-order design choice, with diffusion distance uniformly outperforming shortest-path alternatives; and (iii) persistence-based features degrade gracefully under noise, consistent with the classical stability theorem of persistent homology.

Related papers

• Directed Graph Topology Inference via Graph Filter Identification [54.541275287889164]
  We address the problem of inferring a directed network from nodal measurements generated by a graph convolutional filter.<n>A joint graph filter and topology identification algorithm is also proposed, which alternates between the aforementioned steps to offer improved sample complexity.
  arXiv  Detail & Related papers  (2026-06-25T18:25:57Z)
• Temporal Motif Signatures for Temporal Graph Neural Networks [10.449640808601199]
  We show that a small four-feature family of past-window star counts already delivers most of the lift over a strong static GNN.<n>Across a wide set of real and synthetic temporal datasets we find that motif activity organizes consistently along three scale-stable axes.<n>A temporal Weisfeiler-Leman analysis places the augmentation relative to the first level of an anchored temporal-WL hierarchy and exhibits a candidate-anchored pair on which motif features distinguish.
  arXiv  Detail & Related papers  (2026-05-31T11:32:32Z)
• When Do Graph Foundation Models Transfer? A Data-Centric Theory [68.54337055801571]
  Graph foundation models (GFMs) aim to reuse a single backbone across diverse graph domains, yet their transfer is often uneven and can exhibit negative transfer.<n>We show that for both set-based and message-passing tokenizations, any Lipschitz backbone admits an explicit decomposition of cross-domain output shift.<n>A key ingredient is positional-encoding (PE) stability: we establish stability guarantees for spectral PEs and highlight contrasting behaviors of eigenvector- versus subspace-based PEs.
  arXiv  Detail & Related papers  (2026-05-28T12:07:27Z)
• Intensity Dot Product Graphs [0.0]
  We introduce emphIntensity Dot Product Graphs (IDPGs)<n>This yields a model with random node populations, a PoissonG-style dot-product affinities, and a population-level intensity that links continuous latent structure to observed graphs.<n>Because the model is parameterized by an evolving intensity, temporal extensions through partial differential equations arise naturally.
  arXiv  Detail & Related papers  (2026-04-09T05:08:23Z)
• Time Series Gaussian Chain Graph Models [11.31947474863695]
  We introduce a new class of time series Gaussian chain graph models that represent contemporaneous and lagged causal relations via directed edges across blocks.<n>We exploit this formulation to establish identifiability of the time series chain graph structure.<n>We then propose a three-stage learning procedure for estimating the undirected and directed edge sets.
  arXiv  Detail & Related papers  (2026-04-08T12:36:51Z)
• TSGDiff: Rethinking Synthetic Time Series Generation from a Pure Graph Perspective [6.771711398105306]
  Diffusion models have shown great promise in data generation, yet generating time series data remains challenging.<n>We present textitTSGDiff, a novel framework that rethinks time series generation from a graph-based perspective.<n>A graph neural network-based encoder-decoder architecture is employed to construct a latent space.
  arXiv  Detail & Related papers  (2025-11-15T11:58:25Z)
• Learning Time-Varying Graphs from Incomplete Graph Signals [1.7430416823420511]
  We develop an efficient Alternating Direction Multiplier algorithm for solving the problem of imputing missing data from a graph.<n>We prove that the proposed ADMM scheme converges to and we derive a stationary point.
  arXiv  Detail & Related papers  (2025-10-19T11:12:13Z)
• Counterfactual Intervention Feature Transfer for Visible-Infrared Person Re-identification [69.45543438974963]
  We find graph-based methods in the visible-infrared person re-identification task (VI-ReID) suffer from bad generalization because of two issues. The well-trained input features weaken the learning of graph topology, making it not generalized enough during the inference process. We propose a Counterfactual Intervention Feature Transfer (CIFT) method to tackle these problems.
  arXiv  Detail & Related papers  (2022-08-01T16:15:31Z)
• Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting [50.901984244738806]
  We show how to model the evolutionary and multi-scale interactions of time series. In particular, we first provide a hierarchical graph structure cooperated with the dilated convolution to capture the scale-specific correlations. A unified neural network is provided to integrate the components above to get the final prediction.
  arXiv  Detail & Related papers  (2022-06-28T08:11:12Z)
• Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs [65.18780403244178]
  We propose a continuous model to forecast Multivariate Time series with dynamic Graph neural Ordinary Differential Equations (MTGODE) Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures. Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing.
  arXiv  Detail & Related papers  (2022-02-17T02:17:31Z)
• Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting [75.10017445699532]
  Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem. We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
  arXiv  Detail & Related papers  (2021-11-25T08:45:14Z)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)
• Optimisation of Spectral Wavelets for Persistence-based Graph Classification [0.0]
  We propose a framework that optimises the choice of wavelet for a dataset of graphs. Our framework encodes geometric properties of graphs in their associated persistence diagrams. We apply our framework to graph classification problems and obtain performances competitive with other persistence-based architectures.
  arXiv  Detail & Related papers  (2021-01-10T18:34:27Z)
• Spatio-Temporal Graph Scattering Transform [54.52797775999124]
  Graph neural networks may be impractical in some real-world scenarios due to a lack of sufficient high-quality training data. We put forth a novel mathematically designed framework to analyze-temporal data.
  arXiv  Detail & Related papers  (2020-12-06T19:49:55Z)

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.