Classification of Temporal Graphs using Persistent Homology

• URL: http://arxiv.org/abs/2502.10076v1
• Date: Fri, 14 Feb 2025 10:55:15 GMT
• Title: Classification of Temporal Graphs using Persistent Homology
• Authors: Siddharth Pritam, Rohit Roy, Madhav Cherupilil Sajeev,
• Abstract summary: Temporal graphs effectively model dynamic systems by representing interactions as timestamped edges. We propose a novel method for analyzing temporal graphs using Persistent Homology. Our approach is node class free, offering flexibility for a wide range of temporal graph analysis.
• Score: 0.0
• License:
• Abstract: Temporal graphs effectively model dynamic systems by representing interactions as timestamped edges. However, analytical tools for temporal graphs are limited compared to static graphs. We propose a novel method for analyzing temporal graphs using Persistent Homology. Our approach leverages $\delta$-temporal motifs (recurrent subgraphs) to capture temporal dynamics %without aggregation . By evolving these motifs, we define the \textit{average filtration} and compute PH on the associated clique complex. This method captures both local and global temporal structures and is stable with respect to reference models. We demonstrate the applicability of our approach to the temporal graph classification task. Experiments verify the effectiveness of our approach, achieving over 92\% accuracy, with some cases reaching 100\%. Unlike existing methods that require node classes, our approach is node class free, offering flexibility for a wide range of temporal graph analysis.

Related papers

• Adaptive Sparsified Graph Learning Framework for Vessel Behavior Anomalies [3.3711670942444014]
  Graph neural networks have emerged as a powerful tool for learning precise interactions. Our method introduces an innovative graph representation where edges are modeled as timestamp nodes. This setup is extended to construct a multi-ship graph that captures spatial interactions while preserving graph sparsity.
  arXiv  Detail & Related papers  (2025-02-20T02:01:40Z)
• Graph-Level Embedding for Time-Evolving Graphs [24.194795771873046]
  Graph representation learning (also known as network embedding) has been extensively researched with varying levels of granularity. We present a novel method for temporal graph-level embedding that addresses this gap.
  arXiv  Detail & Related papers  (2023-06-01T01:50:37Z)
• Deep Temporal Graph Clustering [77.02070768950145]
  We propose a general framework for deep Temporal Graph Clustering (GC) GC introduces deep clustering techniques to suit the interaction sequence-based batch-processing pattern of temporal graphs. Our framework can effectively improve the performance of existing temporal graph learning methods.
  arXiv  Detail & Related papers  (2023-05-18T06:17:50Z)
• Temporal Aggregation and Propagation Graph Neural Networks for Dynamic Representation [67.26422477327179]
  Temporal graphs exhibit dynamic interactions between nodes over continuous time. We propose a novel method of temporal graph convolution with the whole neighborhood. Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
  arXiv  Detail & Related papers  (2023-04-15T08:17:18Z)
• FTM: A Frame-level Timeline Modeling Method for Temporal Graph Representation Learning [47.52733127616005]
  We propose a Frame-level Timeline Modeling (FTM) method that helps to capture both short-term and long-term features. Our method can be easily assembled with most temporal GNNs.
  arXiv  Detail & Related papers  (2023-02-23T06:53:16Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• 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)
• From Static to Dynamic Node Embeddings [61.58641072424504]
  We introduce a general framework for leveraging graph stream data for temporal prediction-based applications. Our proposed framework includes novel methods for learning an appropriate graph time-series representation. We find that the top-3 temporal models are always those that leverage the new $epsilon$-graph time-series representation.
  arXiv  Detail & Related papers  (2020-09-21T16:48:29Z)
• Time-varying Graph Representation Learning via Higher-Order Skip-Gram with Negative Sampling [0.456877715768796]
  We build upon the fact that the skip-gram embedding approach implicitly performs a matrix factorization. We show that higher-order skip-gram with negative sampling is able to disentangle the role of nodes and time. We empirically evaluate our approach using time-resolved face-to-face proximity data, showing that the learned time-varying graph representations outperform state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-06-25T12:04:48Z)

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.