SOURCE-LINKED INTELLIGENCE

Edge-Girth as a Structural Edge Feature for Graph Neural Networks

arXiv · AI, language, vision and robotics · article · Sep 1, 2026 · UTC

Graph neural networks (GNN) based on message passing are provably no more powerful than the one-dimensional Weisfeiler--Leman colour-refinement test (1-WL): two graphs it cannot tell apart receive identical representations, however deep or wide the network. A common remedy augments node or edge features with precomputed structural descriptors, most often counts of a fixed small subgraph such as triangles or longer cycles, but such counts require committing in advance to the size of the substructure counted, a choice usually made blind to the data. We study a descriptor that avoids this choice.

Read original source ↗ Open in workspace

recordType

paper

region

Global