arrow
Return

Representing Tuple in Graph with Trail Structure

delete2026-03-01
delete0
PRE
AI
Z
Zhongbao Zhang *
Z
Zhizhen He
J
Junda Ye
孙
孙黎 (Li Sun)
DOI:10.1145/3795689delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In recent years, Message Passing Neural Networks (MPNNs) have emerged as a leading paradigm for learning over graph-structured data, owing to their simple architecture and excellent scalability. However, their expressive power is strictly limited by the one-dimensional Weisfeiler-Leman (1-WL) test. A common approach to enhance expressivity is designing models based on higher-order k-WL and k-Folklore WL (k-FWL) tests, collectively referred to as tuple-based GNNs. Despite their greater expressive power, these methods face two major challenges: (1) The neighboring tuples in k-WL/F WL are generated by replacing any node in the graph, disregarding adjacency relationships and thus failing to capture structural dependencies between tuples. (2) The design of k-WL/F WL lacks flexibility, while increasing k enhances expressivity, it also results in an exponential surge in time and space complexity. To overcome these limitations, we propose Trail-WL, a more expressive variant of the WL test, along with its neural network counterpart, Trail-based Tuple Neural Network (TTNN). We redefine node tuples as collections of trail structures, providing a more intuitive representation of graph connectivity compared to prior tuple-based methods. By incorporating variable trail lengths and node distance constraints, our model adaptively balances expressivity and scalability while preserving essential structural features. Furthermore, we propose and formally prove three theoretical expressivity theorems for Trail-WL. Finally, we conduct comprehensive experiments on both synthetic and real-world datasets, demonstrating that our approach consistently matches or outperforms baseline methods, thereby substantiating its effectiveness.
Keywords:
Graph Neural Networks
Graph Representation Learning
Expressive Power of GNNs

Journal

ACM Transactions on Knowledge Discovery from Data cover
ACM Transactions on Knowledge Discovery from Data
IF:
4.8
Papers:
1.3K
Citations:
4.4K

Organization

B
beijing university of posts & telecommunications
Scholars:
1.4W
Papers: 1.2W
Citations: 9
Cited Papers

Cited Papers

Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
err2023-01-01
err0
errOAAI
errGiorgos Bouritsas; Fabrizio Frasca; Stefanos Zafeiriou; Michael M. Bronstein
errShare
errSave
A Survey of Machine Learning for Big Code and Naturalness
err2018-07-31
err477
errOAAI
errAllamanis, Miltiadis; Barr, Earl T.; Devanbu, Premkumar; Sutton, Charles
errShare
errSave
Identity-aware Graph Neural Networks
err2021-05-18
err0
errOAAI
errJiaxuan You; Jonathan M Gomes-Selman; Rex Ying; Jure Leskovec
errShare
errSave
The Expressive Power of Graph Neural Networks: A Survey
err2025-03-01
err0
PREAI
errBingxu Zhang; Changjun Fan; Shixuan Liu; Kuihua Huang; Xiang Zhao; Jincai Huang; Zhong Liu
errShare
errSave
Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks
err2019-07-17
err0
errOAAI
errChristopher Morris; Martin Ritzert; Matthias Fey; William L. Hamilton; Jan Eric Lenssen; Gaurav Rattan; Martin Grohe
errShare
errSave
MoleculeNet: a benchmark for molecular machine learning
err2018-01-01
err0
PREAI
errZhenqin Wu; Bharath Ramsundar; Evan N. Feinberg; Joseph Gomes; Caleb Geniesse; Aneesh S. Pappu; Karl Leswing; Vijay Pande
errShare
errSave
no more