# Predicting Path Failure In Time-Evolving Graphs

arXiv: https://arxiv.org/abs/1905.03994 · HTML: https://mlsanity.com/paper/1905.03994/

## Key facts

- Cited by 54 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 May 2019.

## Built on by (most cited first, 30 of 54)

- [All in One: Multi-task Prompting for Graph Neural Networks](https://mlsanity.com/paper/2307.01504/) (2023)
- [ROLAND: Graph Learning Framework for Dynamic Graphs](https://mlsanity.com/paper/2208.07239/) (2022)
- [PyTorch Geometric Temporal: Spatiotemporal Signal Processing with Neural Machine Learning Models](https://mlsanity.com/paper/2104.07788/) (2021)
- [LLMs as Zero-shot Graph Learners: Alignment of GNN Representations with LLM Token Embeddings](https://mlsanity.com/paper/2408.14512/) (2024)
- [On Provable Benefits of Depth in Training Graph Convolutional Networks](https://mlsanity.com/paper/2110.15174/) (2021)
- [Warpformer: A Multi-scale Modeling Approach for Irregular Clinical Time Series](https://mlsanity.com/paper/2306.09368/) (2023)
- [Network of Tensor Time Series](https://mlsanity.com/paper/2102.07736/) (2021)
- [A Comprehensive Survey of Dynamic Graph Neural Networks: Models, Frameworks, Benchmarks, Experiments and Challenges](https://mlsanity.com/paper/2405.00476/) (2024)
- [Modeling Multivariate Biosignals With Graph Neural Networks and Structured State Space Models](https://mlsanity.com/paper/2211.11176/) (2022)
- [A survey of dynamic graph neural networks](https://mlsanity.com/paper/2404.18211/) (2024)
- [Deep learning for dynamic graphs: models and benchmarks](https://mlsanity.com/paper/2307.06104/) (2023)
- [Deconvolutional Networks on Graph Data](https://mlsanity.com/paper/2110.15528/) (2021)
- [Information Gain Propagation: a new way to Graph Active Learning with Soft Labels](https://mlsanity.com/paper/2203.01093/) (2022)
- [Weakly-supervised Temporal Path Representation Learning with Contrastive Curriculum Learning -- Extended Version](https://mlsanity.com/paper/2203.16110/) (2022)
- [Dynamic Graph Representation Learning with Neural Networks: A Survey](https://mlsanity.com/paper/2304.05729/) (2023)
- [You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets](https://mlsanity.com/paper/2211.15335/) (2022)
- [Graph Neural Rough Differential Equations for Traffic Forecasting](https://mlsanity.com/paper/2303.10909/) (2023)
- [Dynamic Hypergraph Structure Learning for Traffic Flow Forecasting](https://mlsanity.com/paper/2309.12028/) (2023)
- [Knowledge Graph Completion with Counterfactual Augmentation](https://mlsanity.com/paper/2302.13083/) (2023)
- [Temporal Graph ODEs for Irregularly-Sampled Time Series](https://mlsanity.com/paper/2404.19508/) (2024)
- [On the Equivalence Between Temporal and Static Graph Representations for Observational Predictions](https://mlsanity.com/paper/2103.07016/) (2021)
- [Weakly Supervised Anomaly Detection via Knowledge-Data Alignment](https://mlsanity.com/paper/2402.03785/) (2024)
- [Message-Passing State-Space Models: Improving Graph Learning with Modern Sequence Modeling](https://mlsanity.com/paper/2505.18728/) (2025)
- [A Co-training Approach for Noisy Time Series Learning](https://mlsanity.com/paper/2308.12551/) (2023)
- [Revisiting Latent-Space Interpolation via a Quantitative Evaluation Framework](https://mlsanity.com/paper/2110.06421/) (2021)
- [Enabling Homogeneous GNNs to Handle Heterogeneous Graphs via Relation Embedding](https://mlsanity.com/paper/2209.11414/) (2022)
- [Rank and Align: Towards Effective Source-free Graph Domain Adaptation](https://mlsanity.com/paper/2408.12185/) (2024)
- [Anomaly Detection in Multiplex Dynamic Networks: from Blockchain Security to Brain Disease Prediction](https://mlsanity.com/paper/2211.08378/) (2022)
- [Supra-Laplacian Encoding for Transformer on Dynamic Graphs](https://mlsanity.com/paper/2409.17986/) (2024)
- [Recurrent Temporal Revision Graph Networks](https://mlsanity.com/paper/2309.12694/) (2023)

## Abstract (arXiv)

In this paper we use a time-evolving graph which consists of a sequence of graph snapshots over time to model many real-world networks. We study the path classification problem in a time-evolving graph, which has many applications in real-world scenarios, for example, predicting path failure in a telecommunication network and predicting path congestion in a traffic network in the near future. In order to capture the temporal dependency and graph structure dynamics, we design a novel deep neural network named Long Short-Term Memory R-GCN (LRGCN). LRGCN considers temporal dependency between time-adjacent graph snapshots as a special relation with memory, and uses relational GCN to jointly process both intra-time and inter-time relations. We also propose a new path representation method named self-attentive path embedding (SAPE), to embed paths of arbitrary length into fixed-length vectors. Through experiments on a real-world telecommunication network and a traffic network in California, we demonstrate the superiority of LRGCN to other competing methods in path failure prediction, and prove the effectiveness of SAPE on path representation.