Repurposing Unified Topological Signatures for Graph Representation Learning
Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn graph representations. However, their discriminative power is upper-bounded by the Weisfeiler--Lehman (1-WL) graph isomorphism test. This prevents GNNs from distinguishing certain non-isomorphic graphs with identical local neighborhood structures,…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
