THeGCN: Temporal Heterophilic Graph Convolutional Network
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) have exhibited remarkable efficacy in diverse graph learning tasks, particularly on static homophilic graphs. Recent attention has pivoted towards more intricate structures, encompassing (1) static heterophilic graphs encountering the edge heterophily issue in the spatial domain and (2) event-based continuous graphs in the temporal domain. State-of-the-art (SOTA) has been concurrently addressing these two lines of work but tends to overlook the presence of heterophily in the temporal domain, constituting the temporal heterophily issue. Furthermore, we highlight that the edge heterophily issue and the temporal heterophily issue often co-exist in event-based continuous graphs, giving rise to the temporal edge heterophily challenge. To tackle this challenge, this paper first introduces the temporal edge heterophily measurement. Subsequently, we propose the Temporal Heterophilic Graph Convolutional Network (THeGCN), an innovative model that incorporates the low/high-pass graph signal filtering technique to accurately capture both edge (spatial) heterophily and temporal heterophily. Specifically, the THeGCN model consists of two key components: a sampler and an aggregator. The sampler selects events relevant to a node at a given moment. Then, the aggregator executes message-passing, encoding temporal information, node attributes, and edge attributes into node embeddings. Extensive experiments conducted on 5 real-world datasets validate the efficacy of THeGCN.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 31 of its 40 references that are in the map. First posted on arXiv 21 Dec 2024.
Builds on
31 of 40 references.
References · 31
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
- 2018Link Prediction Based on Graph Neural Networkscited by 829
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2020Adaptive Graph Convolutional Recurrent Network for Traffic Forecastingcited by 525
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
- 2020Inductive Representation Learning on Temporal Graphscited by 454
19 more
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
- 2020Graph Neural Networks with Heterophilycited by 202
- 2021BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximationcited by 195
- 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
- 2022Graph Neural Networks for Graphs with Heterophily: A Surveycited by 175
- 2022How Powerful are Spectral Graph Neural Networkscited by 169
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 141
- 2022ROLAND: Graph Learning Framework for Dynamic Graphscited by 131
- 2018DynGEM: Deep Embedding Method for Dynamic Graphscited by 100
- 2021GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophilycited by 84
- 2021Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?cited by 82
- 2020APAN: Asynchronous Propagation Attention Network for Real-time Temporal Graph Embeddingcited by 78
- 2020Streaming Graph Neural Networks via Continual Learningcited by 63
- 2022TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphscited by 59
- 2021GCN-SE: Attention as Explainability for Node Classification in Dynamic Graphscited by 12
- 2022RETE: Retrieval-Enhanced Temporal Event Forecasting on Unified Query Product Evolutionary Graphcited by 11
Built on by
Citing papers per year: 2025: 4; 2026: 2.
6 papers.
- 2025Quantization Meets dLLMs: A Systematic Study of Post-training Quantization for Diffusion LLMscited by 21
- 2025Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesicscited by 17
- 2025PLANETALIGN: A Comprehensive Python Library for Benchmarking Network Alignmentcited by 10
- 2026Subspace Alignment for Vision-Language Model Test-time Adaptationcited by 5
- 2026Mixture of Sequence: Theme-Aware Mixture-of-Experts for Long-Sequence Recommendationcited by 4
- 2025Dynamic Homophily with Imperfect Recall: Modeling Resilience in Adversarial Networkscited by 0
- 2026Mixture of Sequence: Theme-Aware Mixture-of-Experts for Long-Sequence Recommendation1 Mar 2026
- 2026Subspace Alignment for Vision-Language Model Test-time Adaptation13 Jan 2026
- 2025Dynamic Homophily with Imperfect Recall: Modeling Resilience in Adversarial Networks13 Dec 2025
- 2025Quantization Meets dLLMs: A Systematic Study of Post-training Quantization for Diffusion LLMs20 Aug 2025
- 2025PLANETALIGN: A Comprehensive Python Library for Benchmarking Network Alignment27 May 2025
- 2025Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics19 May 2025